New Criteria for Iterative Decoding

Details New Criteria for Iterative Decoding New Criteria for Iterative Decoding

2010-01-12

arxiv.org/abs/1001.1917v1

ICASSP, Taipei : Taiwan (2009)

Computer Science

Information Theory

Scientific paper

10.1109/ICASSP.2009.4960128

Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate the link between iterative decoding and classical optimization techniques. We first show that iterative decoding can be rephrased as two embedded minimization processes involving the Fermi-Dirac distance. Based on this new formulation, an hybrid proximal point algorithm is first derived with the additional advantage of decreasing a desired criterion. In a second part, an hybrid minimum entropy algorithm is proposed with improved performance compared to the classical iterative decoding. Even if this paper focus on iterative decoding for BICM, the results can be applied to the large class of turbo-like decoders.

Affiliated with

Also associated with

No associations

Rating

New Criteria for Iterative Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Criteria for Iterative Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Criteria for Iterative Decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-459456