Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain

2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)(2018)

引用 0|浏览15
暂无评分
摘要
This paper presents a novel coding scheme for collective encoding and collective iterative soft-decision decoding of cyclic codes of prime lengths in Galois-Fourier transform (GFT) domain. The encoding of a cyclic code is performed on a collection of codewords which are mapped through composition, Hadamard permutations, and GFT into a codeword in an LDPC code with a binary parity-check matrix for transmission. Using this matrix, binary iterative decoding is applied to jointly decode a collection of codewords in the cyclic code. The joint-decoding allows reliability information sharing among the received vectors corresponding to the transmitted codewords in the collection during the iterative decoding process. This joint-decoding and information sharing can achieve a joint-decoding gain over the maximum likelihood decoding of individual codewords. The binary iterative decoding can be performed efficiently and reduces the decoding complexity significantly.
更多
查看译文
关键词
cyclic code,codeword,LDPC code,binary parity-check matrix,binary iterative decoding,iterative decoding process,joint-decoding gain,maximum likelihood decoding,decoding complexity,collective encoding,Galois-Fourier transform,novel coding scheme,collective iterative soft-decision decoding,GFT domain
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要