堆叠式OSTBC：错误性能和错误率分析
Stacked OSTBC: Error Performance and Rate Analysis
摘要：
众所周知，Alamanti方案是来自正交设计的唯一空时码，其实现了具有n_T=2个发射天线和n_R=1个接收天线的多输入多输出（MIMO）无线通信系统的容量。本文提出了一种n次堆叠Alamanti方案，用于n_T=2n个发射天线，并证明了该方案在n_R=1个接收天线的情况下达到了该容量。这一结果可以看作是Alamanet案的推广。对于更一般的情况下，一个以上的接收天线，我们表明，如果发射天线的数量高于接收天线的数量，我们实现了高部分的容量与此计划。此外，我们表明，MIMO容量最多是两倍的速率与建议的计划实现所有SNR。我们推导出与此计划实现的速率的下限和上限，并将其与容量的上限和下限进行比较。除了基于相干信道的假设的容量分析，我们分析的出错率性能的堆叠OSTBC与最佳ML检测器和次优格减少（LR）辅助迫零检测器。我们比较了空间复用（SM）和全分集实现方案的堆叠OSTBC的出错率性能。最后，我们通过数值模拟来说明理论结果。
英文摘要：
It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achieving the capacity of a multiple-input multiple-output (MIMO) wireless communication system with n_T=2 transmit antennas and n_R=1 receive antenna. In this work, we propose the n-times stacked Alamouti scheme for n_T=2n transmit antennas and show that this scheme achieves the capacity in the case of n_R=1 receive antenna. This result may regarded as an extension of the Alamouti case. For the more general case of more than one receive antenna, we show that if the number of transmit antennas is higher than the number of receive antennas we achieve a high portion of the capacity with this scheme. Further, we show that the MIMO capacity is at most twice the rate achieved with the proposed scheme for all SNR. We derive lower and upper bounds for the rate achieved with this scheme and compare it with upper and lower bounds for the capacity. In addition to the capacity analysis based on the assumption of a coherent channel, we analyze the error rate performance of the stacked OSTBC with the optimal ML detector and with the suboptimal lattice-reduction (LR) aided zero-forcing detector. We compare the error rate performance of the stacked OSTBC with spatial multiplexing (SM) and full-diversity achieving schemes. Finally, we illustrate the theoretical results by numerical simulations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
