HIGH THROUGHPUT MEMORY-EFFICIENT VLSI DESIGNS FOR STRUCTURED LDPC DECODING

Hrishikesh Sharma, Subhasis Das, Rewati Raman Raut, Sachin Patkar

Abstract

Low-density Parity Check(LDPC) codes have been in focus of intense research in Error-correction Coding in recent years. High throughput decoder design for them has been a big challenge for these codes. In this paper, we report the first scalable VLSI decoder design based on projective geometry (PG) structure of LDPC codes. The design is based on memory-efficient communication primitives known as perfect access sequences. A high-throughput variation of above design achieves a throughput of 620 Mbps, much higher than what communication standards require. The corresponding fully-parallel VLSI architecture was implemented on Xilinx LX110T FPGA, as well as on 90-nm SAED EDK90 CORE Cell Library from Synposys. We find that PG-based graphs indeed offer an exciting way of parallelizing this computation, and many others in future.

References

  1. Adiga, B., Chowdhary, S., Sharma, H., and Patkar, S. (2010). System for Error Control Coding using Expander-like codes constructed from higher dimensional Projective Spaces, and their Applications. Indian Patent Requested. 2455/MUM/2010.
  2. Das, S. (2010). A Min-Sum based 1.4 Gbps LDPC Decoder Design. Technical report, Indian Institute of Technology.
  3. Johnson, S. J. and Weller, S. R. (2003). Low-density paritycheck codes: Design and decoding.
  4. Karmarkar, N. (1991). A New parallel architecture for sparse matrix computation based on finite projective geometries. Proc. Supercomputing.
  5. Kou, Y., Lin, S., and Fossorier, M. (2001). Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Transactions on Information Theory, 47(7):2711-2736.
  6. Mohsenin, T., Truong, D., and Baas, B. (2009). Multi-SplitRow Threshold decoding implementations for LDPC codes. IEEE International Symposium on Circuits and Systems, pages 2449-2452.
  7. Sharma, H. (2007). A Decoder for Regular LDPC codes with folded Architecture. Indian Patent Requested. 205/MUM/2007.
  8. Tarable, A., Benedetto, S., and Montorsi, G. (2004). Mapping interleaving laws to parallel Turbo and LDPC decoder architectures. IEEE Transactions on Information Theory, 50(9):2002-2009.
  9. Zarubica, R., Wilson, S., and Hall, E. (2007). Multi-Gbps FPGA-Based Low Density Parity Check (LDPC) Decoder Design. IEEE Global Telecommunications Conference, pages 548-552.
Download


Paper Citation


in Harvard Style

Sharma H., Das S., Raman Raut R. and Patkar S. (2011). HIGH THROUGHPUT MEMORY-EFFICIENT VLSI DESIGNS FOR STRUCTURED LDPC DECODING . In Proceedings of the 1st International Conference on Pervasive and Embedded Computing and Communication Systems - Volume 1: PECCS, ISBN 978-989-8425-48-5, pages 518-521. DOI: 10.5220/0003366305180521


in Bibtex Style

@conference{peccs11,
author={Hrishikesh Sharma and Subhasis Das and Rewati Raman Raut and Sachin Patkar},
title={HIGH THROUGHPUT MEMORY-EFFICIENT VLSI DESIGNS FOR STRUCTURED LDPC DECODING},
booktitle={Proceedings of the 1st International Conference on Pervasive and Embedded Computing and Communication Systems - Volume 1: PECCS,},
year={2011},
pages={518-521},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003366305180521},
isbn={978-989-8425-48-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Pervasive and Embedded Computing and Communication Systems - Volume 1: PECCS,
TI - HIGH THROUGHPUT MEMORY-EFFICIENT VLSI DESIGNS FOR STRUCTURED LDPC DECODING
SN - 978-989-8425-48-5
AU - Sharma H.
AU - Das S.
AU - Raman Raut R.
AU - Patkar S.
PY - 2011
SP - 518
EP - 521
DO - 10.5220/0003366305180521