论文标题
低复杂性非二元LDPC代码的设计，具有近似性能复杂性权衡
Design of Low Complexity Non-binary LDPC Codes with an Approximated Performance-Complexity Tradeoff
论文作者
论文摘要
通过在本手稿中设计出近似的性能复杂折衷（PCT）算法，该算法是Q- ARY输入对称性输出频道上的低复杂性非二元低密度均衡检查（LDPC）代码，在此手稿中设计了比阈值较低的非二元LDPC编码更快的收敛速度。我们通过硬决策解码器检查我们的算法。此外，模拟表明，近似PCT算法在解码迭代次数方面已将收敛过程加速了30％。
By presenting an approximated performance-complexity tradeoff (PCT) algorithm,a low-complexity non-binary low density parity check (LDPC) code over q-ary-input symmetric-output channel is designed in this manuscript which converges faster than the threshold-optimized non-binary LDPC codes in the low error rate regime. We examine our algorithm by both hard and soft decision decoders.Moreover, simulation shows that the approximated PCT algorithm has accelerated the convergence process by 30% regarding the number of the decoding iterations.
