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
Patent

Source coded modulation system

TL;DR: In this paper, the authors propose an approach for sending bits of information over a band-limited channel by modulating a carrier in accordance with a sequence of signal points drawn from a constellation of available signal points, in which the apparatus includes circuitry for accumulating groups of the information bits for encoding into the signal points.
Journal ArticleDOI

Turbo space-time codes with time varying linear transformations

TL;DR: It is shown that turbo codes with TVLT achieve full diversity gain and do not require exhaustive tests of the rank criterion, and it is proved that the coding gain performance of turbo space-time codes withTVLT improves with the Hamming distance between codewords.
Journal ArticleDOI

Ungerboeck codes do not shape the signal power spectrum (Corresp.)

TL;DR: It is shown that a carefully designed Ungerboeck code does not shape the spectrum and simple sufficient conditions are found for the spectrum of Unger boeck-coded signals to be equal to the Spectrum of uncoded signals.
Journal ArticleDOI

Error probability of bit-interleaved coded modulation in wireless environments

TL;DR: Union bounds on the bit and packet error probabilities of the BICM are derived and are general for any coding scheme with a known distance spectrum.
Journal ArticleDOI

Nearest neighbor algorithm for spherical codes from the Leech lattice

TL;DR: A nearest-neighbor algorithm that works on this is developed to determine the point in the code closet to some arbitrary vector in R/sup 24/.
References
More filters
Book

Information Theory and Reliable Communication

TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI

The viterbi algorithm

TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
Book

Principles of Communication Engineering

TL;DR: Textbook on communication engineering emphasizing random processes, information and detection theory, statistical communication theory, applications, etc.
Journal ArticleDOI

Convolutional codes I: Algebraic structure

TL;DR: Minimal encoders are shown to be immune to catastrophic error propagation and, in fact, to lead in a certain sense to the shortest decoded error sequences possible per error event.
Journal ArticleDOI

Coherent and Noncoherent Detection CPFSK

TL;DR: This work provides a complete analysis of the performance of CPFSK at high SNR as well as low SNR and thereby unifies and extends the results previously available.