基于系统码信息位搜索的二元(24,12,8)Golay译码算法  

(24,12,8)Golay Decoding Algorithm based on Searching Information Error of System Code

作　　者：江宝安[1] 

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

出　　处：《通信技术》2016年第11期1429-1432,共4页Communications Technology

摘　　要：针对(24,12,8)Golay译码问题,提出一种新的基于系统码信息位搜索的译码算法。该算法定义新的校正子,由接收到的信息位计算监督位,校正子由信息位计算出的监督位和接收的监督位相加共同确定,且具有可分性。译码只搜索信息位错误,不搜索监督位错误,与在整个码空间搜索错误位的一般线性分组码译码算法相比,该算法大幅降低了计算量,特别对纠多个错误位的(24,12,8)Golay码更加有效,同时也适用于循环码、BCH码和LDPC码的译码。A novel（24,12,8） Golay decoding algorithm based on searching information error of system code is proposed, which defines a new syndrome adding jointly by the received supervision bit and the supervision bits computing from the received information bits. The decoding algorithm only searches information-bit errors, no parity-bit errors. As compared with the general linear block-code decoding algorithm to search the entire code space error bits, this proposed decoding algorithm, could greatly reduce the amount of calculation, and is more effective for correcting multiple error bits of（24,12,8） Golay code, also applicable to decoding cyclic codes, BCH codes and LDPC codes.

关 键 词：纠错码 线性分组码 校正子 译码算法 循环码 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]