朱海1,,,
冯丹2,
张博1,
周慢杰1
1.周口师范学院网络工程学院 周口 466001
2.西安邮电大学通信与信息工程学院 西安 710121
基金项目:国家自然科学基金(61801527, 11971311)，国家自然科学基金数学天元基金资助项目(12026230, 12026231)，河南省高等学校青年骨干教师培养计划(2018GGJS137)，河南省高等学校重点科研项目(20A510017)，河南省自然科学基金项目(202300410523)，陕西省高校科协青年人才托举计划项目(20200116)，陕西省教育厅科研计划项目(20JK0918)
详细信息
作者简介:徐恒舟：男，1987年生，讲师，主要研究方向为组合设计与编码理论、信息论等
朱海：男，1978年生，教授，主要研究方向为信道编码、云计算、无线网络技术等
冯丹：女，1989年生，讲师，主要研究方向为编码调制、MIMO等
张博：男，1982年生，副教授，主要研究方向为信息论、信道编码等
周慢杰：女，1985年生，助教，主要研究方向为LDPC编码理论及信息教育技术等
通讯作者:朱海 zhu_sea@163.com
中图分类号:TN911.22计量
文章访问数:577
HTML全文浏览量:193
PDF下载量:55
被引次数:0
出版历程
收稿日期:2020-05-08
修回日期:2020-10-26
网络出版日期:2020-11-19
刊出日期:2021-01-15
Construction of Low-rank Circulant Matrices and Their Associated Nonbinary LDPC Codes
Hengzhou XU1,Hai ZHU1,,,
Dan FENG2,
Bo ZHANG1,
Manjie ZHOU1
1. School of Network Engineering, Zhoukou Normal University, Zhoukou 466001, China
2. School of Communications and Information Engineering, Xi’an University of Post and Telecommunications, Xi’an 710121, China
Funds:The National Natural Science Foundation of China (61801527,11971311), The TianYuan Special Funds of the National Natural Science Foundation of China (12026230, 12026231), The Training Program for Young Core Instructor of Henan Universities (2018GGJS137), The Key Scientific Research Projects of Henan Educational Committee (20A510017), The Natural Science Foundation of Henan (202300410523), The Project of Youth Talent Lift Program of Shaanxi Association for Science and Technology (20200116), The Scientific Research Program Funded by Shaanxi Provincial Education Department (20JK0918)
摘要
摘要:在图像处理中，低秩矩阵的冗余信息可用于图像恢复和图像特征提取，而在迭代译码中，校验矩阵的冗余行可以加快译码收敛速度。该文研究一类易于硬件实现的低秩循环矩阵。首先将循环矩阵转换为位置集合，并基于同构理论简化了位置集合的搜索空间，从而基于比特移位方法提出了循环矩阵的构造方法。考虑非零域元素的列赋值与矩阵秩之间的关系，选取Tanner图中没有长度为4的环的循环矩阵，基于非零域元素的列赋值思想提出了不同阶数、不同码率的多元LDPC码构造方法。数值仿真结果表明，与基于PEG算法构造的二元LDPC码比较，所构造的多元LDPC码在BPSK调制方式下在误码字率10–5附近有0.9 dB的增益；在与高阶调制相结合时，有更大的性能提升。此外，所构造的多元LDPC码在迭代5次与50次下的性能几乎一致，这为低时延高可靠通信提供了一种有效的候选编码方案。
关键词:LDPC码/
低秩矩阵/
循环矩阵/
同构理论/
围长
Abstract:In image processing, the redundant information of low-rank matrices can be used for image recovery and image feature extraction, and redundant rows of the parity-check matrices can accelerate the convergence rate in iterative decoding. A class of low-rank circulant matrices with easy hardware implementation is studied. Circulant matrices are first converted into position sets, the search space of position sets is pruned based on isomorphism theory, and then construction of circulant matrices is proposed based on the bit shift method. Considering the relationship between the column assignment of non-zero field elements and the matrix rank, circulant matrices whose Tanner graphs have no cycles of length 4 are chosen, and according to the column assignment of non-zero field elements, construction of nonbinary LDPC codes over various finite fields and with different code rates is presented. Numerical simulation results show that, compared with binary LDPC codes constructed based on the PEG algorithm, the proposed nonbinary LDPC codes have 0.9 dB gain at Word Error Rate (WER) of 10-5 when the modulation is BPSK, and the performance gap becomes large by combining with high order modulations. Furthermore, the performance gap of the proposed codes between 5 iterations and 50 iterations is negligible, and it provides a promising coding scheme for low-latency and high-reliability communications.
Key words:LDPC code/
Low-rank matrix/
Circulant matrix/
Isomorphism theory/
Girth
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=69ddedec-4407-4836-b4c6-e3af5ac29a90
