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

Lattice Index Coding

TL;DR: A design metric called side information gain is introduced that measures the advantage of a code in utilizing the side information at the receivers, and hence, its goodness as an index code, and construct lattice index codes with large side information gains using lattices over the following principal ideal domains.
Proceedings ArticleDOI

Multishot Codes for Network Coding: Bounds and a Multilevel Construction

TL;DR: This paper explores the idea of using the subspace channel more than once and investigates the so called multishot subspace codes, and presents definitions for the problem, a motivating example, lower and upper bounds for the size of Codes, and a multilevel construction of codes based on block-coded modulation.
Proceedings ArticleDOI

Area-efficient architectures for the Viterbi algorithm

TL;DR: An architecture model for area-efficient implementation of the Viterbi algorithm and favorable results are presented for trellises of de Bruijn graphs and matched-spectral-null (MSN) trellis codes.
Journal ArticleDOI

Coding for the fading channel: a survey

TL;DR: By using the “block-fading” channel model, this work considers the design of coding schemes for a channel affected by flat, slow fading and additive noise, and allows delay constraints to be taken into account.
Journal ArticleDOI

Analysis and construction of full-diversity joint network-LDPC codes for cooperative communications

TL;DR: Simulation of the word error rate performance of the new proposed family of LDPC codes for the MARC confirms the full diversity, and the principles to design a family of full-diversityLDPC codes with maximum rate are presented.
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.