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

Erasure-free sequential decoding of trellis codes

TL;DR: An erasure-free sequential decoding algorithm for trellis codes, called the buffer looking algorithm (BLA), is introduced and it is shown by analysis and simulation that continuous sequential decoding using this scheme has a high probability of resynchronizing successfully.
Journal ArticleDOI

Trellis group codes for the Gaussian channel

TL;DR: Trellis group codes are introduced as an extension of Slepian group codes to codes over sequence spaces and it is shown that the 8-state, rotationally invariant trellis code designed by Wei (1984), used in the V.32 international modem standard, belongs to this class.
Journal ArticleDOI

A Space-Time Trellis Code Design Method for OFDM Systems

TL;DR: A new design method for space-time trelliscodes (STTC's) in orthogonal frequency-division multiplexing (OFDM) systems with frequency-selective fading and the excellent performance of the proposed STTC's are demonstrated through computers simulations.
Journal ArticleDOI

Hybrid-ARQ scheme using different TCM for retransmission

TL;DR: A new hybrid automatic repeat-request (ARQ) scheme that uses supplementary trellis codes for retransmission is described, which provides improved (d/sub free//sup 2/) upon retransmissions compared with that provided by the conventional Trellis coded hybrid-ARQ scheme.
Journal ArticleDOI

Phase-noise effects on turbo trellis-coded over M-ary coherent channels

TL;DR: Numerical analysis shows that a near-optimal coded-modulation scheme renders a transmission system more robust against phase noise than is the case with a conventional trellis-coded modulation scheme.
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.