EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Reduced-Complexity Iterative Bounded Distance Decoder with Random Flipping for Product Codes

Guoming Song, Dongming Pi iD, Shancheng Zhao

Entropy · 20.07.2026 · 28 (7) · 824

DOI: 10.3390/e28070824 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Entropy, online erschienen am 20.07.2026. Verfasst von Guoming Song und 2 weiteren Autor:innen. Beteiligte Einrichtung: College of Information Science and Technology, Jinan University, Guangzhou 510632, China. Die Arbeit nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Guangdong Basic and Applied Basic Research Foundation, NSF of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Product codes (PCs) are widely used in high-speed communication systems due to their attractive trade-off between error-correction performance and complexity. To further meet the rapidly growing demand for higher data rates, soft-aided hard-decision decoders (SA-HDDs) have been developed. In this paper, we present a reduced-complexity iterative bounded distance decoder with random flipping (RC-iBDD-RF) for PCs, an SA-HDD that improves the decoding performance while preserving low decoding complexity. RC-iBDD-RF introduces an enhanced reliability metric that incorporates channel log-likelihood ratios (LLRs) and memory from previous iterations to guide random flipping. In addition, an error-and-erasure decoding (EaED) module employing fixed filling patterns, rather than randomly generated ones, is used for post-processing to further reduce the residual error rate. The comparisons for BCH-based PCs show that RC-iBDD-RF achieves both performance gain and complexity reduction with only a slight increase in memory requirement. Moreover, the proposed complexity-storage weighted SNR metric confirms its superior complexity-performance trade-off over iBDD-RF.

Schlagwörter

Stichwörter der Autor:innen

bit flippingerror-and-erasure decodingiterative bounded distance decodingproduct codesoft-aided hard-decision decoding

Autor:innen und Institutionen

  • College of Information Science and Technology, Jinan University, Guangzhou 510632, China.

ORCID-Profile: Dongming Pi

Förderung

  • National Natural Science Foundation of China
  • Guangdong Basic and Applied Basic Research Foundation
  • NSF of China

Zitieren

APA

Song, G., Pi, D., & Zhao, S. (2026). A Reduced-Complexity Iterative Bounded Distance Decoder with Random Flipping for Product Codes. Entropy, 28(7), 824. https://doi.org/10.3390/e28070824

Vancouver

Song G, Pi D, Zhao S. A Reduced-Complexity Iterative Bounded Distance Decoder with Random Flipping for Product Codes. Entropy. 2026;28(7):824. doi:10.3390/e28070824

BibTeX
@article{Song2026,
  author = {Song, Guoming and Pi, Dongming and Zhao, Shancheng},
  title = {A Reduced-Complexity Iterative Bounded Distance Decoder with Random Flipping for Product Codes},
  journal = {Entropy},
  year = {2026},
  volume = {28},
  number = {7},
  pages = {824},
  doi = {10.3390/e28070824}
}
Kostenlos starten →