(73,37,13)QR码的一种新型代数硬判决译码算法  

New algebraic decoding of the( 73,37,13) quadratic residue code

作　　者：段延森[1] 王琳[2] 黎勇[2] 

机构地区：[1]重庆邮电大学重庆市移动通信重点实验室,重庆400065 [2]厦门大学通信工程系,福建厦门361005

出　　处：《重庆邮电大学学报（自然科学版）》2013年第5期622-627,共6页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(60972053)~~

摘　　要：为了将inverse-free berlekamp-massey(IFBM)算法用于平方剩余(quadratic residue,QR)码的译码,必须对未知校正子进行计算以获得连续校正子。现有算法所得数据无法从理论上保证对于所有可纠的错误图案,均能解得与该错误图案相对应的未知校正子,因此由该算法所得的数据需借助于仿真验证,非常耗时。鉴于此,提出一种改进算法,所得数据从理论上可保证对于所有可纠的错误图案,均能得到与之相应的未知校正子。基于该改进算法,提出了(73,37,13)QR码的代数硬判决译码算法,并对所有可纠的错误图案(共185 859 898个)进行穷举仿真测试,结果验证了译码算法的正确性。In order to utilize the inverse-free Berlekamp-Massey algorithm to decode quadratic residue codes, it is essential to compute unknown syndromes to construct the enough consecutive syndromes that are needed for the application of the IF- BM algorithm. But for all the decodable error patterns, the critical data which are obtained from the previous algorithms cannot guarantee theoretically obtaining the right unknown syndromes corresponding to every error pattern. In view of this, in this paper, an improved algorithm is proposed to theoretically assure the right unknown syndromes corresponding to every decodable error pattern. Based on the modified algorithm, an algebraic decoding algorithm of the （73, 37, 13 ） quadratic residue code is depicted, and exhaustive tests of all decodable error patterns whose exact number is 185859898 are conduc- ted successfully.

关 键 词：IFBM算法 平方剩余码 未知校正子 代数硬判决译码 错误图案 

分 类 号：TN911.22[电子电信—通信与信息系统]