一种改进的二阶Reed-Muller译码算法  

Modified Decoding Algorithm for 2-Order Reed-Muller Codes

作　　者：李效坡[1] 陈发堂[1] 

机构地区：[1]重庆邮电大学,重庆400065

出　　处：《通信技术》2007年第6期14-15,20,共3页Communications Technology

摘　　要：研究了一种改进的RM译码算法—改进的Sidel,nikov-Pershakov算法(简称SP算法),详细叙述了原始算法的原理以及改进算法的译码步骤,并对两种算法进行了仿真实现,对它们的译码性能和算法复杂度进行了比较。改进的译码算法复杂度略优于原始算法,而改进后的算法的译码性能明显优于原始算法。This paper has a study on the modified decoding algorithm for binary second-order Reed-Muller codes:the modified Sidel,nikov-Pershakov decoding algorithm, and describes in detail the principles of the original algorithm and the decoding steps of the modified algorithm. These two algorithms are simulated and their decoding performance and algorithm complexity compared. The complexity of the proposed algorithm is lower than the original one, while the decoding performance obviously better than the original one.

关 键 词：REED-MULLER码 译码 SP算法 

分 类 号：TN929[电子电信—通信与信息系统]