Share Email Print

Proceedings Paper

Reduced wire-length and routing complexity for LDPC decoders
Author(s): Gabofetswe A. Malema; Michael J. Liebelt; Cheng Chew Lim
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Random low-density parity-check (LDPC) codes have been shown to have better performance compared to structured codes because of their better minimum distance and girth. However, random codes result in decoders with large VLSI area and complex routing. The routing complexity is the main limitation for implementing practical fully parallel LDPC decoders. We use reordering sparse-matrix algorithms to reduce the average wire-length and congestion in fully parallel VLSI implementations. Rows and columns of the code matrix are rearranged such that each row/column connection is as close as possible. The restructuring achieves a 15% reduction in average wire-length and 30% in reducing the number of wires across an area. The shape of restructured code is predictable making it possible to develop better routing algorithms for such codes. The shape of the code also simplifies routing in that consecutive rows have almost the same range. Restructuring of the matrix does not change the code matrix and hence does not affect its performance.

Paper Details

Date Published: 5 January 2006
PDF: 8 pages
Proc. SPIE 6035, Microelectronics: Design, Technology, and Packaging II, 60350H (5 January 2006); doi: 10.1117/12.639009
Show Author Affiliations
Gabofetswe A. Malema, The Univ. of Adelaide (Australia)
Michael J. Liebelt, The Univ. of Adelaide (Australia)
Cheng Chew Lim, The Univ. of Adelaide (Australia)

Published in SPIE Proceedings Vol. 6035:
Microelectronics: Design, Technology, and Packaging II
Alex J. Hariz, Editor(s)

© SPIE. Terms of Use
Back to Top