Generic Description and Synthesis of LDPC Decoders
Authors:
- Emmanuel BoutillonEBEmmanuel Boutillon
- Jacky TouschJTJacky Tousch
- Jean-Luc DangerJDJean-Luc Danger
- 12 November 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 55 (11) , 2084-2091
Abstract
Through a rapid survey of the architecture of low-density parity-check (LDPC) decoders, this paper proposes a general framework to describe and compare the LDPC decoder architectures. A set of parameters makes it possible to classify the scheduling of iterative decoders, memory organization, and type of check-node processors and variable-node processors. Using the proposed framework, an efficient generic architecture for nonflooding schedules is also given.Keywords
This publication has 16 references indexed in Scilit:
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- Shuffled Iterative DecodingIEEE Transactions on Communications, 2005
- A Reduced Complexity Decoder Architecture via Layered Decoding of LDPC Codes2004
- Approximate-min* constraint node updating for ldpc code decoding2004
- Turbo decoder architectures for low-density parity-check codes2004
- Evaluating alternative implementations for LDPC decoder check node function2004
- Parallel versus sequential updating for belief propagation decodingPhysica A: Statistical Mechanics and its Applications, 2003
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Decoding low-density parity-check codes with probabilistic schedulingIEEE Communications Letters, 2001
- Low-density parity check codes over GF(q)IEEE Communications Letters, 1998