Reduced-complexity column-layered decoding and implementation for LDPC codes

Z. Cui; Z. Wang; X. Zhang

Reduced-complexity column-layered decoding and implementation for LDPC codes

Access Full Text

Reduced-complexity column-layered decoding and implementation for LDPC codes

Author(s): Z. Cui ; Z. Wang ; X. Zhang
DOI: 10.1049/iet-com.2010.1002

For access to this article, please select a purchase option:

Buy article PDF

Buy Knowledge Pack

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership

Recommend Title Publication to library

IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): Z. Cui ¹ ; Z. Wang ² ; X. Zhang ³
- Affiliations: 1: Qualcomm Inc., San Diego, USA
  2: Broadcom Corp., Irvine, USA
  3: Department of EECS, Case Western Reserve University, Cleveland, USA
Source: Volume 5, Issue 15, 14 October 2011, p. 2177 – 2186
DOI: 10.1049/iet-com.2010.1002 , Print ISSN 1751-8628, Online ISSN 1751-8636

Published

Layered decoding is well appreciated in low-density parity-check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low-complexity column-layered decoding schemes and very-large-scale integration (VLSI) architectures for multi-Gb/s applications. At first, the min-sum algorithm is incorporated into the column-layered decoding. Then algorithmic transformations and judicious approximations are explored to minimise the overall computation complexity. Compared to the original column-layered decoding, the new approach can reduce the computation complexity in check node processing for high-rate LDPC codes by up to 90% while maintaining the fast convergence speed of layered decoding. Furthermore, a relaxed pipelining scheme is presented to enable very high clock speed for VLSI implementation. Equipped with these new techniques, an efficient decoder architecture for quasi-cyclic LDPC codes is developed and implemented with 0.13 µm VLSI implementation technology. It is shown that a decoding throughput of nearly 4 Gb/s at a maximum of 10 iterations can be achieved for a (4096, 3584) LDPC code. Hence, this work has facilitated practical applications of column-layered decoding and particularly made it very attractive in high-speed, high-rate LDPC decoder implementation.

References

1. 1)
  - Sharon, E., Litsyn, S., Goldberger, J.: `An efficient message-passing schedule for LDPC decoding', Proc. 23rd IEEE Convention of Electrical and Electronics Engineers Israel, September 2004, p. 223–226.
2. 2)
  - Radosavljevic, P., Baynast, A., Cavallaro, J.R.: `Optimized message passing schedules for LDPC decoding', Proc. 39th Asilomar Conf. Signals, Systems and Computers, 2005, p. 591–595.
3. 3)
  - R. Gallager . Low-density parity-check codes. IRE Trans. Inf. Theory , 21 - 28
4. 4)
  - X.Y. Hu , E. Eleftheriou , D.M. Arnold . Regular and irregular progressive edge-growth Tanner graphs. IEEE Trans. Inf. Theory , 1 , 386 - 398
5. 5)
  - A. Darabiha , A.C. Carusone , F.R. Kschischang . Block-interlaced LDPC decoders with reduced interconnect complexity. IEEE Trans. Circuits and Systems II , 1 , 74 - 78
6. 6)
  - Lin, C., Lin, K., Chan, H., Lee, C.: `A 3.33 Gb/s (1200, 720) low-density parity check code decoder', Proc. 31st European Solid-State Circuits Conf., September 2005, p. 211–214.
7. 7)
  - Mohsenin, T., Truong, D., Baas, B.: `Multi-split-row threshold decoding implementations for LDPC codes', 2009 IEEE Int. Symp. on Circuits and Systems, 2009, p. 2449–2452.
8. 8)
  - Hocevar, D.E.: `A reduced complexity decoder architecture via layered decoding of LDPC codes', IEEE Workshop Signal Processing Systems, 2004, p. 107–112.
9. 9)
  - J. Zhang , M.P.C. Fossorier . Shuffled iterative decoding. IEEE Trans. Commun. , 2 , 209 - 213
10. 10)
  - J. Chen , A. Dholakia , E. Eleftheriou , M.P.C. Fossorier , X. Hu . Reduced-complexity decoding algorithm for low-density parity-check codes. IEEE Trans. Commun. , 8 , 1288 - 1299
11. 11)
  - Wang, Z., Cui, Z.: `A memory efficient partially parallel decoder architecture for QC-LDPC codes', Proc. 39th Asilomar Conf. Signals, Systems & Computers, 2005, p. 729–733.
12. 12)
  - Sun, Y., Cavallaro, J.R.: `A low-power 1-Gbps reconfigurable LDPC decoder design for multiple 4 G wireless standards', 2008 IEEE Int. SOC Conf., 2008, p. 367–370.
13. 13)
  - X. Shih , C. Zhan , C. Lin , A. Wu . An 8.29 mm2 52 mW multi-mode LDPC decoder design for mobile WiMAX system in 0.13 µm CMOS process. IEEE J. Solid-State Circuits , 3 , 672 - 683
14. 14)
  - Oh, D., Parhi, K.K.: `Nonuniformly quantized Min-Sum decoder architecture for low-density parity-check codes', Proc. 18th ACM Great Lakes symp. on VLSI, 2008, p. 451–456.
15. 15)
  - M.M. Mansour , N.R. Shanbhag . A 640-Mb/s 2048-bit programmable LDPC decoder chip. IEEE J. Solid-State Circuits , 3 , 684 - 698
16. 16)
  - Brack, T., Alles, M., Lehnigk-Emden, T.: `Low complexity LDPC code decoders for next generation standards', Proc. Designation Automation Test in Europe, April 2007, p. 1–6.
17. 17)
  - Studer, C., Preyss, N., Roth, C., Burg, A.: `Configurable high-throughput decoder architecture for quasi-cyclic LDPC codes', 42ndAsilomar Conf. Signals, Systems and Computers, 2008, p. 1137–1142.
18. 18)
  - Li, Z., Kumar, B.V.K.V.: `A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph', 38thAsilomar Conf. Signals, Systems and Computers, 2004, 2, p. 1990–1994.

Login

Not registered yet?

Share

Tools

Login to add to favourites

Key

Reduced-complexity column-layered decoding and implementation for LDPC codes

Reduced-complexity column-layered decoding and implementation for LDPC codes

Buy article PDF

Buy Knowledge Pack

Thank you

References

Related content