在规则LDPC代码集合中暴露伪八层
Exposing Pseudoweight Layers in Regular LDPC Code Ensembles
摘要:
针对图覆盖度M >= 1的情况,给出了正则低密度奇偶校验(LDPC)码系综的AWGN伪八分布的渐近增长率的求解方法.增长率的评估需要2M +1个未知数的2M +1个非线性方程组的解。在图覆盖度较低的情况下,给出了两个规则LDPC码系综伪八分布的仿真结果。
英文摘要:
A solution is presented for the asymptotic growth rate of the AWGN-pseudoweight distribution of regular low-density parity-check (LDPC) code ensembles for a selected graph cover degree M >= 1. The evaluation of the growth rate requires solution of a system of 2M+1 nonlinear equations in 2M+1 unknowns. Simulation results for the pseudoweight distribution of two regular LDPC code ensembles are presented for graph covers of low degree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。