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

I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate

TL;DR: Some trellis codes that provide high coding gain to channels with slow, non frequency-selective Rayleigh fading are presented and it is concluded that an interleaver span of 4/spl nu/ yields performance close to what is achieved with ideal interleaving.
Patent

Multidimensional, convolutionally coded communication systems

TL;DR: In this paper, a family of multi-dimensional convolutionally coded modulation systems achieves enlarged minimum distance between possible sequences of signal points, reduced number of error events with the minimum distance, acceptable peak-to-average power ratio, and immunity to rapid carrier phase changes.
Patent

Near-optimal low-complexity decoding of space-time codes for fixed wireless applications

Titus Lo, +1 more
TL;DR: In this paper, an improved multi-antenna receiver is realized for detecting signals transmitted by a multiantenna transmitter by summing signals received at the plurality of receiver antennas after multiplying each by a respective constant.
Journal ArticleDOI

Multidimensional mapping for bit-interleaved coded modulation with BPSK/QPSK signaling

TL;DR: This paper introduces multidimensional mapping for BICM-ID, where a group of bits is mapped to a vector of symbols, rather than a single symbol, which allows for more flexibility and potential performance improvements.
Journal ArticleDOI

Superposition coded modulation and iterative linear MMSE detection

TL;DR: It is proved that among all possible signaling methods, SCM maximizes the output signal-to-noise/ interference ratio (SNIR) in the LMMSE estimates during iterative detection.
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.