摘要
对一类性能好且复杂度低的纠错编码技术——乘加码进行了介绍。他是在单校验位的Turbo乘积码(Single Parity Check Turbo Product Code)的基础上改进而来的,即由单校验位的Turbo乘积码作为外码,码率为1的递归卷积码作为内码串行级联而成。介绍了乘加码的编码方式和译码方法,并给出了其性能分析。对于一定的分组长度,这类码表现出与Turbo码相近的性能,但其译码复杂度要远远低于Turbo码。
A new class of codes,derived from single- parity check Turbo product code, named product accumulate codes, which are the concatenation of an outer single- parity check Turbo product code and an inner rate - 1 recursive convolution code is proposed. Its encoder structure and decoding approach are presented, and performance is analysed. For practical block length, these codes provide similar performance to Turbo codes but with significantly lower decoding complexity.
出处
《现代电子技术》
2006年第3期1-3,9,共4页
Modern Electronics Technique
基金
国家自然科学基金项目
航空科技基金(10477014)