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
Proceedings ArticleDOI

Hybrid ARQ scheme suitable for coded MIMO transmission

TL;DR: An automatic-repeat-request (ARQ) scheme for improving the system throughput efficiency is investigated in coded multiple-input multiple-output (MIMO) transmissions and achieves high throughput even in severe conditions of low signal-to-noise ratio and high Rician factor over spatially and temporally correlated Nakagami-Rice fading MIMO channels.
Patent

Low complexity maximum likelihood detection of concatenated space codes for wireless applications

TL;DR: In this article, a trellis coder followed by a block coder and a Viterbi decoder were employed to achieve good transmission characteristics in the presence of fading.
Proceedings ArticleDOI

Capacity of power constrained memoryless AWGN channels with fixed input constellations

TL;DR: A numerical method to compute the capacity of a power constrained memoryless additive white Gaussian noise (AWGN) channel with finite and fixed input alphabets is proposed, based on a modified version of the Blahut-Arimoto algorithm.
Proceedings ArticleDOI

Improved high-rate space-time codes via concatenation of expanded orthogonal block code and M-TCM

TL;DR: A new technique for designing an improved high-rate space-time code is proposed by expanding the cardinality of the available orthogonal space- time signal points before concatenating with an outer TCM/MTCM encoder.
Book

Multi-Carrier Technologies for Wireless Communication

TL;DR: In this article, the authors explain how a common multi-carrier platform is being designed for DS-CDMA, TDMA, OFDM and MCCDMA systems, and show how this multichannel platform enhances network capacity and probability of error performance.
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.