Product accumulate codes: properties and performance

Author

Narayanan, Krishna R. ; Li, J. ; Georghiades, Costas N.

Author_Institution

Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

21

Lastpage

23

Abstract

A new class of codes, named product accumulate codes, which are the concatenation of an outer product code and an inner rate-1 differential encoder (or accumulator) is proposed. We show that these codes can perform within a few tenths of a dB from the Shannon limit for rates⩾1/2. For practical block lengths, these codes provide similar performance to turbo codes but with significantly lower decoding complexity

Keywords

computational complexity; concatenated codes; convolutional codes; error correction codes; interleaved codes; iterative decoding; maximum likelihood decoding; Shannon limit; accumulator; concatenation; convolutional code; decoding complexity; error-correcting codes; inner rate-1 differential encoder; interleaver; iterative decoding; maximum likelihood decoding; message-passing decoding; outer product code; product accumulate codes; Concatenated codes; Electronic mail; Error analysis; H infinity control; Interleaved codes; Iterative decoding; Maximum likelihood decoding; Parity check codes; Product codes; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 2001. Proceedings. 2001 IEEE

Conference_Location

Cairns, Qld.

Print_ISBN

0-7803-7119-4

Type

conf

DOI

10.1109/ITW.2001.955123

Filename

955123