A novel approach for K-best MIMO detection and its VLSI implementation
A novel approach for K-best MIMO detection and its VLSI implementation
复制标题
一种新的 K-best MIMO 检测方法及其 VLSI 实现
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Wersame H. Ali
中科院分区：
文献类型：
--
作者：
S. Mondal;K. Salama;Wersame H. Ali
由于MIMO检测算法的复杂度是指数级的，因此通常选择K-best算法以实现高效的VLSI实现。这种检测问题通常被视为树搜索问题，其中采用广度优先搜索（BFS）方法，并且在树的每一级仅保留K-最佳分支。K-best BFS的早期VLSI实现已经被报道，但是由于计算许多路径度量，然后在它们之间进行排序以选择K-best，因此它具有固有的速度瓶颈。本文提出了一种适合于VLSI实现的BFS的替代实现方案。为了测试该方法的性能，将其应用于具有64 QAM星座的4X 4 MIMO检测器。结果表明，从球形解码算法小于1 dB的退化。一个单一的螺旋细胞，系统背后的基本块的实施，占据了764平方米的面积，消耗了52.58 μ W的功率0.13妈妈CMOS技术。
Since the complexity of MIMO detection algorithms is exponential, the K-best algorithm is often chosen for efficient VLSI implementation. This detection problem is often viewed as a tree search problem where the breadth first search (BFS) method is adopted and only the K-best branches are kept at each level of the tree. An earlier VLSI implementation of the K-best BFS has been reported, however it has an inherent speed bottleneck due to the calculation of many path metrics and then sorting among them to select the K-best. In this paper an alternative implementation of the BFS is presented, which is suitable for VLSI implementation. To test the performance of this approach it has been applied to a 4X4 MIMO detector with a 64 QAM constellation. The results show less than 1 dB degradation from the sphere decoding algorithm. The implementation of a single spiral cell, the basic block behind the system, occupies a 764 mum2 of area and consumes a 52.58 muw of power a 0.13 mum CMOS technology.