Ahmed, I

Armour, SMD

Coon, JP

Ismail, MR

Koçak, T

McGeehan, JP

English

Low Density Parity Check (LDPC) codes have been adopted in a number of wired and wireless communication standards due to their improved error correcting ability and relatively simple decoder structure. However, for very high throughput systems operating in the multi-Gb/s range conventional decoding methods based on message passing are limited, due largely to the sheer volume of messages being exchanged. Thus, simpler decoding methods have been proposed such as bit flipping permitting efficient and fast hardware implementation. This paper presents two new bit flipping algorithm designed to reduce latency and power consumption. For a small loss in bit error rate performance (0.5 dB) we show how the application of an early stopping criteria uses 89% fewer iterations compared to a similar published algorithm. We also present a method for reducing power consumption by placing processing elements into a quiescent state based on a bit-local metric. Using this technique we show a potential reduction in power consumption of 76%.Low Density Parity Check (LDPC) codes have been adopted in a number of wired and wireless communication standards due to their improved error correcting ability and relatively simple decoder structure. However, for very high throughput systems operating in the multi-Gb/s range conventional decoding methods based on message passing are limited, due largely to the sheer volume of messages being exchanged. Thus, simpler decoding methods have been proposed such as bit flipping permitting efficient and fast hardware implementation. This paper presents two new bit flipping algorithm designed to reduce latency and power consumption. For a small loss in bit error rate performance (0.5 dB) we show how the application of an early stopping criteria uses 89% fewer iterations compared to a similar published algorithm. We also present a method for reducing power consumption by placing processing elements into a quiescent state based on a bit-local metric. Using this technique we show a potential reduction in power consumption of 76%

Explore Bristol Research

A Decoding Algorithm for Finite-Geometry LDPC Codes,” Communications,

A modiﬁed weighted bit-ﬂipping decoding of low-density parity-check codes,”

A reduced complexity decoder architecture via layered decoding of LDPC codes,” in

An efﬁcient early stopping scheme for

Complexityoptimized low-density parity-check codes for Gallager decoding algorithm B,” in

Early stopping for LDPC decoding: convergence of mean magnitude

Encyclopedia of sparse graph codes.”

Good Codes Based on Very Sparse Matrices,”

Gradient descent bit ﬂipping algorithms for decoding LDPC codes,” in

Improved weighted bit-ﬂipping algorithm for decoding

LDPC decoders,”

Low complexity stopping criterion for LDPC code decoders,”

Low density parity check codes based on ﬁnite geometries: a rediscovery,” in

Low-Density Parity-Check Codes,

On the design of low-density parity-check codes within 0.0045 db of the Shannon limit,”

Study of Early Stopping Criteria for Turbo Decoding and Their Applications in

Two bit-ﬂipping decoding algorithms for low-density parity-check codes,”

Low latency low power bit flipping algorithms for LDPC decoding

https://research-information.bris.ac.uk/files/3020121/Ismail_IEEE_PIMRC_2010.pdf

Low latency low power bit flipping algorithms for LDPC decoding

Abstract

Similar works

Full text

Available Versions

Explore Bristol Research