期刊文献+

低秩循环矩阵的构造方法及其关联的多元LDPC码 被引量:2

Construction of Low-rank Circulant Matrices and Their Associated Nonbinary LDPC Codes
下载PDF
导出
摘要 在图像处理中,低秩矩阵的冗余信息可用于图像恢复和图像特征提取,而在迭代译码中,校验矩阵的冗余行可以加快译码收敛速度。该文研究一类易于硬件实现的低秩循环矩阵。首先将循环矩阵转换为位置集合,并基于同构理论简化了位置集合的搜索空间,从而基于比特移位方法提出了循环矩阵的构造方法。考虑非零域元素的列赋值与矩阵秩之间的关系,选取Tanner图中没有长度为4的环的循环矩阵,基于非零域元素的列赋值思想提出了不同阶数、不同码率的多元LDPC码构造方法。数值仿真结果表明,与基于PEG算法构造的二元LDPC码比较,所构造的多元LDPC码在BPSK调制方式下在误码字率10–5附近有0.9 dB的增益;在与高阶调制相结合时,有更大的性能提升。此外,所构造的多元LDPC码在迭代5次与50次下的性能几乎一致,这为低时延高可靠通信提供了一种有效的候选编码方案。 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.
作者 徐恒舟 朱海 冯丹 张博 周慢杰 XU Hengzhou;ZHU Hai;FENG Dan;ZHANG Bo;ZHOU Manjie(School of Network Engineering,Zhoukou Normal University,Zhoukou 466001,China;School of Communications and Information Engineering,Xi’an University of Post and Telecommunications,Xi’an 710121,China)
出处 《电子与信息学报》 EI CSCD 北大核心 2021年第1期85-91,共7页 Journal of Electronics & Information Technology
基金 国家自然科学基金(61801527,11971311) 国家自然科学基金数学天元基金资助项目(12026230,12026231) 河南省高等学校青年骨干教师培养计划(2018GGJS137) 河南省高等学校重点科研项目(20A510017) 河南省自然科学基金项目(202300410523) 陕西省高校科协青年人才托举计划项目(20200116) 陕西省教育厅科研计划项目(20JK0918)。
关键词 LDPC码 低秩矩阵 循环矩阵 同构理论 围长 LDPC code Low-rank matrix Circulant matrix Isomorphism theory Girth
  • 相关文献

参考文献7

二级参考文献24

  • 1雷维嘉,谢显中,李广军.一种基于LDPC编码的协作通信方式[J].电子学报,2007,35(4):712-715. 被引量:18
  • 2L Xiao,T E Fuja,et al.A network coding approach to cooperative diversity[J].IEEE Trans Info Theory,2007,53(10):3714-3722.
  • 3Z Ding,K K Leung,et al.On the study of network coding with diversity[J].IEEE Trans Wireless Comm,2009,8(3):1247-1259.
  • 4Y Li,G Song,L Wang.Design of joint network-Low density parity check codes based on the EXIT charts[J].IEEE Comm Letters,2009,13(8):600-602.
  • 5Y Li,G Song,L Wang.Analysis of the joint network LDPC codes over orthogonal multi-access relay channel[J].IEEE Comm Letters,2010,14(2):184-186.
  • 6Z Li,L Chen,et al.Efficient encoding of quasi-cyclic low-density parity-check codes[J].IEEE Trans Comm,2006,54(1):71-81.
  • 7S Myung,K Yang,J Kim.Quasi-cyclic LDPC codes for fast encoding[J].IEEE Trans Info Theory,2005,51 (8):2894-2901.
  • 8S Lin,Daniel,J Costello.Error Control Coding,Fundamentals and Applications-Second Edition[M].New Jersey,America:Prentice Hall,2004.577-592.
  • 9T J Richardson,M A Shokrollahi,R L Urbanke.Design of capacity approaching irregular low-density parity-check codes[J].IEEE Trans Info Theory,2001,47(9):619-637.
  • 10Yanjaneyulu,Swamy R Y,Prabhakra R R.Studies on some mixed ligand complexes of copper(Ⅱ) with 8-hydroxyquinoline and salicylic acids.relation between stability constants and antimicrobial activity[J].J Indian Chem Soc,1985,LXII(May): 346-351.

共引文献261

同被引文献9

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部