Method and device for basic odd-even merge grid unit and surviving path selection construction

Abstract

The embodiment of the invention discloses a basic odd-even merge grid unit and survivor path selection and construction method for performing odd-even merging and sorting on an input path which is not an integer power of 2. The method comprises steps of: adding input paths and marking the positions of the added input paths in order that the number of all input paths is equal to the integer power of 2; filling the added input paths with path magnitude values; performing odd-even merging and sorting according to the magnitude values of all the input paths in order to obtain sorted input paths; deleting the input paths with marked positions in the sorted input paths to obtain the residual input paths; and linking the residual paths in the residual input paths and using the link as the input of a basic comparison exchange unit.

Description

technical field [0001] The invention relates to a signal detection technology in a multiple input and multiple output (Multiple Input and Multiple Output, MIMO for short) system, in particular to a basic parity merged grid unit. Background technique [0002] In the MIMO system, the transmitting end uses multiple antennas to transmit signals, and similarly, the receiving end uses multiple antennas to receive signals. [0003] Among them, the received signal can be expressed as: [0004] r=Hs+n (Formula 1) [0005] where H is n R ×n T of (assuming n R ≥n T ) channel state matrix, r is n R ×1 received signal vector, s is n T ×1 transmit signal vector, n is n R The mean value of ×1 dimension is 0, and the variance is σ 2 Additive white Gaussian noise vector of . [0006] In signal detection, if the QRM-MLD method is used, for n R ×n T Dimensional channel state matrix H for QR decomposition. get: [0007] H=QR (Formula 2) [0008] where the matrix Q is n R ×n T D...

AI Technical Summary

Problems solved by technology

[0024] In the QRM-MLD tree search process, according to the above method, it is easy to construct a path selection in which the input path measures the number of input paths as an integer power of 2, but in the QRM-MLD tree search process, the existing odd-even merge sort When the grid is used for surviving path selection, when the number of input paths is not an integer power of 2 or the number of sorted paths in the two groups is not equal, the use of traditional odd-even merge sorting grids is greatly limited in specific mobile communication systems

Images