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

Physical layer loading algorithms for indoor wireless multicarrier systems

TL;DR: This work proposes two novel discrete bit allocation algorithms that strive to reach the optimal solution in a low computational complexity fashion, while constrained to a specified error performance.
Journal ArticleDOI

Efficient two-dimensional interleaving technique by use of the set partitioning concept

TL;DR: The authors propose an efficient two-dimensional interleaving technique which spreads a cluster of errors having a quasi-circular shape, and simple one-dimensional random-error correcting codes can be used to correct this kind of cluster, instead of the more complex burst-error-correcting codes.
Proceedings ArticleDOI

Variable-rate coded MQAM for fading channels

TL;DR: The author presents analytical performance results for the coding technique, and compares it with built-in time diversity coded modulation, which assumes no channel information at the transmitter.
Journal ArticleDOI

Low-Density Graph Codes for slow fading Relay Channels

TL;DR: In this paper, the authors considered two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the latter, and derived a new code structure by extending the previously published full diversity root-LDPC code, designed for the BF point-to-point channel, to exhibit a rate-compatibility property which is necessary for coded cooperation.
Journal ArticleDOI

Asymptotically optimal mappings for bicm with m-pam and m 2 -qam

TL;DR: The asymptotic optimality of particular binary labelling rules is proved for M-PAM and M2-QAM constellations in the wideband regime in terms of the so-called parallel-decoding capacity, also known as bit-interleaved coded modulation capacity.
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.