Lossy compression of stakes in turbo decoder

摘要

A turbo decoder employing the sliding window algorithm is computational intensive. Recent developments have reduced the computational requirements 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.