Constructions for irregular repeat-accumulate codes

Author

Johnson, Sarah J. ; Weller, Steven R.

Author_Institution

Sch. of Electr. Eng. & Comput. Sci., Newcastle Univ., NSW

fYear

2005

fDate

4-9 Sept. 2005

Firstpage

179

Lastpage

183

Abstract

Recent promising theoretical results for irregular repeat-accumulate (IRA) codes, together with their extremely simple encoding, motivates this investigation into the design and implementation of finite-length IRA codes. In this paper interleavers for RA codes are designed using combinatorial techniques to produce RA codes with Tanner graphs suitable for sum-product decoding. Further, a modified RA code accumulator is used to construct new IRA codes with columns of weight 3 in the accumulator. These new codes, called w3IRA codes, can be designed with flexible degree distributions and retain the simple encoding of traditional IRA codes

Keywords

convolutional codes; decoding; interleaved codes; parity check codes; product codes; turbo codes; encoding; finite-length IRA codes; interleaved codes; irregular repeat-accumulate codes; sum-product decoding; Australia; Code standards; Computer science; Concatenated codes; Convolutional codes; Error correction codes; Iterative algorithms; Iterative decoding; Parity check codes; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on

Conference_Location

Adelaide, SA

Print_ISBN

0-7803-9151-9

Type

conf

DOI

10.1109/ISIT.2005.1523318

Filename

1523318