摘要
针对Turbo乘积码(TPC)译码复杂度高、运算量大的缺点,分析了一种改进的TPC译码算法。该算法以Chase迭代算法为基础,通过对错误图样重新排序产生新的测试序列,其伴随式可从前次伴随式的基础上修正一位得到,大大简化了计算步骤。在AWGN信道下对新算法进行了Matlab仿真,结果表明,改进的算法在保持译码性能基本不变的前提下,提高了译码速度,降低了译码复杂度。
Considering the high complexity and computation of TPC,an improved algorithm is proposed.It is based on Chase iterative decoding algorithm and new test sequences are produced through reordering error patterns.Compared with the last,the new syndromes need adjust only one different bit so that the computation procedure is greatly simplified.Performance on the AWGN channel indicates that the improved algorithm accelerates decoding procedures,and reduces relatively the decoding complexity with the similar decoding performance of Chase decoding algorithm.
出处
《电子设计工程》
2011年第22期18-20,24,共4页
Electronic Design Engineering
基金
国家自然科学基金项目(60672184)
航空科学基金项目(20085553016)
西北工业大学研究生创业种子基金资助项目(Z2011109)
