發(fā)布時間：2018-09-10 11:58

【摘要】：針對現(xiàn)有識別方法僅適用于本原BCH碼的問題,提出了一種軟判決條件下的縮短BCH碼識別方法.首先,根據(jù)軟判決信息由對應(yīng)硬判決序列建立分析矩陣;然后,通過矩陣高斯列消元,并建立二元假設(shè)檢驗,對碼長進(jìn)行判決.在此基礎(chǔ)上,構(gòu)建本原BCH碼,在不同本原多項式下利用軟判決信息對校驗矩陣進(jìn)行驗證,得到生成多項式的根分布,最終完成本原多項式和生成多項式的識別.該方法不僅能識別縮短BCH碼,也適用于本原BCH碼.仿真試驗證明了該方法的有效性,對本原BCH碼的識別結(jié)果表明,該方法的性能優(yōu)于傳統(tǒng)識別方法.
[Abstract]:In order to solve the problem that the existing recognition methods are only applicable to the original BCH codes, a method for the recognition of shortened BCH codes under soft decision conditions is proposed. First, the analysis matrix is established from the corresponding hard decision sequence according to the soft decision information, and then, the code length is determined by the matrix elimination of the Goliath element, and the binary hypothesis test is established. On this basis, the primitive BCH codes are constructed, the check matrix is verified by soft decision information under different primitive polynomials, the root distribution of the generated polynomials is obtained, and the recognition of primitive polynomials and generating polynomials is finally completed. This method can not only recognize the shortened BCH code, but also be suitable for the original BCH code. The simulation results show that the method is effective and the performance of the method is better than that of the traditional BCH code recognition method.
【作者單位】： 海軍航空大學(xué)信息融合研究所;
【基金】：國家自然科學(xué)基金重大研究計劃資助項目(91538201) 泰山學(xué)者工程專項經(jīng)費資助項目(st201511020)
【分類號】：TN911.22
，

本文編號：2234376