深空通信中喷泉码编译码算法分析-analysis of fountain codes coding algorithm in deep space communication.docxVIP

哈尔 哈尔滨工业大学工程硕士学位论文 II II Abstract Deep Space Communication has the characteristic of high bit error, large propagation delay. Fountain codes can be applied in the case of unknown channel state. According the channel conditions, the fountain codes automatically adjust the code rate, which is called rateless code. The characteristics of rateless code make fountain code more suitable in deep space communication than other channel codes. Based on the background of deep space communication, this paper make contribution to the theory of encoding and decoding of fountain codes, the main research results are as follows: First of all, the research and development process of fountain codes are introduced. The detailed encoding and decoding process of LT codes and Raptor codes are given. The advantages and disadvantages of the belief propagation and Gaussian elimination decoding algorithm are respectively analyzed. Secondly, research and optimization of the LT codes are studied. From the perspective of LT encoder, in the view of the traditional LT encoding matrix may exist the short loop, the PEG algorithm is proposed to increase the girth of the generation matrix, which result in the reducing of the decoding failure probability. From the perspective of the LT decoder, in the view of error propagation in the AWGN channel, a improved Message Propagation algorithm is put forward, which make full use of the soft information received by the receiver and employ the iterative. The decoding performance under AWGN channel are improved. Finally, research of the Raptor code using in the deep space communication are studied. Two system model are proposed, which is package erase model and bit correction model. The encoding and decoding method of the Raptor code in the HYPERLINK /s?wd=erasure%20channel erasure channel and AWGN channel are studied. Build the deep space communication platform for the simulation of the encoding and decoding algorithm. Under the erasure channel, with the incr