Gear-shift decoding
- 17 July 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 54 (7) , 1235-1242
Abstract
This paper considers a class of iterative message-passing decoders for low-density parity-check codes in which the decoder can choose its decoding rule from a set of decoding algorithms at each iteration. Each available decoding algorithm may have a different per-iteration computation time and performance. With an appropriate choice of algorithm at each iteration, overall decoding latency can be reduced significantly, compared with standard decoding methods. Such a decoder is called a gear-shift decoder because it changes its decoding rule (shifts gears) in order to guarantee both convergence and maximum decoding speed (minimum decoding latency). Using extrinsic information transfer charts, the problem of finding the optimum (minimum decoding latency) gear-shift decoder is formulated as a computationally tractable dynamic program. The optimum gear-shift decoder is proved to have a decoding threshold equal to or better than the best decoding threshold among those of the available algorithms. In addition to speeding up software decoder implementations, gear-shift decoding can be applied to optimize a pipelined hardware decoder, minimizing hardware cost for a given decoder throughputKeywords
This publication has 16 references indexed in Scilit:
- A More Accurate One-Dimensional Analysis and Design of Irregular LDPC CodesIEEE Transactions on Communications, 2004
- High-throughput LDPC decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Convergence behavior of iteratively decoded parallel concatenated codesIEEE Transactions on Communications, 2001
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limitIEEE Communications Letters, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Analyzing the turbo decoder using the Gaussian approximationIEEE Transactions on Information Theory, 2001
- Capacity-Achieving Sequences2001
- Rate one-half code for approaching the Shannonlimitby 0.1 dBElectronics Letters, 2000