A Progressive Interpolation Approach for Guruswami-Sudan Algorithm

摘要：

　　In this paper,we present a progressive interpolation approach in Guruswami-Sudan (GS) decoding of Reed-Solomon (RS) codes.The objective of the interpolation is to construct the minimal polynomial Q(x,y) by the progressive approach with increasing multiplicities until the roots of Q(x,y) give the correct message.Then the error-correction capability can be adaptively obtained by assigning a suitable multiplicity according to the number of errors occurred in the channel.We present an efficient way to update the polynomial set utilizing the previous computational results in the interpolation step.It enables the decoder to adjust its decoding complexity to the needed level.Simulation results suggest that the average decoding complexity of GS algorithm can be significantly reduced by the progressive approach for RS codes.

关键词： Guruswami-Sudan algorithm progressive interpolation Reed-Solomon codes

作者: Jingwei Zhang Chang-An Zhao Li Chen Xiao Ma

作者单位: School of Mathematical Science,Yangzhou University,Yangzhou, China School of Educational Software and Computer Science,Guangzhou University,Guangzhou, China School of Information Science and Technology, Sun Yat-sen University,Guangzhou, China

会议类型: 国际会议

会议名称: 2012 IEEE 14th International Conference on Communication Technology(2012年第十四届通信技术国际会议(ICCT 2012))

会议地点: 成都

会议语种:英文

页码: 1306-1310

在线出版日期: 2012-11-09（万方平台首次上网日期，不代表论文的发表时间）