Modular Algebraic Precoding Relay System Model Based on Lattice Reduction

According to the existing multi-antenna relay forwarding protocol, the relay matrix can be split into two parts-relay nodes forward and backward filters direct concatenation, then in actual channel matrix design, relay's forward and backward channel conditions are not ideal, which make system bit error rate (BER) performance is poor. Based on this problem, this paper proposes a modular algebraic precoding relay system model based on lattice reduction. At first, this method re-builds the relay's forward and backward channel matrices, which can make the channel satisfy the orthogonality characteristics. Then, a modified equivalent relay channel matrix is precoding, which solves tradition algorithms' poor performance problem when channel orthogonality is not good, and based on this idea, two improved algorithms are proposed. These two new algorithms can achieve better BER performance under poor relay channel conditions, make each user's performance average, and satisfy system fairness requirements. Simulation results show that comparing with tradition algorithms, this paper proposes a relay channel model which is based on the lattice reduction precoding method, it gains a certain bit error performance. Finally, the improved algorithms are compared and analyzed with the sorting-based algorithm. The results show that the proposed algorithms have better performance. Therefore, in order to ensure users fairness, the optimization algorithm can be used instead of the high complexity sorting-based algorithm in the actual system.