VLSI Design of a High-Throughput Multi-Rate Decoder for Structured LDPC Codes
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Despite recent advances in the microelectronics technology, the implementation of high-throughput decoders for LDPC codes remains a challenging task. This paper aims at summarising the top-down design flow of a decoder for a structured LDPC code compliant with the WWiSE proposal for WLAN. Starting from the system performance analysis with finite-precision arithmetic, a high-throughput architecture is presented as an enhancement of the state-of-the-art solutions, and its VLSI design detailed. The envisaged architecture is also very flexible as it supports several code rates with no significant hardware overhead. The overall decoder, synthesised on 0.18 μm standard cells CMOS technology, showed remarkable performances: small implementation loss (0.2 dB down to BER = 10 -8), low latency (less than 6.0 μs), high useful throughput (up to 940Mbps) and low complexity (about 375 Kgates)Keywords
This publication has 13 references indexed in Scilit:
- On implementation of min-sum algorithm for decoding low-density parity-check (LDPC) codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Decoder architecture for array-code-based LDPC codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- High-throughput LDPC decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- Efficient implementations of the sum-product algorithm for decoding LDPC codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Good codes based on very sparse matricesLecture Notes in Computer Science, 1995
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948