2010/08/12 by Robert F. H. Fischer, Fischer, Robert F. H.
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1008.2093
arxiv created 2010/08/12 · openalex publication_date 2010/08/12 · arxiv updated 2010/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Over the last years, novel low-complexity approaches to the equalization of MIMO channels have gained much attention. Thereby, methods based on lattice basis reduction are of special interest, as they achieve the optimum diversity order. In this paper, a tutorial overview on LRA equalization optimized according to the MMSE criterion is given. It is proven that applying the zero-forcing BLAST algorithm to a suitably augmented channel matrix (the inverse of the square root of the correlation matrix of the data symbols times the noise variance forms its lower part) results in the optimum solution. This fact is already widely used but lacks a formal proof. It turns out that it is more important to take the correlations of the data correctly into account than what type of lattice reduction actually is used.