基于概率逼近的本原BCH碼編碼參數的盲識別方法

闊永紅 曾偉濤 陳 健

?

基于概率逼近的本原BCH碼編碼參數的盲識別方法

闊永紅*曾偉濤 陳 健

(西安電子科技大學通信工程學院 西安 710071)

針對本原BCH碼編碼參數的盲識別問題，該文提出了一種基于概率逼近的盲識別方法。首先，利用Gauss分布和Poisson分布逼近隨機碼字的根概率特性，確定了搜索BCH碼長的門限；然后，通過分析本原域元素的檢錯能力及同構對域的影響，應用臨近域對的方法確定編碼域，提高了其識別能力；最后，給出識別生成多項式時的共軛根系表，從而減少了計算量。仿真結果表明，在較高的誤碼率下，該方法能快速地識別出BCH碼編碼所采用的編碼參數。

信道編碼；BCH碼；共軛根系；盲識別

1 引言

2 BCH碼定義及分析

2.1 BCH碼定義及分析

2.2 概率分布特性的逼近

3 BCH編碼盲識別的實現

3.1 用于域間搜索的門限定義

3.2 算法描述

圖1 誤碼率與誤碼碼字比例的關系

表1部分臨近域對

(203,253)(607,895)(701,647)(827,607) (425,333)(761,539)(859,761)(911,787)

4 仿真分析

4.1 仿真實驗與復雜度分析

4.2 仿真性能

表2算法的復雜度分析

文獻[10]文獻[11]本文所提算法 m=h m=9 m=3

圖3 不同碼長在各種誤碼率下的識別率

5 結束語

[1] Naseri Ali, Azmoon Omid, and Fazeli Samad. Blind recognition algorithm of Turbo codes for communication intelligence systems[J].2011, 8(6): 68-72.

[2] Jia Yong-qiang, Li Li-ping, Li You-zhu,..Blind estimation of communication emitter features parameters[C]. IEEE 12th International Conference on Computer and Information Technology, Chengdu, 2012: 281-285.

[3] 劉建成, 楊曉靜. 基于求解校驗序列的(,1,)卷積碼盲識別[J]. 電子與信息學報, 2012, 34(10): 2363-2368.

Liu Jian-cheng and Yang Xiao-jing. Blind recognition of (,1,) convolutional code based on solving check- sequence[J].&, 2012, 34(10): 2363-2368.

[4] Lu Pei-zhong, Li Shen, Zou Yan,.. Blind recognition of punctured convolutional codes[J].:,2005, 48(4): 484-498.

[5] 于沛東, 李靜, 彭華. 一種利用軟判決的信道編碼識別新算法[J].電子學報, 2013, 41(2): 301-306.

Yu Pei-dong, Li Jing, and Peng Hua.A novel algorithm for channel coding recognition using soft-decision[J]., 2013, 41(2): 301-306.

[6] Dingel Janis and Hagenauer Joachim. Parameter estimation of convolutional encoder from noisy observations[C]. IEEE International Symposium on Information Theory, Nice, 2007: 1776-1780.

[7] Cote Maxime and Sendrier Nicolas. Reconstruction of a Turbo-code interleaver from noisy observation[C]. IEEE International Symposium on Information Theory, Austin, 2010: 2003-2007.

[8] Barbier Johann. Reconstruction of Turbo-code encoders[C]. Proceedings of Denfense and Security Symposium, Space Communication Technologies Conference, Orlando, 2005: 463-473.

[9] Cluzeau Mathieu, Finiasz Matthieu, and Jean-Pierre Tillich. Methods for the reconstruction of parallel Turbo codes[C]. IEEE International Symposium on Information Theory, Texas, 2010: 2008-2012.

[10] 楊曉靜, 聞年成. 基于碼根信息差熵和碼根統計的BCH碼識別方法[J]. 探測與控制學報, 2010, 32(3): 69-73.

Yang Xiao-jing and Wen Nian-cheng. Recognition method of BCH codes based on roots information dispersion entropy and roots statistic[J].&,2010, 32(3): 69-73.

[11] 呂喜在, 黃芝平, 蘇紹璟. BCH碼生成多項式快速識別方法[J]. 西安電子科技大學學報, 2011, 38(6): 159-172.

Lü Xi-zai, Huang Zhi-ping, and Su Shao-jing. Fast recognition method for generator polynomial of BCH codes[J]., 2011, 38(6): 159-172.

[12] 甘露, 周攀. 基于中國剩余定理分解的RS碼快速盲識別算法[J]. 電子與信息學報, 2012, 34(12): 2838-2842.

Gan Lu and Zhou Pan. Fast blind recognition method of RS codes based on chinese remainder theorem decomposition[J].&, 2012, 34(12): 2838-2842.

[13] Cluzeau Mathieu and Finiasz Matthieu. Recovering a code’s length and synchronization from a noisy intercepted bitstream[C]. IEEE International Symposium on Information Theory, Seoul, 2009: 2737-2741.

[14] Cluzeau Mathieu. Block code reconstruction using iterative decoding techniques[C]. IEEE International Symposium on Information Theory, Seattle, 2006: 2269-2273.

[15] 楊曉煒, 甘露. 基于Walsh-Hadamard變換的線性分組碼參數盲估計算法[J]. 電子與信息學報, 2012, 34(7): 1642-1646.

Yang Xiao-wei and Gan Lu. Blind estimation algorithm of the linear block codes parameters based on WHT[J].&, 2012, 34(7): 1642-1646.

[16] Liu Xiao-bei, Koh Soo Ngee, Wu Xin-wen,.. Reconstructing a linear scrambler with improved detection capability and in the presence of noise[J]., 2012, 7(1): 208-218.

[17] Lin Shu and Costello D J. Error Control Coding: Fundamentals and Applications[M]. Upper Saddle River: Pearson Prentice Hall, 2004: 197, 234-238.

Wang Xin-mei and Xiao Guo-zhen. Error Correcting Code——Theory and Method(Revised Edition)[M]. Xi,an: Xidian University Publishing Company, 2011: 117, 124, 147, 254.

[19] Soong T T. Fundamentals of Probability and Statistics for Engineers[M]. Chichester:John Wiley & Sons, 2004: 182-183.

闊永紅： 女，1967年生，博士，教授，研究方向為智能信號處理.

曾偉濤： 男，1988年生，碩士生，研究方向為通信編碼識別技術.

陳 健： 男，1968年生，教授，博士生導師，研究方向為通信對抗、認知網絡.

Blind Identification of Primitive BCH Codes Parameters Based on Probability Approximation

Kuo Yong-hong Zeng Wei-tao Chen Jian

(,,,710071,)

To solve the issues of blind identification of primitive BCH codes encoding parameters, a novel identification algorithm with probability approximation is presented. Frist, by taking advantage of the approximation of random code words’ root probability character which uses Gaussian distribution and Poisson distribution, the thresholds for searching code length are structured. Second, though analyzing the checking ability of the primitive element and the impact of isomorphism on searching, the coding filed is determined by using the method of nearby fields pair which improves the performace of identification. Finally, the calculation is reduced by creating and using the conjugate roots table in the recognition of generator polynomial. Simulation results show that, the proposed algorithm achieves a significant improvement in identification probability even if in high BER situation.

Channel coding; BCH codes; Conjugate roots; Blind identification

TP391;TN911.22

A

1009-5896(2014)02-0332-08

10.3724/SP.J.1146.2013.00584

闊永紅 yhkuo@mail.xidian.edu.cn

2013-04-27收到，2013-07-27改回

國家自然科學基金(60972072)和高等學校學科創新引智計劃(B08038)資助課題