Additive Fourier transform encoding algorithm for binary quasi-cyclic codes

被引：0
|
作者：
Li R. [1 ]
Huang Q. [1 ]
机构：
[1] School of Electronic and Information Engineering, Beihang University, Beijing
来源：
Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University | 2020年 / 47卷 / 06期
关键词：
Convolution theorem; Finite field Fourier transform; Frequency domain encoding; Quasi-cyclic codes;
D O I：
10.19665/j.issn1001-2400.2020.06.004
中图分类号：
学科分类号：
摘要：
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. © 2020, The Editorial Board of Journal of Xidian University. All right reserved.
引用
收藏
页码：21 / 29
页数：8
相关论文
共 15 条
  • [1] BLAHUT R E., Transform Techniques for Error Control Codes, IBM Journal of Research and Development, 23, 3, pp. 299-315, (1979)
  • [2] BLAHUT R E., Algebraic Codes for Data Transmission, (2003)
  • [3] TANNER R M., Spectral Graphs for Quasi-cyclic LDPC Codes, Proceedings of the 2001IEEE International Symposium on Information Theory, (2001)
  • [4] ZHANG L, HUANG Q, LIN S, Et al., Quasi-cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares, IEEE Transactions on Communications, 58, 11, pp. 3126-3139, (2010)
  • [5] ZHANG L, HUANG Q, LIN S, Et al., Quasi-Cyclic LDPC Codes on Latin Squares and the Ranks of Their Parity-check Matrices, Proceedings of the 2010 Information Theory and Applications Workshop, pp. 16-22, (2010)
  • [6] TANG L, HUANG Q, WANG Z, Et al., Low-complexity Encoding of Binary Quasi-cyclic Codes Based on Galois Fourier Transform, Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 131-135, (2013)
  • [7] HUANG Q, TANG L, HE S, Et al., Low-complexity Encoding of Quasi-cyclic Codes Based on Galois Fourier Transform, IEEE Transactions on Communications, 62, 6, pp. 1757-1767, (2014)
  • [8] LIN S J, CHUNG W H, HAN Y S., Novel Polynomial Basis and Its Application to Reed-solomon Erasure Codes, Proceedings of the 2014 Annual IEEE Symposium on Foundations of Computer Science, pp. 316-325, (2014)
  • [9] LIN S J, AL-NAFFOURI T Y, HAN Y S, Et al., Novel Polynomial Basis with Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes, IEEE Transactions on Information Theory, 62, 11, pp. 6284-6299, (2016)
  • [10] LI R, HUANG Q, WANG Z., Encoding of Non-binary Quasi-cyclic Codes by Lin-Chung-Han Transform, Proceedings of the 2018 IEEE Information Theory Workshop, (2018)
12