论文部分内容阅读
目的:为减少校验节点过程总计算量,对低密度奇偶校验译码提出低复杂度的和积译码算法。创新点:降低和积译码计算复杂度的同时不损失译码性能。方法:在校验节点过程中使用时移快速傅里叶变换降低计算复杂度;在变量节点过程中使用优化后的常整数提升译码性能。所提算法性能在Wi-MAX和WLAN中的标准低密度奇偶校验码上测试并验证,且与SPA、SSPA和MSPA进行性能比较(图1-3)。结论:仿真结果表明,整体上所述算法对编码增益的提高值在0.04到0.46 d B之间;与和积算法(SPA)相比,所述算法可以降低译码过程所需42%-67%的全部代数运算操作。
OBJECTIVE: To reduce the total computational complexity of check nodes, a low complexity parity-sum decoding algorithm is proposed for low-density parity-check coding. Innovations: Reduce the complexity of sum-product decoding without losing coding performance. Methods: Time-varying fast Fourier transform is used to reduce computational complexity in verifying nodes. Using optimized regular integers in variable nodes improves decoding performance. The proposed algorithm is tested and validated on standard low density parity codes in Wi-MAX and WLAN and compared with SPA, SSPA and MSPA (Figure 1-3). CONCLUSIONS: The simulation results show that, as a whole, the proposed algorithm increases the coding gain between 0.04 and 0.46 d B. Compared with SPA algorithm, the proposed algorithm can reduce 42% -67 % Of all algebraic operations.