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
Space-Time Multiple-Mode Orthogonal Frequency Division Multiplexing With Index Modulation
TL;DR: Monte Carlo simulations on BER corroborate the analyses and show that the proposed schemes appear as promising multi-carrier transmission alternatives by outperforming the existing OFDM-IM counterparts.
Journal ArticleDOI
Lattice and trellis quantization with lattice- and trellis-bounded codebooks-High-rate theory for memoryless sources
M.V. Eyuboglu,G.D. Forney +1 more
TL;DR: It is shown for Gaussian sources that the ultimate achievable boundary gain with high-rate lattice-bounded lattice codebooks is the same as the ultimate gain that can be obtained from variable-rate entropy coding.
Journal ArticleDOI
The intersymbol interference channel: lower bounds on capacity and channel precoding loss
Shlomo Shamai,R. Laroia +1 more
TL;DR: Several new and old lower bounds on the capacity are derived in a unified manner by assuming different front-end receiver filters, in particular the sampled whitened matched filter (SWMF) and the minimum mean-squared error-decision feedback equalizer (MMSE-DFE) filter.
Journal ArticleDOI
On Two-User Gaussian Multiple Access Channels With Finite Input Constellations
J. Harshan,Balaji Sundar Rajan +1 more
TL;DR: For finite constellations, a No-MA scheme such as TCMA is better than FDMA and TDMA which makes NO-MA schemes worth pursuing in practice for two-user GMAC.
Journal ArticleDOI
An algorithm for computing the distance spectrum of trellis codes
M. Rouanne,Daniel J. Costello +1 more
TL;DR: An algorithm to compute the distance spectrum of linear, regular, and quasiregular trellis codes is presented, derived from a bidirectional stack algorithm, although it could also be based on the Viterbi algorithm.
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.