OPTIMIZED GAUSS AND CHOLESKY ALGORITHMS FOR USING THE LMMSE DECODER IN MIMO/BLAST SYSTEMS WITH FREQUENCY-SELECTIVE CHANNELS: Reduced-complexity Equalization

摘要

The LMMSE (Linear Minimum Mean Square Error) algorithm is one of the best linear receivers for DSCDMA (Direct Sequence-Code Division Multiple Access). However, for the case of MIMO/BLAST (Multiple Input, Multiple Output/Bell Laboratories Layered Space Time), the perceived complexity of the LMMSE receiver is taken as too big, and thus other types of receivers are employed, yielding worse results. In this paper, we investigate the complexity of the solution to the LMMSE and the Zero-Forcing (LMMSE without noise estimation) receiver's equations. It will be shown that the equation can be solved with optimized Gauss or Cholesky algorithms. Some of those solutions are very computationally efficient and thus, allow for the usage of the LMMSE in fully-loaded MIMO systems.