Article thumbnail
Location of Repository

Combinatorial interleavers for systematic regular repeat-accumulate codes

By Sarah J. Johnson and Steven R. Weller


This paper proposes novel interleaver and accumulator structures for systematic, regular repeat-accumulate (RA) codes. It is well known that such codes are amenable to iterative (sum-product) decoding on the Tanner graph of the code, yet are as readily encodable as turbo codes. In this paper, interleavers for RA codes are designed using combinatorial techniques as a basis for deterministic interleaver constructions, yielding RA codes whose Tanner graphs are free of 4-cycles. Further, a generalized RA code accumulator structure is proposed, leading to codes, termed w3RA codes, whose parity-check matrices have many fewer weight-2 columns than conventional RA codes. The w3RA codes retain the low-complexity encoding of conventional RA codes and exhibit improved error-floor performance

Topics: repeat-accumulate (RA) codes, iterative decoding, sum-product algorithm, interleaver design, low-density parity-check (LDPC) codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Year: 2008
DOI identifier: 10.1109/TCOMM.2008.041247
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.