The Design and Analysis of Successive Decoding for Channels With Memory
The first part of this work shows that successive decoding under a deep rectangular interleaver essentially decomposes the original channel into a set of asymptotic memoryless subchannels with semi-infinite preceding training symbols. The achievable information rate of the original channel under a given input distribution can be efficiently computed from this set. Furthermore, the conventional coding system that separates estimation from decoding can operate on these memoryless channels without loss of mutual information. These results allow us to characterize accurately the binary-input capacity of correlated fading channels and to operate within 1.1 dB to the binary-input capacity using AWGN channel optimized LDPC codes.
The second part of this work deals with the design of more practical successive decoding with a small number of levels. The main idea is to incorporate an irregular interleaving pattern and when necessary iterative estimation decoding within each level. These techniques provide a more flexible configuration of successive decoding for balancing the performance and the delay. The analysis of the achievable rate and the extrinsic information transfer (EXIT) charts are proposed for code rate allocation and for the efficient optimization of interleavers. Both the optimal random interleaver and a good construction of the deterministic interleaver are numerically shown to have performance very close to its binary-input capacity with a small number of levels.
History
Date Modified
2017-06-05Defense Date
2007-03-26Research Director(s)
Oliver M. CollinsCommittee Members
Thomas Fuja Oliver M. Collins Daniel J. Costello Nicholas LanemanDegree
- Doctor of Philosophy
Degree Level
- Doctoral Dissertation
Language
- English
Alternate Identifier
etd-04202007-043049Publisher
University of Notre DameAdditional Groups
- Electrical Engineering
Program Name
- Electrical Engineering