Title :
Design of the BCJR decoding algorithm with reduced space complexity
Author_Institution :
Fac. of Comput. Sci. & Eng., "SS. Cyril and Methodious" Univ., Skopje, Macedonia
Abstract :
Given an M-state (recursive) convolutional encoder, we show that, in theory, computing the forward alpha probabilities of the BCJR decoding algorithm can be done with 2M memory elements. Building on this idea we propose new design with reduced space complexity for the original BCJR algorithm. Initial experiments with rate-1/2 1025-bit-long Turbo Codes show possibility for compressing the size of memory for the alpha probabilities for about 97%.
Keywords :
computational complexity; convolutional codes; decoding; probability; turbo codes; BCJR decoding algorithm; Bahl-Cocke-Jelinek-Raviv decoding algorithm; M-state convolutional encoder; Turbo code; forward alpha probability; space complexity reduction; Algorithm design and analysis; Complexity theory; Convolutional codes; Decoding; Iterative decoding; Memory management; Turbo codes;
Conference_Titel :
Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2015 38th International Convention on
Conference_Location :
Opatija
DOI :
10.1109/MIPRO.2015.7160340
