基于树搜索的MIMO检测算法研究-通信与信息系统专业论文.docxVIP

万方数据 万方数据 Abstract Multiple Input Multiple Output (MIMO) can achieve higher capacity using space resource; however, it increases the difficulty of signal detection in the receiver at the same time. Therefore, how to achieve the near-optimal performance with low complexity has been a challenge issue for the detection of MIMO systems. In this paper, several classical detection algorithms, including ML, linear detection and successive interference cancellation for the spatial multiplexing MIMO system are analyzed and studied first, and then the advantages and disadvantages of each method are analyzed by Matlab simulation. After introduces the basic theory of the tree-search detection algorithm, two main tree search algorithms, breadth-first tree search algorithm and depth-first tree search algorithm, are focused on. For the QRD-M algorithm, as a classic breadth-first tree search algorithm, a novel algorithm based on early termination strategy is proposed. Futher a fixed complexity QRDM-OSIC algorithm is proposed. For the SD algorithm, as a classic depth-first tree search algorithm, after giving a method to select the initial radius, a novel algorithm based on rapid contraction function is proposed. Simulation shows that the improved algorithm has achieved expected goal: effectively reduce the computational complexity of the algorithm while maintaining its performance. Keywords: MIMO Reduced Complexity Signal Detection Tree Search Sphere Decoding 目录 第一章 绪论..................................................................................................................... 1 1.1 课题的研究背景和意义.................................................................................... 1 HYPERLINK \l _TOC_250003 1.2 MIMO 检测算法的研究现状 2 1.3 本文的研究内容及结构安排............................................................................ 2 HYPERLINK \l _TOC_250002 第二章 MIMO 信号检测理论基础 5 HYPERLINK \l _TOC_250001 MIMO 技术 5 MIMO 信道模型 5 MIMO 信道容量 6 2.1.3 论文仿真条件..............................