Asset Details
Do you wish to reserve the book?
Efficient Transmit Antenna Subset Selection for Multiuser Space–Time Line Code Systems
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Efficient Transmit Antenna Subset Selection for Multiuser Space–Time Line Code Systems
Do you wish to request the book?
Efficient Transmit Antenna Subset Selection for Multiuser Space–Time Line Code Systems
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Efficient Transmit Antenna Subset Selection for Multiuser Space–Time Line Code Systems
2021
Overview
We consider the problem of the efficient transmit antenna subset (TAS) selection for maximizing the signal-to-interference-plus-noise ratio (SINR) of multiuser space–time line code (MU–STLC) systems. The exhaustive search for optimal TAS selection is impractical since the total number of transmit antennas increases. We propose two efficient TAS selection schemes based on the Woodbury formula. The first is to incrementally select NS active transmit antennas among the available NT transmit antennas. To reduce the complexity of the incremental selection scheme, the Woodbury formula is employed in the optimization process. The second is to perform the decremental strategy in which the Woodbury formula is also applied to develop the low-complexity TAS selection procedure for the MU–STLC systems. Simulation results show that the proposed incremental and decremental TAS selection algorithms offer better alternatives than the existing greedy TAS selection algorithm for the MU–STLC systems. Furthermore, in terms of bit error rate, the proposed minimum mean square error decremental TAS selection algorithm turns out to outperform the existing greedy algorithm with significantly lower computational complexity. Finally, we analyze the detection SINR penalty experienced from TAS selection and the analytical quantity is shown to be well matched with simulation results.
Publisher
MDPI AG,MDPI
