Design of a low-area, high-throughput LDPC decoder using shared memory banks for DVB-S2
Authors:
- 7 August 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 55 (2) , 850-854
Abstract
This paper presents a high throughput LDPC decoder architecture for DVB-S2, a second generation standard for European satellite digital video broadcasting system. DVB-S2 standard specifies higher order modulation and powerful FEC system based on LDPC codes concatenated with BCH code. DVB-S2 has been gradually replacing DVB-S for global satellite digital TVs, and many HDTV channels are served by DVB-S2 standard in Europe and Japan. The proposed decoder architecture clusters bitnodes and checknodes into groups by utilizing of periodic nature of parity check matrix. Each of these node groups are assigned to a functional modules which perform calculations required at bitnodes and checknodes. These functional modules exchange data through shared memory banks to maximize parallel accesses. Implementation of the proposed architecture exhibits the throughput of 277 Mbps, 9% improvements over previous architecture, while the area is reduced by as much as 52%.Keywords
This publication has 11 references indexed in Scilit:
- DVB-S2: The Second Generation Standard for Satellite Broad-Band ServicesProceedings of the IEEE, 2006
- Low cost LDPC decoder for DVB-S22006
- A Synthesizable IP Core for DVB-S2 LDPC Code Decoding2005
- Joint$(3, k)$-Regular LDPC Code and Decoder/Encoder DesignIEEE Transactions on Signal Processing, 2004
- A 54 Mbps (3,6)-regular FPGA LDPC decoder2003
- Iterative decoder architecturesIEEE Communications Magazine, 2003
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981