Bibliographic Details
| Title: |
Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes. |
| Authors: |
Johnson, Sarah J.1 sarah.johnson@newcastle.edu.au, Weller, Steven R.1 steven.weller@newcastle.edu.au |
| Source: |
IEEE Transactions on Communications. Aug2008, Vol. 56 Issue 8, p1201-1206. 6p. 3 Graphs. |
| Subjects: |
Turbo languages (Computer program language), Matrices (Mathematics), Algebra, Quantitative research, Charts, diagrams, etc., Graphic methods |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
