编码协作系统基于最大公约数定理的QC⁃RA码联合构造  

Joint construction of QC⁃RA codes based on greatest common divisor theorem for coded cooperation

作　　者：付勇峰 张顺外[1] FU Yongfeng;ZHANG Shunwai(College of Telecommunications&Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学通信与信息工程学院,江苏,南京210003

出　　处：《南京邮电大学学报（自然科学版）》2021年第1期42-50,共9页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

基　　金：国家自然科学基金(61501256);江苏省高等学校自然科学研究项目(20KJB510034);南京邮电大学国家自然科学基金孵化项目(NY219073)资助项目。

摘　　要：准循环重复累积(Quasi⁃Cyclic Repeat Accumulate,QC⁃RA)码具有准循环低密度奇偶校验(Low Density Parity Check,LDPC)码的优点,同时能实现差分编码且为系统码,非常适用于编码协作系统,文中研究采用QC⁃RA码的编码协作系统。首先,提出基于最大公约数(Greatest Common Divisor,GCD)定理的QC⁃RA码构造方法;然后,进一步基于GCD定理联合构造编码协作系统信源节点与中继节点采用的QC⁃RA码,并从理论上证明基于该联合构造方法得到的编码协作系统QC⁃RA码无girth⁃4、girth⁃6环。仿真结果表明,采用QC⁃RA码的编码协作系统相对于点对点系统具有明显的性能增益;同时,与采用大列重构造QC⁃RA的编码协作相比,采用文中基于GCD定理联合构造的QC⁃RA码的编码协作误码率性能更加优异。Quasi⁃cyclic repeat accumulate(QC⁃RA)codes have the merits of quasi⁃cyclic low density parity check(LDPC)codes and enable differential encoding,thus QC⁃RA codes are suitable for the coded cooperation system.A coded cooperation system with QC⁃RA codes is studied.Firstly,the greatest common divisor(GCD)theorem based QC⁃RA construction method is proposed.Then,the QC⁃RA codes by sources and relays in the coded cooperation are jointly constructed by the GCD based construction method.It is further proved that there are no girth⁃4 and girth⁃6 cycles in the jointly constructed QC⁃RA codes.The simulation results show that the QC⁃RA coded cooperation has a significant performance gain compared with the point⁃to⁃point coded system.Meanwhile,the coded cooperation with the proposed jointly constructed QC⁃RA codes outperforms the coded cooperation with the large column method con⁃structed QC⁃RA codes.

关 键 词：编码协作 准循环重复累积码 最大公约数定理 联合构造 

分 类 号：TN911.22[电子电信—通信与信息系统]