Lossy compression of stakes in turbo decoder

Details Lossy compression of stakes in turbo decoder Lossy compression of stakes in turbo decoder

2005-06-21

2005-06-21

Lamarre, Guy J. (Department: 2133)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

Reexamination Certificate

active

06910171

ABSTRACT:
A turbo decoder employing the sliding window algorithm is computational intensive. Computational requirements are reduced in iterative decoders, at the expense of increased memory usage, by storing the stakes between iterations. The stakes used in this improved sliding windows algorithm can be compressed, resulting in a decoder with minimal additional memory requirements, while retaining the advantages in computational requirements obtained from storing the stakes between iterations.

REFERENCES:
patent: 5933462 (1999-08-01), Viterbi et al.
patent: 6044116 (2000-03-01), Wang
patent: 6327303 (2001-12-01), Balogh et al.
Sun Rong et al., “Nonuniform quantisation of mid-variables for decoding of turbo codes,” Mar. 8, 2000, pp. 1396-1397.
F. Raouafi et al., “Saving memory in turbo-decoders using the Max-Log-MAP algorithm,” Nov. 22, 1999, pp. 14/1-14/4.

Affiliated with

Also associated with

Rating

Lossy compression of stakes in turbo decoder does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Lossy compression of stakes in turbo decoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossy compression of stakes in turbo decoder will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3515116