【摘要】：信道編碼參數(shù)盲估計(jì)一直是非合作通信領(lǐng)域的熱門話題,在通信對(duì)抗、電子偵察和信息獲取等軍事領(lǐng)域有著廣泛的應(yīng)用。在非合作的電子對(duì)抗領(lǐng)域,從對(duì)截獲信號(hào)研究轉(zhuǎn)入信息底層解碼的第一步是從獲取到的信息碼流中成功提取有效信息,并正確識(shí)別編碼類型和估計(jì)編碼參數(shù)。線性分組碼是信道編碼中非常重要的一類。本文重點(diǎn)研究復(fù)雜線性分組碼,圍繞復(fù)雜線性分組碼的參數(shù)盲估計(jì)方法開展工作,以下是主要內(nèi)容:1.介紹了信道編碼中需要用到的抽象代數(shù)基礎(chǔ)知識(shí)和重要性質(zhì),為后續(xù)線性分組碼參數(shù)盲估計(jì)算法的探討與實(shí)現(xiàn)做了鋪墊。2.完成了BCH-乘積碼參數(shù)盲估計(jì)算法。利用分組碼元之間的相關(guān)性,通過求數(shù)據(jù)矩陣歸一化秩完成對(duì)碼組偏差和分組碼長(zhǎng)的估計(jì)�；谧g碼匹配的估計(jì)方法,通過統(tǒng)計(jì)碼字正確率,完成對(duì)生成多項(xiàng)式中含本原多項(xiàng)式部分的估計(jì),再估計(jì)出最小多項(xiàng)式中的非本原多項(xiàng)式,兩者乘積即為估計(jì)的生成多項(xiàng)式。3.提出了基于含本原元因式的RS碼參數(shù)盲估計(jì)算法。通過統(tǒng)計(jì)RS碼中含有因式(x(10)?)的碼字個(gè)數(shù),完成對(duì)分組碼長(zhǎng)和本原多項(xiàng)式。利用RS碼生成多項(xiàng)式是由含本原元的連續(xù)冪根構(gòu)成這一特性,篩除錯(cuò)誤碼字后,通過驗(yàn)證連續(xù)冪根可完成對(duì)生成多項(xiàng)式的估計(jì)。此算法復(fù)雜度較低,只需要碼元序列中有少量正確碼字就能完成估計(jì),因此,即使在碼長(zhǎng)較長(zhǎng)的情況下,本文算法也具有較強(qiáng)的抗誤碼性,仿真表明,在誤碼率為0.002時(shí),識(shí)別概率仍達(dá)到90%。4.提出了抽取RS碼部分碼字進(jìn)行參數(shù)盲估計(jì)的算法。該算法核心思想是利用RS碼等效準(zhǔn)循環(huán)碼的性質(zhì),因?yàn)槌槿〉牟糠执a字間存在關(guān)聯(lián)性,通過對(duì)不同位數(shù)的碼元抽取,求得其空間維數(shù),以此完成對(duì)RS碼的碼長(zhǎng)估計(jì)。該算法的優(yōu)點(diǎn)在于只需要用到部分碼字就能完成參數(shù)估計(jì),節(jié)省了算法運(yùn)行的空間復(fù)雜度,與使用完整碼字在伽羅華擴(kuò)域求歸一化秩相比,運(yùn)行速度快了一倍以上。5.提出了刪除RS碼的參數(shù)盲估計(jì)算法。在傳統(tǒng)歐幾里得算法基礎(chǔ)上進(jìn)行改進(jìn),利用兩個(gè)相異刪除RS碼碼字求最大公因式仍然等于原生成多項(xiàng)式這一特性,假設(shè)不同參數(shù)下相異符號(hào)碼字之間求得最大公因式是否滿足條件,完成參數(shù)的盲估計(jì)。此算法抗誤碼性較好,在碼長(zhǎng)較長(zhǎng)且誤碼率低于0.001的情況下,仍能達(dá)到90%以上的識(shí)別概率。
[Abstract]:Blind estimation of channel coding parameters has been a hot topic in the field of non-cooperative communication, and has been widely used in military fields such as communication countermeasures, electronic reconnaissance and information acquisition. In the field of non-cooperative electronic countermeasures, the first step from the research of intercepting signals to the low-level decoding of information is to extract the effective information from the obtained information stream successfully, and to correctly identify the encoding types and estimate the coding parameters. Linear block code is a very important class of channel coding. This paper focuses on the study of complex linear block codes, focusing on the blind parameter estimation method of complex linear block codes. The following is the main content: 1. This paper introduces the basic knowledge and important properties of abstract algebra used in channel coding, and paves the way for the discussion and implementation of blind parameter estimation algorithm of linear block codes. BCH-product code parameter blind estimation algorithm is completed. Based on the correlation between block symbols, the normalized rank of the data matrix is used to estimate the block deviation and block length. Based on the estimation method of decoding matching, the estimation of the part of the generating polynomial containing the primitive polynomial is completed by statistical codeword accuracy, and the non-primitive polynomial in the minimum polynomial is estimated. The product of the two polynomials is the estimated generating polynomial. 3. A blind estimation algorithm for RS code parameters based on primitive elements is proposed. By counting the factor (x (10 in the RS code?) The number of codewords, complete block code length and primitive polynomial. The RS code generating polynomial is composed of a continuous power root with primitive elements. After the error codeword is eliminated, the estimation of the generating polynomial can be completed by verifying the continuous power root. The complexity of this algorithm is low, only a small number of correct codewords in the code sequence are needed to complete the estimation. Therefore, even if the code length is longer, the algorithm also has a strong error resistance. The simulation results show that the error rate is 0.002. The probability of recognition is still 90. 4. A blind parameter estimation algorithm for extracting partial codewords from RS codes is proposed. The key idea of the algorithm is to use the property of the RS code equivalent quasi-cyclic code, because there is correlation between the extracted part of the code word, by extracting different bits of symbols, the spatial dimension is obtained, and the code length estimation of the RS code is completed. The advantage of the algorithm is that only some codewords are needed to complete the parameter estimation, and the space complexity of the algorithm is saved. Compared with solving the normalized rank of the complete codeword in the Galois domain, the speed of the algorithm is more than twice as fast as .5. A blind parameter estimation algorithm for deleting RS codes is proposed. On the basis of the traditional Euclidean algorithm, using two different deleting RS code words to find the largest common factor is still equal to the original generating polynomial. Assuming that the maximum common factor can satisfy the condition between the words of different symbol numbers under different parameters, the blind estimation of the parameters is completed. The algorithm has good error tolerance, and the recognition probability is more than 90% when the code length is longer and the bit error rate is less than 0.001.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN911.22

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 張立民;凌青;閆文君;;基于高階累積量的空時(shí)分組碼盲識(shí)別算法研究[J];通信學(xué)報(bào);2016年05期

2 鄭瑞瑞;汪立新;;基于碼重分布概率方差的循環(huán)碼識(shí)別方法[J];太赫茲科學(xué)與電子信息學(xué)報(bào);2013年05期

3 張永光;鄭仕鏈;;BCH碼的參數(shù)識(shí)別研究[J];西安電子科技大學(xué)學(xué)報(bào);2013年05期

4 陳金杰;楊俊安;;一種對(duì)線性分組碼編碼參數(shù)的盲識(shí)別方法[J];電路與系統(tǒng)學(xué)報(bào);2013年02期

5 解輝;王豐華;黃知濤;張錫祥;;基于頻譜預(yù)處理的RS碼盲檢測(cè)識(shí)別方法[J];宇航學(xué)報(bào);2013年01期

6 王平;曾偉濤;陳健;陸繼翔;;一種利用本原元的快速RS碼盲識(shí)別算法[J];西安電子科技大學(xué)學(xué)報(bào);2013年01期

7 楊曉煒;甘露;;基于Walsh-Hadamard變換的線性分組碼參數(shù)盲估計(jì)算法[J];電子與信息學(xué)報(bào);2012年07期

8 江文斌;秦會(huì)斌;邵李煥;鄭梁;;基于經(jīng)典譜估計(jì)改進(jìn)方法的渦街流量計(jì)[J];儀器儀表學(xué)報(bào);2012年01期

9 閆郁翰;湯建龍;;基于漢明距離的二進(jìn)制線性分組碼盲識(shí)別方法[J];通信對(duì)抗;2011年04期

10 陳金杰;楊俊安;;無線數(shù)傳信號(hào)編碼盲識(shí)別與解碼技術(shù)研究[J];電子測(cè)量與儀器學(xué)報(bào);2011年10期

相關(guān)碩士學(xué)位論文 前10條

1 佟婧麗;線性分組碼的盲識(shí)別技術(shù)研究[D];河北大學(xué);2015年

2 曾偉濤;BCH和RS碼編碼參數(shù)盲識(shí)別技術(shù)研究[D];西安電子科技大學(xué);2014年

3 楊曉煒;代數(shù)編碼的參數(shù)盲估計(jì)研究[D];電子科技大學(xué);2013年

4 周攀;循環(huán)碼參數(shù)盲估計(jì)與識(shí)別[D];電子科技大學(xué);2013年

5 丁宇;分組碼盲識(shí)別的算法研究[D];杭州電子科技大學(xué);2013年

6 劉瀟依;卷積編碼盲識(shí)別的DSP實(shí)現(xiàn)技術(shù)研究[D];杭州電子科技大學(xué);2013年

7 閆郁翰;信道編碼盲識(shí)別技術(shù)研究[D];西安電子科技大學(xué);2012年

8 劉宗輝;交織和分組碼參數(shù)盲估計(jì)與識(shí)別技術(shù)[D];電子科技大學(xué);2011年

9 劉菁;卷積碼和循環(huán)碼識(shí)別技術(shù)研究[D];西安電子科技大學(xué);2010年

10 薛國(guó)慶;卷積碼的盲識(shí)別研究[D];中國(guó)科學(xué)技術(shù)大學(xué);2009年

，

本文編號(hào)：2193669