Journal ArticleDOI
Channel coding with multilevel/phase signals
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
Baseband trellis codes with a spectral null at zero
TL;DR: A method is described for modifying classical N-dimensional trellis codes to provide baseband codes that combine a spectral null at DC with significant coding gain.
Journal ArticleDOI
Bandwidth efficient concatenated coding schemes for fading channels
TL;DR: Concatenated codes consisting of trellis inner codes and Reed-Solomon outer codes are considered to achieve large coding gains with small bandwidth expansion in the presence of frequency-nonselective slow Rician fading.
Journal ArticleDOI
Multidimensional modulation and coding for band-limited digital channels
Ezio Biglieri,Michele Elia +1 more
TL;DR: In this paper, a class of multidimensional signals based on generalized group alphabets is introduced and its basic properties are derived, and two coding schemes are considered: G. Ungerboeck's scheme (1982) for combination with convolutional codes, and V.V. Ginzburg's (1984) scheme for combination of block codes.
Proceedings ArticleDOI
Bit-interleaved coded modulation with shaping
TL;DR: The performance of bit-interleaved coded modulation with shaping (i.e., non-equiprobable bit probabilities) is studied and for the AWGN channel, the rates achievable with BICM and shaping are practically identical to those of coded modulation or multilevel coding.
Journal ArticleDOI
Near-capacity turbo trellis coded modulation design based on EXIT charts and union bounds - [transactions papers]
TL;DR: The best TTCM component codes were selected with the aid of both the symbolbased union bound and non-binary EXIT charts, for designing capacity-approaching IQ-TTCM schemes in the context of 8 PSK, 16 QAM, 32 QAM and 64 QAM modulation schemes.
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
I. M. Jacobs,J. M. Wozencraft +1 more
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
W. Osborne,M. Luntz +1 more
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.