On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels
On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels
复制标题
频率选择性 MIMO 信道球形译码器的复杂性研究
DOI：
10.1109/tsp.2008.2005745
复制
发表时间：
2008
影响因子：
5.4
通讯作者：
C. Cowan
中科院分区：
文献类型：
--
作者：
L. G. Barbero;T. Ratnarajah;C. Cowan
本文比较了复杂性的球解码器（SD）和以前提出的检测方案，这里表示为块SD（BSD），当它们被应用到检测的多输入多输出（MIMO）系统中的频率选择性信道。这两种算法的复杂度取决于它们的预处理和树搜索阶段。虽然BSD被提出作为一种大大降低SD的预处理阶段的复杂性的手段，但没有研究如何通过减少预处理阶段来影响树搜索阶段的复杂性。本文表明，无论是分析和通过模拟，减少预处理复杂性提供的BSD的副作用，增加其树搜索阶段的复杂性相比，SD，独立的信号噪声比（SNR）。此外，本文展示了如何排序的SD中的频率选择性信道矩阵的列不降低树搜索阶段的复杂性，相反，发生在频率平坦的信道。
This paper compares the complexity of the sphere decoder (SD) and a previously proposed detection scheme, denoted here as block SD (BSD), when they are applied to the detection of multiple-input multiple-output (MIMO) systems in frequency-selective channels. The complexity of both algorithms depends on their preprocessing and tree search stages. Although the BSD was proposed as a means of greatly reducing the complexity of the preprocessing stage of the SD, no study was done on how the complexity of the tree search stage could be affected by that reduced preprocessing stage. This paper shows, both analytically and through simulation, that the reduction in preprocessing complexity provided by the BSD has the side effect of increasing the complexity of its tree search stage compared to that of the SD, independent of the signal-to-noise ratio (SNR). In addition, this paper shows how sorting the columns of the frequency-selective channel matrix in the SD does not reduce the complexity of the tree search stage, contrary to what occurs in frequency-flat channels.