Reduced-Complexity Algorithms for Decoding and Equalization
This work presents novel approaches to decoding and equalization based on tree search. For decoding of convolutional codes, two novel supercode heuristics are proposed to guide the search procedure, reducing the average number of visited incorrect nodes. For soft-output decoding and equalization, a new approach to the generation of soft output within the M-algorithm-based search is presented. Both techniques, when applied simultaneously, yield a particularly efficient soft output decoder for large-memory convolutional codes. Finally, a short block code is presented, which repeated and concatenated with strong outer convolutional code yields an iteratively-decodable coding scheme with excellent convergence and minimum distance properties. With the help of the proposed soft output decoder for the outer convolutional code, this concatenation has also low decoding complexity.
History
Date Modified
2017-06-05Defense Date
2008-04-07Research Director(s)
Daniel J. Costello, Jr.Degree
- Doctor of Philosophy
Degree Level
- Doctoral Dissertation
Language
- English
Alternate Identifier
etd-05202008-063919Publisher
University of Notre DameProgram Name
- Electrical Engineering