A fast and optimal deterministic algorithm for NP-Hard antenna selection problem

摘要: Existing fast antenna selection algorithms have either low performance gains or they are efficient only for the of particular size sub-matrices. Our motivation to study NP-Hard problem is two-fold. First, we intend propose an optimal algorithm that equally each possible subset cardinality transmit and/or receive antennas. Second, different from any proposed so far, our deterministically increases strength singular values during column selected matrix. This increase in defined by a very tight bound. bound has previously been used analyze efficiency rank approximation algorithms. Hence, procedure as best matrix approximations.