Tabu-List Probabilistic Sequential Adaptive Threshold Gradient Descent Bit-Flipping Algorithm 


Vol. 46,  No. 5, pp. 810-813, May  2021
10.7840/kics.2021.46.5.810


PDF
  Abstract

This work proposes a BFA for LDPC codes aiming to improve the WER and decoding speed. BFAs correct errors by flipping the bits whose flipping function values are larger than a predetermined threshold. In the proposed BFA, the threshold is adaptively chosen at each iteration by utilizing the local maximum value of the flipping function. It expedites the decoding speed, decreases the sorting complexity for selecting thresholds, and improves the WER performance by probabilistically flipping the bits constituting trapping sets.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Kim and J. Ha, "Tabu-List Probabilistic Sequential Adaptive Threshold Gradient Descent Bit-Flipping Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 46, no. 5, pp. 810-813, 2021. DOI: 10.7840/kics.2021.46.5.810.

[ACM Style]

Myungin Kim and Jeongseok Ha. 2021. Tabu-List Probabilistic Sequential Adaptive Threshold Gradient Descent Bit-Flipping Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 46, 5, (2021), 810-813. DOI: 10.7840/kics.2021.46.5.810.

[KICS Style]

Myungin Kim and Jeongseok Ha, "Tabu-List Probabilistic Sequential Adaptive Threshold Gradient Descent Bit-Flipping Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 46, no. 5, pp. 810-813, 5. 2021. (https://doi.org/10.7840/kics.2021.46.5.810)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880