Iterative decoding

Pulse or digital communications – Receivers – Particular pulse demodulator or detector

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07903766

ABSTRACT:
This invention provides an iterative process to maximum a posteriori (MAP) decoding. The iterative process uses an auxiliary function which is defined in terms of a complete data probability distribution. The auxiliary function is derived based on an expectation maximization (EM) algorithm. For a special case of trellis coded modulators, the auxiliary function may be iteratively evaluated by a combination of forward-backward and Viterbi algorithms. The iterative process converges monotonically and thus improves the performance of any decoding algorithm. The MAP decoding minimizes a probability of error. A direct approach to achieve this minimization results in complexity which grows exponentially with T, where T is the size of the input. The iterative process avoids this complexity by converging on the MAP solution through repeated maximization of the auxiliary function.

REFERENCES:
patent: 5721746 (1998-02-01), Hladik et al.
patent: 6161209 (2000-12-01), Moher
patent: 6182261 (2001-01-01), Haller
patent: 6327317 (2001-12-01), Chennakeshu
patent: 6377610 (2002-04-01), Hagenauer
patent: 6400290 (2002-06-01), Langhammer et al.
patent: 6480552 (2002-11-01), Tonello
patent: 6563877 (2003-05-01), Abbaszadeh

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Iterative decoding does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-2725362

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.