Research And Application Of Coding And Testing Technology MIMO Communication System Intervention

The pre-coding technology used in MIMO communication system can make full use of spatial resource, and advanced detection technology used in MIMO communication system can improve the performance of the system.Firstly, in this paper, the principle of pre-coding technology and its application in the multidirectional communication are elaborated and studied. Pre-coding is an Adaptive transmission technology. According to the information of the channel, the sender obtains a pre-coding matrix in accordance with certain criteria. Pre-coding includes the linear pre-coding and non-linear pre-coding. The linear pre-coding includes the pre-coding based on codebook and the pre-coding based on non-codebook. This paper elaborates the pre-coding technique in multi-directional communication,and proposes beam forming network coding based on the pre-coding, space-time network coding based on the pre-coding and space-division multiplexing network coding based on the pre-coding.This paper simulates their performances,and analysis theirs performance. The experimental result shows that ST-NC has the best performance, the SP-NC has the worst performance, and BM-NC has compromise performance.Secondly, This paper elaborates signal detection algorithms for MIMO communication system and simulates the performance of these algorithms, and analyses the complexity of the algorithms.There are the ML detector, linear detection, the sphere detection and iterative detection algorithm. Linear detection algorithm includes ZF and MMSE algorithm. Iterative detection algorithm includes Gibbs sampling algorithm based on MCMC and RS algorithm. These algorithms are simulated, and the results show that the ML algorithm has the best performance, but its complexity is that the number of transmit antennas and the modulation order of the exponential growth. SD algorithm performance,which is in low SNR, the bit error rate, is similar to the ML algorithm,and the complexity of the search tree node is the form of the polynon:al. RS algorithm has the least complexity, but its bit error rate performance is somewhat less.