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
Proceedings ArticleDOI
Turbo trellis-coded spatial modulation
TL;DR: In this paper, a turbo trellis-coded spatial modulation (TTCSM) transmission scheme is proposed, and the punctured TTCSM scheme, using the symbol-by-symbol log-MAP iterative decoding algorithm in the receiver, is developed.
Journal ArticleDOI
Geometrically uniform hyperbolic codes
TL;DR: The concept of geometrically uniform codes, formerly employed in Euclidean spaces, are generalized to hyperbolic spaces and a characterization of generalized coset codes through the concept of G-linear codes is shown.
Journal ArticleDOI
Algorithmic construction of trellis codes
J.-E. Porath,Tor Aulin +1 more
TL;DR: An algorithmic approach is proposed whereby long convolutional codes of rate r/sub c/=k/n can easily be constructed for any chosen signal constellation in signal space.
Proceedings ArticleDOI
Helping interferer physical layer security strategies for M-QAM and M-PSK systems
TL;DR: The approach is based on formulating a secrecy capacity maximization problem by expressing the optimal arbitrary helping interferer pdf as a mixture of unknown Gaussians and reveals that in certain scenarios it is advantageous to use jamming signals whose statistical structure resembles the data rather than the noise.
Posted Content
Approaching Waterfilling Capacity of Parallel Channels by Higher Order Modulation and Probabilistic Amplitude Shaping
TL;DR: In this paper, a new distribution matching approach called product distribution matching (PDM) is proposed, which enables signaling at a target spectral efficiency with a fixed-rate forward error correction (FEC) code, while the optimal power allocation is ensured by mercurywaterfilling and a simple bitloading strategy.
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.