By Topic

A new memory-reduced architecture design for log-MAP algorithm in turbo decoding

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Tsung-Han Tsai ; Dept. of Electr. Eng., Nat. Central Univ., Chung-li, Taiwan ; Lin, Cheng-Hung

In coding theory, turbo codes have been the breakthrough in recent years. Among these, the MAP (maximum a posteriori) algorithm is a powerful SISO (soft-input soft-output) algorithm for turbo decoding. However, MAP decoders of the turbo decoding consume large memories in hardware implementation. This work presents a new architecture for memory reduction in log-MAP (logarithm-MAP) algorithm. Based on the scheduling analysis, the backward recursion can be reversed in order to be directly operated on with forward recursion. The comparison result shows it can effectively reduce the memory size up to half size of the previous works. In addition, we also simplify the memory data access without extra address generators.

Published in:

Emerging Technologies: Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on  (Volume:2 )

Date of Conference:

31 May-2 June 2004