| 摘要 |
MIMO detection is described that reduces the complexity of computations for finding the soft bit output. The detection process includes QR factorization splitting the distance calculations into two groups, subset lookup using a last cross constellation set (LCCS) lookup, and minimal distance lookup with soft bit output calculation. By grouping the distance calculations into a first group that has one antenna transmitting using a modulation scheme with a generally square constellation diagram and a second group for all of the other antenna constellation diagrams, the LCCS lookup process may be used which substantially reduces the number of calculations to be made in the detection process. Moreover, in the special case of 2×2 antenna, QR factorization is performed by applying a scaled Givens rotation to the channel matrix. The application of the scaled Givens rotation operator eliminates any square root operations that would be performed in a standard QR factorization. |
