二进制准循环码的加法傅里叶变换编码算法  

Additive Fourier transform encoding algorithm for binary quasi-cyclic codes

作　　者：李润洲 黄勤[1] LI Runzhou;HUANG Qin(School of Electronic and Information Engineering,Beihang University,Beijing 100191,China)

机构地区：[1]北京航空航天大学电子信息工程学院,北京100191

出　　处：《西安电子科技大学学报》2020年第6期21-29,共9页Journal of Xidian University

基　　金：国家自然科学基金(61941106);中国科协青年人才托举工程(2017QNRC001)。

摘　　要：为了提高二进制准循环码编码效率,提出一种基于加法傅里叶变换的频域编码算法。利用向量与循环矩阵的乘法和向量循环卷积的等价性,通过有限域傅里叶变换加速循环卷积运算,实现快速编码。针对选择的加法傅里叶变换即Lin-Chung-Han变换工具,在其卷积定理基础上,结合狭义傅里叶变换的频域编码算法,证明了该变换也可以用于频域编码。为了减少二进制准循环码的编码复杂度,利用有限域傅里叶变换的共轭约束条件,提出了基于该变换的二进制准循环码编码算法。分析了给出的快速编码算法的复杂度,并与其他算法进行了对比。提出的算法在码长较长时具有很低的复杂度,而且其中的变换结构对称,在应用时具有一定的优势。To improve the encoding efficiency of binary quasi-cyclic codes,this paper proposes a frequency domain encoding algorithm based on the additive Fourier transform.Based on the equivalence of multiplication of vectors and cyclic matrices and cyclic convolution,finite field Fourier transform is used to accelerate the cyclic convolution operation,thereby realizing fast encoding.The Lin-Chung-Han transform is selected as a tool with its convolution theorem explained.Based on the frequency domain encoding algorithm with the normal Fourier transform,it is proved that the Lin-Chung-Han transform can also be used in frequency domain encoding.To reduce the encoding complexity of binary quasi-cyclic codes,the conjugate constraint of finite field Fourier transform is used to propose the encoding algorithm for binary quasi-cyclic codes.The complexity of the given fast encoding algorithm is analyzed and compared with other algorithms.The algorithm proposed in this paper has a low complexity when the code length is long,and the transformation structure is symmetrical,which has a certain advantage in applications.

关 键 词：准循环码 有限域傅里叶变换 卷积定理 频域编码 

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