Architecture and finite precision optimization for layered LDPC decoders
Authors:
- 1 October 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 350-355
Abstract
Layered decoding is known to provide efficient and high-throughput implementation of LDPC decoders. In the practical hardware implementation of layered decoders, the performance is strongly affected by quantization. The finite precision model determines the area of the decoder, which is mainly composed of memory, especially for long frames. To be specific, in the DVB-S2,-T2 and -C2 standards, the memory can occupy up to 70% of the total area. In this paper, we focus our attention on the optimization of the number of quantization bits. Message saturation and memory size optimization are considered for the case of a DVB-S2 decoder. We show that the memory area can be reduced by 28% compared to the state-of-the-art, without performance loss.Keywords
This publication has 11 references indexed in Scilit:
- Conflict Resolution by Matrix Reordering for DVB-T2 LDPC Decoders2009
- Conflict resolution for pipelined layered LDPC decoders2009
- A novel LDPC decoder for DVB-S2 IP2009
- A Synthesizable IP Core for WIMAX 802.16E LDPC Code Decoding2006
- Layered Decoding of Non-Layered LDPC Codes2006
- A 135Mb/s DVB-S2 compliant codec based on 64800b LDPC and BCH codes2005
- A Reduced Complexity Decoder Architecture via Layered Decoding of LDPC Codes2004
- High-throughput LDPC decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999