Design methodology for IRA codes

ABSTRACT

Channel coding is an important building block in communication systems since it ensures the quality of service. Irregular repeat-accumulate (IRA) codes belong to the class of Low-Density Parity-Ceck (LDPC) codes and even outperform the recently introduced Turbo-Codes of current communication standards. IRA codes can be represented by a Tanner graph with arbitrary connections between nodes of given degrees. The implementation complexity of an IRA decoders is dominated by the randomness of these connections.In this paper we present for the first time an IRA decoder architecture which can process any given IRA code. We developed a joint graph-decoder design methodology to construct the Tanner graph of a given IRA code which can be efficiently processed by this decoder architecture without any RAM access conflicts. We show that these constructed IRA codes can outperform the UMTS Turbo-Codes.

REFERENCES

• 1: R. G. Gallager. Low-Density Parity-Check Codes. M.I.T. Press, Cambridge, Massachusetts, 1963.
• 2: H. Jin, A. Khandekar, and R. McEliece. Irregular Repeat-Accumulate Codes. In Proc. 2nd International Symposium on Turbo Codes & Related Topics, pages 1--8, Brest, France, Sept. 2000.
• 3: F. Kienle, M. J. Thul, and N. Wehn. Implementation Issues of Scalable LDPC Decoders. In Proc. 3rd International Symposium on Turbo Codes & Related Topics, pages 291--294, Brest, France, Sept. 2003.
• 4: M. Luby , M. Mitzenmacher , A. Shokrollah , D. Spielman, Analysis of low density codes and improved designs using irregular graphs, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.249-258, May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276756]
• 5: D. MacKay and R. Neal. Near Shannon limit performance of Low-Density Parity-Check Codes. Electronic Letters, 32:1645--1646, 1996.
• 6: Y. Mao and A. Banihashemi. A Heuristic Search for Good Low-Density Parity-Check Codes at Short Block Lengths. In Proc. 2001 International Conference on Communications (ICC '01), pages 11--14, June 2001.
• 7: T. Richardson and R. Urbanke. Efficient Encoding of Low-Density Parity-Check Codes. IEEE Transaction on Information Theory, 47(2):638--656, Feb. 2001.
• 8: T. Richardson and R. Urbanke. The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding. IEEE Transaction on Information Theory, 47(2):599--618, Feb. 2001.