Parameter-free $\ell_p$-Box Decoding of LDPC Codes

TL;DR

This paper introduces a parameter-free LDPC decoding method using an $ ext{l}_p$-box approach with ADMM, improving adaptability across various SNRs and channels.

Contribution

It proposes a novel parameter-free LP decoding framework with an $ ext{l}_p$-box constraint, enhancing flexibility and performance in LDPC decoding.

Findings

Achieves better adaptability to different SNRs and channels.

Outperforms traditional decoders in error floor regions.

Efficient distributed $ ext{l}_2$-box ADMM implementation.

Abstract

The Alternating Direction Method of Multipliers (ADMM) decoding of Low Density Parity Check (LDPC) codes has received many attentions due to its excellent performance at the error floor region. In this paper, we develop a parameter-free decoder based on Linear Program (LP) decoding by replacing the binary constraint with the intersection of a box and an $\ell_p$ sphere. An efficient $\ell_2$-box ADMM is designed to handle this model in a distributed fashion. Numerical experiments demonstrate that our decoder attains better adaptability to different Signal-to-Noise Ratio and channels.