By Topic

Polynomial-complexity, adaptive symbol-by-symbol soft-decision algorithms with application to non-coherent detection of LDPCC

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
I. Motedayen ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; A. Anastasopoulos

Iterative decoding in the presence of unknown channel parameters requires the generation of symbol-by-symbol soft-decision metrics (SbSSDMs), jointly with parameter estimation. Traditional methods for the exact evaluation of these metrics have exponential complexity with the length of the data sequence. In this paper, a class of problems is identified, for which the exact SbSSDMs can be obtained with only polynomial complexity with the data sequence length. 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.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:3 )

Date of Conference: