Scribd
Upload
78 views1 page

Type Inst: Max-log-MAP Decoding With Reduced Memory Complexity

The document presents a technique to reduce the memory complexity of Max-Log-MAP decoding from O(nm) to O(m) for convolutional codes. It does this by continuously recomputing the forward alpha coefficients in the BCJR algorithm instead of storing them. The authors apply this technique to a rate-1/2 1025-bit Turbo Code and demonstrate significant memory savings.

Uploaded by

Shiyamala Jeyakumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
78 views1 page

Type Inst: Max-log-MAP Decoding With Reduced Memory Complexity

The document presents a technique to reduce the memory complexity of Max-Log-MAP decoding from O(nm) to O(m) for convolutional codes. It does this by continuously recomputing the forward alpha coefficients in the BCJR algorithm instead of storing them. The authors apply this technique to a rate-1/2 1025-bit Turbo Code and demonstrate significant memory savings.

Uploaded by

Shiyamala Jeyakumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?

arnumber=7313790&abstractAccess=no&user
Type=inst

Dejan Spasov ; Fac. of Inf. Sci. & Comput. Eng., Ss Cyril & Methodius Univ., Skopje, Macedonia ; Marjan
Gushev ; Sashko Ristov

Max-log-MAP decoding with reduced memory complexity

Given an M-state (recursive) convolutional encoder and information sequence of length n, the space
complexity of unoptimized Bahl-Cocke-Jelinek-Raviv (BCJR) decoder is considered to be O(nm).
However, if BCJR's forward alpha coefficients are continuously recomputed instead of stored in memory,
it can be shown that the space complexity will drop to O(m). In this paper we start from these
observations and present a technique for memory reduction in the Max-Log-MAP algorithm. We test
our design on a rate-1/2 1025-bit-long Turbo Code and show considerable memory saving.

You might also like