arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.07720cs.ITmath.IT
收藏

稀疏回归 LDPC 码

Sparse Regression LDPC Codes

Jamison R. Ebert, Jean-Francois Chamberland, Krishna R. Narayanan

AI总结:

本文提出由非二元 LDPC 外码与 SPARC 内码级联的 SR-LDPC 码,并设计 AMP-BP 动态软信息译码算法及低维状态演化调参方法,仿真显示其在 AWGN 信道上优于现有码并可获得成形增益。

摘要:

本文介绍了一种称为稀疏回归 LDPC(SR-LDPC)码的新型级联编码方案。SR-LDPC 码由一个外码非二元 LDPC 码和一个内码稀疏回归码(SPARC)组成,二者各自的域大小和分段大小相等。针对此类码,本文提出了一种基于近似消息传递(AMP)的高效译码算法,该算法在内、外译码器之间动态共享软信息。这种动态信息交换由一个去噪器促成,该去噪器在每次 AMP 迭代中对外层 LDPC 码的因子图运行置信传播(BP)。文中证明,该去噪器属于不可分离的伪利普希茨去噪函数类别,因此所提出的 AMP-BP 算法满足状态演化。利用 SR-LDPC 码丰富的结构,本文提出了一种高效的低维近似状态演化递归,可用于高效的超参数调优,从而为未来最优码设计的工作铺平道路。最后,数值仿真表明,在实际关注的参数下,SR-LDPC 码在 AWGN 信道上的性能优于当代码。SR-LDPC 码被证明是在 AWGN 信道上获得成形增益的可行手段。

英文摘要:

This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC) whose respective field size and section sizes are equal. For such codes, an efficient decoding algorithm is proposed based on approximate message passing (AMP) that dynamically shares soft information between inner and outer decoders. This dynamic exchange of information is facilitated by a denoiser that runs belief propagation (BP) on the factor graph of the outer LDPC code within each AMP iteration. It is shown that this denoiser falls within the class of non-separable pseudo-Lipschitz denoising functions and thus that state evolution holds for the proposed AMP-BP algorithm. Leveraging the rich structure of SR-LDPC codes, this article proposes an efficient low-dimensional approximate state evolution recursion that can be used for efficient hyperparameter tuning, thus paving the way for future work on optimal code design. Finally, numerical simulations demonstrate that SR-LDPC codes outperform contemporary codes over the AWGN channel for parameters of practical interest. SR-LDPC codes are shown to be viable means to obtain shaping gains over the AWGN channel.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑