Abstract
We describe simple iterative decoders for low-density parity-check codes based on Euclidean geometries,
suitable for practical very-large-scale-integration implementation in applications requiring very fast decoders. The
decoders are based on shuffled and replica-shuffled versions of iterative bit-flipping (BF) and quantized weighted
BF schemes. The proposed decoders converge faster and provide better ultimate performance than standard BF decoders.
We present simulations that illustrate the performance versus complexity tradeoffs for these decoders. We can show
in some cases through importance sampling that no significant error floor exists.
© 2007 IEEE
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription