论文标题
在子字段上解码NB-LDPC代码
Decoding of NB-LDPC codes over Subfields
论文作者
论文摘要
非二进制低密度平价检查（NB-LDPC）代码可以提供有希望的性能优势，但具有高度解码的复杂性。为了应对这一挑战，在本文中，我们将有限字段的NB-LDPC代码视为\ textit {subfields}的代码，作为降低解码复杂性的一种手段。特别是，我们的方法基于一种新颖的方法，该方法将非二进制坦纳图在有限的字段上扩展到子字段上的图形。这种方法为单个NB-LDPC代码提供了几种解码策略，具有不同水平的性能复杂性权衡。仿真结果表明，在大多数情况下，与复杂性增长相比，性能损失最小。
The non-binary low-density parity-check (NB-LDPC) codes can offer promising performance advantages but suffer from high decoding complexity. To tackle this challenge, in this paper, we consider NB-LDPC codes over finite fields as codes over \textit{subfields} as a means of reducing decoding complexity. In particular, our approach is based on a novel method of expanding a non-binary Tanner graph over a finite field into a graph over a subfield. This approach offers several decoding strategies for a single NB-LDPC code, with varying levels of performance-complexity trade-offs. Simulation results demonstrate that in a majority of cases, performance loss is minimal when compared with the complexity gains.
