scispace - formally typeset
Journal ArticleDOI

Channel coding with multilevel/phase signals

G. Ungerboeck
- 01 Jan 1982 - 
- Vol. 28, Iss: 1, pp 55-67
Reads0
Chats0
TLDR
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance.
Abstract
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance. Soft maximum--likelihood (ML) decoding using the Viterbi algorithm is assumed. Following a discussion of channel capacity, simple hand-designed trellis codes are presented for 8 phase-shift keying (PSK) and 16 quadrature amplitude-shift keying (QASK) modulation. These simple codes achieve coding gains in the order of 3-4 dB. It is then shown that the codes can be interpreted as binary convolutional codes with a mapping of coded bits into channel signals, which we call "mapping by set partitioning." Based on a new distance measure between binary code sequences which efficiently lower-bounds the Euclidean distance between the corresponding channel signal sequences, a search procedure for more powerful codes is developed. Codes with coding gains up to 6 dB are obtained for a variety of multilevel/phase modulation schemes. Simulation results are presented and an example of carrier-phase tracking is discussed.

read more

Citations
More filters
Journal ArticleDOI

On Limits of Wireless Communications in a Fading Environment when UsingMultiple Antennas

TL;DR: In this article, the authors examined the performance of using multi-element array (MEA) technology to improve the bit-rate of digital wireless communications and showed that with high probability extraordinary capacity is available.
Book

Wireless Communications

Journal ArticleDOI

Space-time codes for high data rate wireless communication: performance criterion and code construction

TL;DR: In this paper, the authors consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas and derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective.
Journal ArticleDOI

Near optimum error correcting coding and decoding: turbo-codes

TL;DR: A new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving appears to be close to the theoretical limit predicted by Shannon.
Journal ArticleDOI

Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing

TL;DR: The analysis and simulation of a technique for combating the effects of multipath propagation and cochannel interference on a narrow-band digital mobile channel using the discrete Fourier transform to orthogonally frequency multiplex many narrow subchannels, each signaling at a very low rate, into one high-rate channel is discussed.
References
More filters
Journal ArticleDOI

A bandwidth-efficient class of signal-space codes

TL;DR: A new class of codes in signal space is presented, and their error and spectral properties are investigated, and power spectral density curves show that this type of coding does not increase the transmitted signal bandwidth.
Journal ArticleDOI

Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)

TL;DR: In this paper, a search procedure was developed to find good short binary (N,N - 1) convolutional codes using simple rules to discard from the complete ensemble of codes a large fraction whose free distance d{free} either cannot achieve the maximum value or is equal to d_{free} of some code in the remaining set.
Journal ArticleDOI

Symbol Error Probabilities for M-ary CPFSK: Coherent and Noncoherent Detection

TL;DR: New results presented here show that M -ary CPFSK outperforms more tranditionally used M-ary modulation systems and performance improvements are estimates derived from symbol error probability upper bounds.
Journal ArticleDOI

An efficient algorithm for computing free distance (Corresp.)

TL;DR: An efficient bidirectional search algorithm for computing the free distance of convolutional codes is described.
Journal ArticleDOI

Simulated error performance of multi-h phase codes (Corresp.)

TL;DR: In this article, the transmission of multi-h phase coded signals over a Gaussian noise channel with Viterbi decoder is simulated and the power gain compared to MSK modulation varies from 1.5 dB at bit error rate 0.05 to 4 dB at 0.0001.