Computational complexity and quantization effects of decoding algorithms for non-binary LDPC codes
Computational complexity and quantization effects of decoding algorithms for non-binary LDPC codes
复制标题
DOI：
10.1109/icassp.2004.1326915
复制
发表时间：
2004-05
期刊：
影响因子：
--
通讯作者：
H. Wymeersch;H. Steendam;M. Moeneclaey
中科院分区：
文献类型：
--
作者：
H. Wymeersch;H. Steendam;M. Moeneclaey
该贡献涉及用于在一般二进制扩展字段上解码LDPC（低密度奇偶校验检查）代码的总和算法（SPA）及其对数域版本（LOG-SPA）的比较。对于两种算法，我们都根据实价操作的数量来确定它们的计算复杂性，并研究其对量化效应的敏感性。尽管在二进制LDPC代码的情况下，日志-SPA会产生较短的解码时间，但我们指出的是，增加场尺寸倾向于有利于水疗中心，尤其是当乘法仅花费的时间比添加时间多一点时。此外，我们表明LOG-SPA需要更少的量化水平，而量化量较小，而量度较小。
This contribution deals with the comparison of the sum-product algorithm (SPA) and its log-domain version (log-SPA) for decoding LDPC (low density parity check) codes over general binary extension fields. For both algorithms, we determine their computational complexity based on the number of real-valued operations and investigate their sensitivity to quantization effects. Whereas the log-SPA yields the shorter decoding time in the case of binary LDPC codes, we point out that increasing the field size tends to favor the SPA, especially when a multiplication takes only slightly more time than an addition. Further, we show that log-SPA requires fewer quantization levels and suffers less from a quantization induced error-floor.