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

Joint message passing decoding for LDPC codes with CCDMs

Yanan Luo and Qin Huang
Opt. Lett. 48(19) 4933-4936 (2023)

Fast phase error correction with reference beam-assisted LDPC coding for collinear holographic data storage

Qin Yu, Fei Wu, Meng Zhang, and Changsheng Xie
Opt. Express 31(12) 20345-20363 (2023)

Low-complexity LDPC decoding algorithms for ultra-high-order modulated signals

Hongjun Zhu, Meiyu Fu, Chen Hou, and Guijun Hu
Opt. Express 31(25) 41645-41657 (2023)

45 Gb/s low complexity optical front-end for soft-decision LDPC decoders

Meer Nazmus Sakib, Monireh Moayedi, Warren J. Gross, and Odile Liboiron-Ladouceur
Opt. Express 20(16) 18336-18347 (2012)

Optimized LNS-FAID of LDPC codes: a hybrid precision decoding approach for 50G-PON

Yanchen Lyu, Ming Jiang, Mingyang Zhu, Xinyu Zhong, and Chunming Zhao
Opt. Lett. 49(7) 1700-1703 (2024)