| 引用本文: | 宁晓燕,孙晶晶,孙志国,宋禹良.LDPC码的分层类拟合修正最小和译码算法[J].哈尔滨工业大学学报,2022,54(11):88.DOI:10.11918/202112101 |
| NING Xiaoyan,SUN Jingjing,SUN Zhiguo,SONG Yuliang.Layered class fitting modified minimum sum decoding algorithm for LDPC codes[J].Journal of Harbin Institute of Technology,2022,54(11):88.DOI:10.11918/202112101 |
|
| 摘要: |
| 低密度奇偶检验码（LDPC）是一种广泛使用的信道编码,尤其在长码时性能更佳。与编码相对应的便是译码,起初LDPC译码算法的复杂度很高,因此在最小和（MS）译码算法中为了降低算法的复杂度,采用了近似运算,虽然有效地降低了算法的复杂度,却牺牲了部分的误码性能。针对这一现象,本文在最小和译码算法的基础上,再一次作出近似运算,提出类拟合修正最小和（CFMMS）译码算法。该算法会根据MS算法中的非线性函数构造出一种类拟合函数,可以对不同阈值内的变量节点信息作出不同的处理,尽可能实现对校验节点更新过程的准确补偿,使得到的结果更加接近于置信传播算法；在此基础上,应用分层式调度策略,提出一种分层类拟合修正最小和（LCFMMS）译码算法,改变了节点信息的更新顺序,提升了迭代更新中节点信息的可靠度,使得译码的收敛速度得以提升,同时节省了存储空间。仿真和数值结果表明,该文提出的译码算法在一定程度上提升了误码性能,且运算复杂度低、译码收敛速度快。 |
| 关键词: 低密度奇偶校验码 最小和译码算法 类拟合修正最小和译码算法 分层式调度 |
| DOI：10.11918/202112101 |
| 分类号:TN911.22 |
| 文献标识码:A |
| 基金项目:先进船舶通信与信息技术工业和信息化部重点实验室(AMCIT2101-05)；黑龙江省高精度卫星导航及海洋应用重点实验室开放基金(HKL-2021-Y02) |
|
| Layered class fitting modified minimum sum decoding algorithm for LDPC codes |
|
NING Xiaoyan,SUN Jingjing,SUN Zhiguo,SONG Yuliang
|
|
(College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China)
|
| Abstract: |
| Low density parity check code (LDPC) is a widely used channel coding, especially in long code. Corresponding to coding is decoding. The complexity of traditional LDPC decoding algorithm is high. Approximate operation has been adopted in the minimum sum (MS) decoding algorithm to reduce the complexity. Although the complexity can be effectively reduced, some BER performance is sacrificed. In view of the problem, we proposed a class fitting modified minimum sum (CFMMS) decoding algorithm, which performs the approximate operation for a second time based on the MS decoding algorithm. The algorithm constructs a fitting function according to the nonlinear function in MS algorithm, which can make different processing for the variable node information in different thresholds, and achieve accurate compensation for the updating process of verification nodes, so that the obtained results are closer to the confidence propagation algorithm. On the basis of the hierarchical scheduling strategy, a layered class fitting modified minimum sum (LCFMMS) decoding algorithm was proposed, which can change the update order of node information, improve the reliability of node information in iterative update, accelerate the convergence speed of decoding, and save storage space. Simulation and numerical results show that the proposed decoding algorithm improved bit-error rate (BER) performance to a certain extent, and had low computational complexity and fast decoding convergence speed. |
| Key words: low density parity check code minimum sum algorithm class fitting modified minimum sum decoding algorithm layered scheduling |
