Iterative table-lookup decoding for a 2-state, rate-1/2, turbo-like code

Author

Massey, P.C. ; Costello, D.J., Jr.

Author_Institution

Notre Dame Univ., IN, USA

fYear

2002

fDate

June 30 2002-July 5 2002

Firstpage

340

Abstract

This paper introduces a high-speed decoder for parallel-concatenated convolutional codes (PCCCs). The decoder utilizes a method of recursively reading from a set of lookup-tables and storing the data bytes temporarily in memory for later recursions/iterations. The sizes of the lookup-tables can be reasonably small for PCCCs consisting of 2-state constituent encoders. A class of 2-state PCCCs is given that utilizes feedforward-enhancement to achieve excellent bit error rate performance even when decoded with the recursive table-lookup decoder.

Keywords

concatenated codes; convolutional codes; error statistics; feedforward; iterative decoding; table lookup; turbo codes; 2-state turbo-like code; BER performance; bit error rate performance; data bytes storage; feedforward; high-speed decoder; iterative table-lookup decoding; lookup-tables; parallel-concatenated convolutional codes; rate-1/2 turbo-like code; recursive BCJR decoding algorithm; recursive table-lookup decoder; Approximation algorithms; Bit error rate; Chaos; Convolutional codes; Iterative decoding; NASA; Quantization; Recursive estimation; State feedback; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Conference_Location

Lausanne

Print_ISBN

0-7803-7501-7

Type

conf

DOI

10.1109/ISIT.2002.1023612

Filename

1023612