Polynomial-complexity noncoherent symbol-by-symbol detection with application to adaptive iterative decoding of turbo-like codes

The problem of generating symbol-by-symbol soft decision metrics (SbSSDMs) in the presence of unknown channel parameters is considered. The motivation for this work lies in its application to iterative decoding of high-performance turbo-like codes, transmitted over channels that introduce unknown pa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2003-02, Vol.51 (2), p.197-207, Article 197
Main Authors: Motedayen-Aval, I., Anastasopoulos, A.
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Channels
Codes
Complexity
Concatenated codes
Convolutional codes
Decoding
Gaussian
Gaussian noise
Hardware
Iterative algorithms
Iterative decoding
Joints
Parity check codes
Phase estimation
Polynomials
Studies
Turbo codes
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problem of generating symbol-by-symbol soft decision metrics (SbSSDMs) in the presence of unknown channel parameters is considered. The motivation for this work lies in its application to iterative decoding of high-performance turbo-like codes, transmitted over channels that introduce unknown parameters in addition to Gaussian noise. Traditional methods for the exact evaluation of SbSSDMs involve exponential complexity in the sequence length. A class of problems is identified for which the SbSSDMs can be exactly evaluated with only polynomial complexity with respect to the sequence length. Utilizing the close connection between symbol-by-symbol and sequence detection, it is also shown that for the aforementioned class of problems, detection of an uncoded data sequence in the presence of unknown parameters can be performed with polynomial complexity. The applicability of this technique is demonstrated by considering the problem of iterative detection of low-density parity-check codes in the presence of unknown and time-varying carrier-phase offset. Finally, based on the proposed exact schemes, an ultra-fast approximate algorithm for performing joint iterative decoding and phase estimation is derived that is well suited for hardware implementation.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2003.809286