Channel Scaling-Based Transmit Antenna Selection for 2-Dimensional Rake Combining Spatial Multiplexing UWB MIMO Systems

Low‐complexity transmit antenna selection algorithm exploiting null space in spatial multiplexing UWB MIMO systems

“…This work considers suboptimum antenna selection algorithms for performance comparison, such as norm‐based selection (called NBS), channel scaling‐based selection using singular value decomposition and signal to noise ratio (called SVD‐SNR‐Subopt), and the Gorokhov algorithm .…”

“…Here, only the multiplicative operation in the multiplication of a matrix by a matrix or a vector by a vector is taken into account while other computations are ignored . Thus the complexity of the matrix H T H is O (0.5 N T ( N T + 1) N R L ), which is given in Ref .…”

“…Here, only the multiplicative operation in the multiplication of a matrix by a matrix or a vector by a vector is taken into account while other computations are ignored . Thus the complexity of the matrix H T H is O (0.5 N T ( N T + 1) N R L ), which is given in Ref . Then, the matrix with a lower dimension in Table I can be obtained from the calculation of H T H , without any extra computation.…”

“…It still offers a low computational complexity compared to that of the algorithm presented in Ref , which is given by …”

“…In this work, we consider an SM UWB system with two‐dimensional Rake combiners followed by a zero‐forcing (called 2Rake‐ZF) receiver . In Ref , a channel scaling‐based antenna selection technique was proposed to improve the bit error rate (BER) performance of the 2Rake‐ZF receiver. However, its BER performance does not match that of the optimal selection if the difference in the number of available transmit antennas and the number of selected transmit antennas is more than 1 and/or the number of multiple paths combined in the Rake receiver is small.…”