MIMO receive algorithms
MIMO receive algorithms
复制标题
DOI：
10.1017/cbo9780511616815.016
复制
发表时间：
2006
影响因子：
2.7
通讯作者：
T. Kailath;H. Vikalo;B. Hassibi
中科院分区：
文献类型：
--
作者：
T. Kailath;H. Vikalo;B. Hassibi
多天线无线通信系统中的最优检测问题往往归结为求一个线性方程组的最小二乘解问题，其中未知向量是由整数组成的，而矩阵系数和给定的向量是实数。该问题等价于寻找与给定点最接近的格点，是已知的NP难问题。我们回顾了最常用的求解技术，并讨论了它们的计算复杂性。在启发式算法中，我们重点介绍了零化和抵消技术，以及它们基于线性估计理论的快速实现。然后，我们证明了一种精确的方法，即球形译码算法，在实际系统中通常具有预期的复杂性。我们还描述了利用所谓的软信息的接收器的球解码技术的扩展。
The optimal detection problem in multi-antenna wireless communication systems often reduces to the problem of finding the least-squares solution to a system of linear equations, where the unknown vector is comprised of integers, but the matrix coefficients and the given vector are real-valued. The problem is equivalent to finding the closest lattice point to a given point and is known to be NP-hard. We review the most commonly used solution techniques, and discuss their computational complexity. Among heuristic algorithms, we focus on the nulling and cancelling techniques, and their fast implementations based on linear estimation theory. We then show that an exact method, the sphere decoding algorithm, often has expected complexity implementable in practical systems. We also describe extensions of sphere decoding techniques to receivers that make use of the so-called soft information.