60GHz 室内信道下一种快速天线选择算法

    A Fast Antenna Selection Algorithm in 60GHz Indoor Channels

    • 摘要: 传统的基于信道容量最大化准则的天线选择算法虽然使信道容量达到了最大化,但是计算复杂度很高。针对计算复杂度高的问题, 提出了一种基于Doolittle-QR 分解的低复杂度天线选择算法。该算法基于Doolittle-QR 分解,可以快速选择出使系统容量最大化的天线。与传统的天线选择算法相比,该算法的计算复杂度不仅有效地降低了, 而且容量性能相近。在60GHz 室内信道下,仿真实验结果表明, 该算法具有良好的容量性能,优于随机天线选择算法,接近最优天线选择算法。

       

      Abstract: Based on channel capacity maximization criterion, traditional antenna selection algorithm scan maximize the channel capacity, but the computational complexity is very high. Aimed at the problem of high computational complexity, a new antenna selection algorithm with low complexity based on Doolittle-QR decomposition is proposed. Based on Doolittle-QR decomposition, the proposed antenna algorithm can quickly select the antenna which can maximize the system capacity. Compared to the traditional antenna selection algorithms,the computational complexity of the proposed antenna algorithm is effectively reduced, and the capacity performance is close to the traditional methods. In 60GHz indoor channels, simulation results demonstrate that the proposed antenna algorithm enjoys favorable performance,which is better than that of the random antenna selection algorithm and close to the optimal antenna algorithm.

       

    /

    返回文章
    返回