Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.01019

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.01019 (cs)
[Submitted on 1 Oct 2025 ]

Title: Layered Normalized Min-Sum Decoding with Bit Flipping for FDPC Codes

Title: 分层归一化最小和解码与比特翻转用于FDPC码

Authors:Niloufar Hosseinzadeh, Mohsen Moradi, Hessam Mahdavifar
Abstract: Fair-density parity-check (FDPC) codes have been recently introduced demonstrating improved performance compared to low-density parity-check (LDPC) codes standardized in 5G systems particularly in high-rate regimes. In this paper, we introduce a layered normalized min-sum (LNMS) message-passing decoding algorithm for the FDPC codes. We also introduce a syndrome-guided bit flipping (SGBF) method to enhance the error-correction performance of our proposed decoder. The LNMS decoder leverages conflict graph coloring for efficient layered scheduling, enabling faster convergence by grouping non-conflicting check nodes and updating variable nodes immediately after each layer. In the event of decoding failure, the SGBF method is activated, utilizing a novel reliability metric that combines log-likelihood ratio (LLR) magnitudes and syndrome-derived error counts to identify the least reliable bits. A set of candidate sequences is then generated by performing single-bit flips at these positions, with each candidate re-decoded via LNMS. The optimal candidate is selected based on the minimum syndrome weight. Extensive simulation results demonstrate the superiority of the proposed decoder. Numerical simulations on FDPC$(256,192)$ code with a bit-flipping set size of $T = 128$ and a maximum of $5$ iterations demonstrate that the proposed decoder achieves approximately a $0.5\,\mathrm{dB}$ coding gain over standalone LNMS decoding at a frame error rate (FER) of $10^{-3}$, while providing coding gains of $0.75-1.5\,\mathrm{dB}$ over other state-of-the-art codes including polar codes and 5G-LDPC codes at the same length and rate and also under belief propagation decoding.
Abstract: 公平密度奇偶校验(FDPC)码最近被引入,与5G系统中标准化的低密度奇偶校验(LDPC)码相比,特别是在高率范围内表现出更好的性能。 在本文中,我们为FDPC码引入了一种分层归一化最小和(LNMS)消息传递解码算法。 我们还引入了一种基于校验的位翻转(SGBF)方法,以提高所提出的解码器的纠错性能。 LNMS解码器利用冲突图着色进行高效的分层调度,通过将不冲突的校验节点分组,并在每个层之后立即更新变量节点,从而实现更快的收敛。 在解码失败的情况下,激活SGBF方法,利用一种新颖的可靠性度量,结合对数似然比(LLR)幅度和由校验得到的错误计数,以识别最不可靠的位。 然后通过在这些位置进行单比特翻转生成一组候选序列,每个候选序列通过LNMS重新解码。 根据最小校验重量选择最优候选序列。 广泛的仿真结果证明了所提出解码器的优势。 对FDPC$(256,192)$码的数值仿真,具有比特翻转集大小为$T = 128$和最多$5$次迭代,在帧错误率(FER)为$10^{-3}$时,所提出的解码器相比独立的LNMS解码器实现了大约$0.5\,\mathrm{dB}$的编码增益,同时在相同长度和速率下,与其他最先进的码(包括极化码和5G-LDPC码)以及在置信传播解码下也提供了$0.75-1.5\,\mathrm{dB}$的编码增益。
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2510.01019 [cs.IT]
  (or arXiv:2510.01019v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.01019
arXiv-issued DOI via DataCite

Submission history

From: Mohsen Moradi [view email]
[v1] Wed, 1 Oct 2025 15:26:28 UTC (79 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号