Font Size: a A A

Coded Relay Cooperation With High Efficient Channel Codes: Code Constructions And Performance Analysis

Posted on:2017-07-08Degree:MasterType:Thesis
Country:ChinaCandidate:J T XiangFull Text:PDF
GTID:2348330509962940Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the development of modern communication technology, the demand of the quality of communication services rises. How to keep the reliability of communication system and reduce the error probability in system, Which always is the research hotspot. Channel coding technology can reach the aim.Recently, people design and construct many good channel coding method, but these methods can not reach the Shannon limit until appearance of Polar code. Polar code had been proved that can reach the Shannon limit and Its encoding and decoding method has linear complexity, the good performance break new ground in channel coding field.The thesis analyze the encoding and decoding technique of Polar code, mainly studies the relay coded cooperation implement of Polar code, which also compare the performance with the Turbo code coded cooperation system and LDPC code coded cooperation system. This paper mainly research on the following contents together with some innovations:(1)For Turbo-coded cooperation, we study its encoder and iterative decoding algotithm,propose a distributed coding method based on Turbo code and deduce the information sequence construction and the joint iterative decoding algorithm on destination. Finally, we study the performance by simulation result.(2)For LDPC-coded cooperation, we propose a coding method based on Generator-matrix-based LDPC(G-LDPC) and the overall check matrix corresponding to the coded-cooperation system on destination. Besides, we introduce the bilayer Tanner graph, based on which the joint iterative decoding algorithm is proposed. Finally, we use simulation figure to analyze the performance.(3)We analyzes the reasons of polarization phenomenon, and focus on encoding method of Polar code, and research the Upper bound and lower bound of polar code's decoding error probability.Meanwhile, this paper gives a brief analysis and summary of four polar code decoding algorithms--SC?BP?SCL?CA-SCL, and compare their simulation performance on BSC channel?BEC channel and AWGN channel under different conditions.(4)For polar code,on the basis of traditional subchannel select methods, we propose a new method to select subchannel on AWGN channel. This method trys to transform AWGN channel to BSC channel, and select subchannel in BSC channel, which will bring 0.2dB coding gain bysimulation.(5)This paper mainly studies the Plotkin construction of polar code, and how to construct it.Meanwhile, we propose a polar code relay coded cooperation implement based on Plotkin construction, which has more better performance than non-cooperation mode and Nested mode by simulation figure, besides, compared with Turbo code and LDPC code relay coded cooperation implement in the simulation, we display their advantage and disadvantage in detail, final, we draw a conclusion that polar code coded cooperation system will have more better performance than others under the high SNR condition.
Keywords/Search Tags:Polar Code, Turbo Code, G-LDPC, Bilayer Tanner Graph, Coded Cooperation, Plotkin Construction
PDF Full Text Request
Related items