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

A Turbo Detection and Sphere-Packing-Modulation-Aided Space-Time Coding Scheme

TL;DR: It is demonstrated that the performance of STBC-SP systems can be further improved by concatenating SP-aided modulation with channel coding and performing demapping as well as channel decoding iteratively.
Journal ArticleDOI

Bounds for codes over the unit circle

TL;DR: The Elias type bound is compared with the Kabatyanskii-Levenshtein (K-L) bound that holds for less restrictive alphabets and the upper bound improves the K-L bound for \delta \leq 0.93 .
Proceedings ArticleDOI

Pulse position amplitude modulation for time-hopping multiple access UWB communications

TL;DR: It is shown that for M=2.2, 2N-ary PPAM signals have better performance than 2n-ary PPM with the same throughput and half the computational complexity.
Journal ArticleDOI

Real-Time Application of Trellis Coding to High-Speed Voiceband Data Transmission

TL;DR: It is shown that the experimental results agree well with those from theory, and that trellis coding provides significant improvement in performance in the presence of impairments other than additive Gaussian noise.
Journal ArticleDOI

Error probability for reduced-state sequence estimation

TL;DR: A union upper bound on the error probability for ideal RSSE is used to approximate the true error probability, and this union bound provides a better approximation than the minimum distance.
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.