基于长除法的BCH(15,7)译码算法  

BCH(15,7) Decoding Algorithm based on Long Division

作　　者：江宝安 JIANG Bao-an(College of Mobile Communication,University of Post and Telecommunication of Chongqing,Chongqing 401520,China)

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

出　　处：《通信技术》2018年第8期1803-1805,共3页Communications Technology

摘　　要：BCH(15,7)码可纠错2 bit错误位,是一种应用广泛的信道编码。常见的实用译码方法是查表法,其存储错误比特和校验子的对应表即错误图样,译码时根据计算的校验子查错误图样表得到错误比特。BCH(15,7)的错误图样较大,存储错误图样表占用较大内存,查找较费时,译码较慢。因此,针对BCH(15,7)快速译码问题,提出了一种新颖的基于长除法的译码算法。该算法只利用有限域F_2(x)中的长除法即可快速译码,不需要存储错误图样,也不需要解BM方程。理论和仿真证明,此算法有效可行,软硬件实现简单易行,可推广到实际BCH(15,7)的译码电路,具有较大的实际应用价值。The BCH （15,7） code can correct 2 bit error bits and is a widely-used channel coding. A common practical decoding method is a look-up-table method, which firstly stores the correspondence table of the error bit and the syndrome, that is, the error pattern, and acquires the error bit according to the calculated syndrome check pattern table during decoding. Since the error pattern of the BCH （15,7） is large, the memory error pattern table would occupy a fairly large memory, and the search be time-consuming, and the decoding be slow. Aiming at the fast decoding problem of BCH （15,7）, a novel decoding algorithm based on long division is proposed. This algorithm can realize quick decoding by using only the long division in the finite field F2（x）, without storing the error pattern or solving the BM equation. The theory and simulation prove that this algorithm is effective and feasible, the software and hardware implementation simple and easy, and can be extended to the actual BCH （15,7） decoding circuit, and thus has great practical application value.

关 键 词：纠错码 BCH 循环码 长除法 

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