Multiuser Space-Time Line Code With Transmit Antenna Selection

IEEE ACCESS(2020)

引用 16|浏览2
暂无评分
摘要
In this paper, a multiuser space-time line code (MU-STLC) scheme is newly designed that concurrently delivers multiple STLC signals to multiple users, and a preprocessing matrix for the MU-STLC is derived based on the minimum mean square error criterion. The novel MU-STLC method retains the conventional STLC receiver structure so that each user linearly combines the received signals without using the full channel state information to decode the STLC signals. With more transmit antennas than the number of users having two receive antennas, a transmit antenna selection (TAS) scheme is investigated in combination with the proposed MU-STLC method, and the detection signal-to-interferenceplus-noise ratio (SINR) is derived depending on a specific TAS pattern. The performance improvement obtained from the TAS is significant, yet finding the optimal TAS pattern is a combinatorial problem that requires prohibitively high computational complexity. To resolve this issue, a greedy TAS algorithm is also proposed that iteratively selects the transmit antenna maximizing the detection SINR in each greedy step. The numerical results verify the efficacy of the proposed MU-STLC system with the SINR-based greedy TAS algorithm in terms of the bit error rate performance and computational complexity. For example, comparing with a scheme that selects four antennas from eight antennas randomly to support four users, the proposed TAS scheme can reduce the required signal-to-noise ratio for achieving 10(-3) bit-error-rate by approximately 6 dB when quadrature phase-shift keying is employed. Furthermore, the proposed method can achieve comparable performance to the optimal antenna selection scheme with the reduced computational complexity by O(M-5) from O(MU+3), where M and U are the numbers of transmit antennas and selected antennas (or users), respectively.
更多
查看译文
关键词
Space-time line code,multiuser,transmit antenna selection,greedy algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要