本文關(guān)鍵詞：信道編碼中卷積碼和級聯(lián)碼的識別　出處：《電子科技大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 信道編碼 卷積碼 級聯(lián)碼 參數(shù)識別

【摘要】：在無線通信中,信道編碼的加入是為了抵抗通信過程中的干擾噪聲。卷積碼、級聯(lián)碼作為常用的信道編碼,被廣泛用于無線通信中。所以,他們的參數(shù)識別在信息截獲、智能通訊等領(lǐng)域顯得尤為重要。本文研究了卷積碼和級聯(lián)碼的編碼特點(diǎn)和所要識別參數(shù)的識別方法,并根據(jù)這些特點(diǎn)建立了一套完整的編碼參數(shù)識別流程方法,本文主要內(nèi)容安排包括:介紹了目前關(guān)于RS碼、卷積碼和交織參數(shù)識別中需要識別出的參數(shù)類型以及他們識別的基本原理和識別的基礎(chǔ)算法。根據(jù)卷積碼的編碼特點(diǎn),對于1/n碼率的卷積碼可以將1/2碼率卷積碼識別算法推廣到1/n碼率卷積碼。該算法在估計1/n碼率的生成矩陣時用歐幾里得算法,容錯性能較好,所需數(shù)據(jù)量比較小,并且計算速度也比較快。根據(jù)卷積碼等效生成矩陣的概念,將系統(tǒng)卷積碼的參數(shù)估計推廣到k/n卷積碼。該算法采用核空間求解,實(shí)現(xiàn)了一定程度的容錯性。根據(jù)不同碼率卷積碼的特點(diǎn),提出了卷積碼的總體識別算法,實(shí)現(xiàn)了任意碼率卷積碼從碼長、碼率到生成多項(xiàng)式的總體估計。討論級聯(lián)碼的識別方法,由于級聯(lián)碼目前還沒有相關(guān)的識別算法可供參考,在識別之前,首先研究了級聯(lián)碼的編碼特性和碼字特點(diǎn),然后根據(jù)級聯(lián)碼的特點(diǎn)提出了一種分級識別的級聯(lián)碼識別算法。仿真實(shí)驗(yàn)表明,該算法能夠有效的識別出級聯(lián)碼的內(nèi)碼外碼參數(shù)。在誤碼率為0.005的情況下,檢測概率依然在90%以上。研究了實(shí)際的映射中存在的相位模糊問題,討論了映射對參數(shù)識別的影響,研究了一種關(guān)于映射和編碼類型和編碼參數(shù)統(tǒng)一識別的算法�？紤]了映射中相位模糊對編碼參數(shù)的影響,實(shí)現(xiàn)了映射關(guān)系和編碼參數(shù)的聯(lián)合估計。保證了在實(shí)際的信道編碼參數(shù)估計中參數(shù)的正確性。
[Abstract]:In wireless communication, channel coding is added to resist interference noise. Convolutional codes, concatenated codes are widely used in wireless communication as common channel coding. Their parameter identification is particularly important in the fields of information interception and intelligent communication. This paper studies the coding characteristics of convolutional code and concatenated code and the identification method of the parameters to be identified. According to these characteristics, a set of complete coding parameter identification process is established. The main contents of this paper are as follows: the current RS code is introduced. The types of parameters needed to be recognized in convolutional code and interleaved parameter recognition, the basic principles and algorithms of their recognition, according to the coding characteristics of convolutional codes. The 1/2 bit rate convolutional code recognition algorithm can be extended to 1 / n rate convolutional code for 1 / n rate convolutional code. Euclidean algorithm is used to estimate the generating matrix of 1 / n bit rate, and the fault-tolerant performance is good. According to the concept of equivalent generation matrix of convolutional codes, the parameter estimation of system convolutional codes is extended to k / n convolutional codes. The algorithm is solved by kernel space. According to the characteristics of convolutional codes at different bit rates, the overall recognition algorithm of convolutional codes is proposed, and the slave code length of convolutional codes at arbitrary rate is realized. The recognition method of concatenated code is discussed. Because there is no related recognition algorithm for concatenated code at present, it is before the recognition of concatenated code. Firstly, the coding characteristics and codeword characteristics of concatenated codes are studied, and then a concatenated code recognition algorithm is proposed according to the characteristics of concatenated codes. The algorithm can effectively identify the internal code parameters of concatenated codes. The detection probability is still above 90% when the BER is 0.005. The phase ambiguity problem in the actual mapping is studied. This paper discusses the effect of mapping on parameter identification, studies an algorithm for uniform recognition of mapping and coding types and coding parameters, and considers the effect of phase ambiguity on coding parameters in mapping. The joint estimation of mapping relation and coding parameters is realized, which ensures the accuracy of the parameters in the actual channel coding parameter estimation.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN911.22

【參考文獻(xiàn)】

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

1 王磊;胡以華;王勇;陳曉虎;;基于碼重分布的系統(tǒng)循環(huán)碼識別方法[J];計算機(jī)工程與應(yīng)用;2012年07期

，

本文編號：1415726