Abstract

This paper considers the problem of user subset (US) selection for minimizing the bit error rate (BER) of multi-user space-time line code (MU-STLC) multiple-input multiple-output systems with fairness-aware per-user power allocation. The optimal selection criterion suitable for MU-STLC transmissions based on zero forcing (ZF) precoding is given and two efficient algorithms are then proposed. First, an incremental search approach is presented for US selection in the MU-STLC systems. The proposed suboptimal solution to BER minimization starts an empty US and adds users one by one, where the low-complexity recursive computation of the block matrix inverse is further performed. Second, by avoiding recurring matrix computations in each incremental procedure of the first algorithm, a more efficient algorithm is developed. It is observed through simulation results that the proposed incremental-based algorithms achieve most US selection gains with very low complexity. In addition, it is demonstrated that when there are <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$N_{T} $ </tex-math></inline-formula> transmit antennas, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$U$ </tex-math></inline-formula> users (each user has 2 receive antennas), and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> selected users, the achievable upper diversity order of the ZF precoding-based MU-STLC systems with optimal US selection is given as <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2(N_{T} -K+1)(U-K+1)$ </tex-math></inline-formula> . The analytical diversity order is well-matched with simulation results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.