Multilevel coding for nonlinear ISI channels

Authors:
Mei Chen;Oliver M. Collins
Affiliations:
Qualcomm, Inc., Santa Clara, CA and Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 7
Cited 0

Elements of information theory

Elements of information theory
Multilevel codes: theoretical concepts and practical design rules

IEEE Transactions on Information Theory
Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
A Successive Decoding Strategy for Channels With Memory

IEEE Transactions on Information Theory
Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding

IEEE Transactions on Information Theory
A Computationally Efficient Multilevel Coding Scheme for ISI Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper proposes a new nonlinear equalization approach for the transmission of high-density constellations over nonlinear ISI channels. Multilevel coding is performed at the transmitter, and multistage equalization and decoding at the receiver. Two equalizers are introduced. One uses nonlinear intersymbol interference (ISI) cancellation and has linear complexity in the channel memory L, and the number of decoding stages K. The other employs the reduced-state Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm, which shows better performance and complexity on the order of K ċ 2L. Capacity analysis and code simulation results show that these two schemes can achieve significant improvement over the conventional approaches that view nonlinear ISI as additive noise.