Research Article
A Low Complexity Near-Optimal MIMO Antenna Subset Selection Algorithm for Capacity Maximisation
Table 1
Pseudostatements and complexity details of the proposed algorithm.
| Sl. no. | Algorithm statements | Complex flops required | Real flops required |
| 1 | | | | 2 | if | 3 | for to | 4 | | 5 | end |
| 6 | if | | |
| 7 | for to | | | 8 | for to | 9 | if | 10 | | 11 | | 12 | end | 13 | end | 14 | end |
| 15 | for to | 16 | | 17 | if | 18 | | 19 | | 20 | else | 21 | | 22 | | 23 | end | 24 | end | 25 | else | 26 | | 27 | | 28 | end | 29 | | 30 | end |
|
|