【摘要】：信道編碼技術(shù)是現(xiàn)代通信系統(tǒng)中廣泛應(yīng)用的技術(shù),糾錯(cuò)碼和擾碼是其中重要的編碼方式。信道編碼的盲識(shí)別技術(shù)是對(duì)編碼參數(shù)的逆向識(shí)別,在通信領(lǐng)域有著重要的應(yīng)用價(jià)值。本文主要圍繞信道編碼的盲識(shí)別算法展開(kāi)研究,完成的工作如下:1)對(duì)信道編碼盲識(shí)別領(lǐng)域一些現(xiàn)有的算法進(jìn)行了研究。對(duì)二進(jìn)制線性分組碼、RS碼、卷積碼和擾碼的一些盲識(shí)別算法的性能表現(xiàn)進(jìn)行了對(duì)比,重點(diǎn)研究了基于線性矩陣分析的盲識(shí)別方法,基于Walsh-Hadamard變換的含錯(cuò)方程求解算法,以及基于OMP算法的卷積碼識(shí)別算法,完成算法的MATLAB仿真,并進(jìn)行了基于TMS320C6678DSP的實(shí)現(xiàn),驗(yàn)證了算法在硬件平臺(tái)上的正確性。2)本文在伽羅華域傅里葉變換(Galois Field Fourier Transform,GFFT)法的基礎(chǔ)上,研究一種改進(jìn)的RS碼盲識(shí)別方案。該方法避免了在未知碼長(zhǎng)時(shí)對(duì)接收序列遍歷進(jìn)行GFFT的大量計(jì)算,且有較好的抗誤碼性能。3)針對(duì)低信噪比情況下自同步擾碼的識(shí)別問(wèn)題,提出了基于軟判決求解含錯(cuò)方程的盲識(shí)別方法,主要通過(guò)提取軟判決序列中比特的可靠度信息,來(lái)尋找真正的擾碼多項(xiàng)式。仿真實(shí)驗(yàn)表明,相比于基于硬判決的Walsh-Hadamard變換算法,該方法在低信噪比下的容錯(cuò)性能較好。4)針對(duì)自同步擾碼器的輸入序列為RS碼的情況,研究一種自同步擾碼的盲識(shí)別算法。該方法先識(shí)別出RS碼的等價(jià)分組碼長(zhǎng),再遍歷可能的多項(xiàng)式對(duì)擾碼序列進(jìn)行抽取,引入一種新的零元素熵函數(shù)差值來(lái)識(shí)別擾碼多項(xiàng)式。仿真驗(yàn)證了該算法可以對(duì)RS碼的自同步擾碼進(jìn)行有效的盲識(shí)別。
[Abstract]:Channel coding technology is widely used in modern communication systems, error correction codes and scrambling codes are important coding methods. The blind recognition technique of channel coding is the reverse recognition of coding parameters, which has important application value in the field of communication. This paper mainly focuses on the blind recognition algorithm of channel coding. The work accomplished is as follows: 1) some existing algorithms in the field of channel coding blind recognition are studied. The performance of some blind recognition algorithms of binary linear block code, RS code, convolutional code and scrambling code are compared. The blind identification method based on linear matrix analysis and the algorithm of solving error-containing equation based on Walsh-Hadamard transform are studied. And the convolutional code recognition algorithm based on OMP algorithm, complete the MATLAB simulation of the algorithm, and based on the implementation of TMS320C6678DSP, verify the correctness of the algorithm on the hardware platform. 2) this paper in the Galois domain Fourier transform (Galois Field Fourier Transform, Based on GFFT method, an improved blind recognition scheme for RS codes is studied. This method avoids a large amount of GFFT computation for receiving sequence traversal when the code length is unknown, and has good anti-error performance. 3) for the problem of self-synchronization scrambling code recognition under low SNR, the proposed method can be used to solve the problem of self-synchronization scrambling code in the presence of low signal to noise ratio (SNR). A blind recognition method based on soft decision to solve the error-containing equation is proposed. The real scrambling polynomial is found by extracting the reliability information of bits in the soft decision sequence. Simulation results show that compared with the Walsh-Hadamard transform algorithm based on hard decision, this method has better fault-tolerant performance at low SNR. 4) for the case that the input sequence of the self-synchronous scrambler is RS code, A blind recognition algorithm for self-synchronous scrambling codes is studied. In this method, the equivalent block length of RS codes is recognized first, then the scrambling sequences are extracted by traversing possible polynomials, and a new difference of zero element entropy function is introduced to identify scrambling polynomials. Simulation results show that the algorithm can be used for blind recognition of self-synchronous scrambling codes of RS codes.
【學(xué)位授予單位】：南京理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN911.22

【參考文獻(xiàn)】

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

1 呂全通;張e，

本文編號(hào)：2398321