We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yang CAO, Xiuming SHAN, Yong REN, "An Efficient Decoding Algorithm for Low-Density Parity-Check Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 5, pp. 1384-1387, May 2005, doi: 10.1093/ietfec/e88-a.5.1384.
Abstract: We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1384/_p
Copy
@ARTICLE{e88-a_5_1384,
author={Yang CAO, Xiuming SHAN, Yong REN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Decoding Algorithm for Low-Density Parity-Check Codes},
year={2005},
volume={E88-A},
number={5},
pages={1384-1387},
abstract={We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.},
keywords={},
doi={10.1093/ietfec/e88-a.5.1384},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - An Efficient Decoding Algorithm for Low-Density Parity-Check Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1384
EP - 1387
AU - Yang CAO
AU - Xiuming SHAN
AU - Yong REN
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1384
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - We present a simple decoding algorithm that modifies soft bit-flipping algorithm for decoding LDPC codes. In our method, a new parameter is explored to distinguish the variables (symbols) belonging to the same number of unsatisfied constraints. A token is also assigned in the method to avoid repeated flipping of the same variable, rather than using a constant taboo length. Our scheme shows a similar computational load as the taboo-based algorithm, while having a similar decoding performance as the belief propagation algorithm.
ER -