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

Fountain codes over fading relay channels

TL;DR: To reduce decoding complexity, a soft-decision version of the adaptive demodulation (ADM) method recently introduced in the literature at each receiver is proposed, and the time-division (TD) protocol retains its relative superiority over the space-time one.
Journal ArticleDOI

Techniques of bounding the probability of decoding error for block coded modulation structures

TL;DR: Two techniques for upper bounding the average probability of decoding error in coded modulation structures are presented and it is shown that for the Leech lattice this upper bound is very close to a sphere lower bound.
Journal ArticleDOI

Adaptive bit-interleaved coded modulation

TL;DR: Adaptive bit-interleaved coded modulation (BICM) is introduced, which removes the need for parallel branches in the trellis-even when adapting the constellation size, thus making these schemes robust to errors made in the estimation of the current channel fading value.
Journal ArticleDOI

Multiple description trellis-coded quantization

TL;DR: The tensor product of trellises is used to build a trellis which is applicable to multiple description coding and provides remarkable performance with little encoding complexity.
Patent

Near-end, far-end and echo cancellers in a multi-channel transceiver system

TL;DR: In this paper, a transceiver can include a transmitter portion and a receiver portion with one or more receivers coupled to receive signals in the plurality of frequency separated transmission channels, and an interference filter for correcting for interference from transmitters other than the complementary transmitter.
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.