scispace - formally typeset
Journal ArticleDOI

Channel coding with multilevel/phase signals

G. Ungerboeck
- 01 Jan 1982 - 
- Vol. 28, Iss: 1, pp 55-67
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

Rate-Adaptive Coded Modulation for Fiber-Optic Communications

TL;DR: This work constructs a rate-adaptive CM scheme combining a single low-density parity-check code with a family of three signal constellations and using probabilistic signal shaping, and introduces a four-dimensional CM scheme, which shows a better tradeoff between digital signal processing complexity and transparent reach than existing methods.
Patent

Turbo product code decoder

Eric Hewitt
TL;DR: In this article, a turbo product code decoder for decoding multi-dimensional coding schemes is presented. But the decoder is configured for receiving soft decision values, and the soft difference values from each axis-iteration are then summed with the original soft decision value in decoding each of the other axis.
Journal ArticleDOI

Bandwidth efficient parallel concatenated coding schemes

TL;DR: The authors propose a solution to the parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure that outperforms all codes reported in the past for the same throughput.

Serial and Hybrid Concatenated Codes with Applications

TL;DR: Analytical bounds on the performance of concatenated codes on a tree structure are obtained and results are applied to examples of parallel concatenation of two codes, serial concatenators, hybrid concatenations of three codes, and self concatenating codes, over AWGN and fading channels.
Journal ArticleDOI

Advances in constant envelope coded modulation

TL;DR: An overview of recent advances in constant envelope combined coding and modulation is given, and concatenations of phase codes and convolutional codes are examined.
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.