Research Article
A Low Complexity Near-Optimal MIMO Antenna Subset Selection Algorithm for Capacity Maximisation
Table 5
Complexity break-up of Gharavi-Alkhansari and Gershman algorithm [
11].
| Sl. no. | Algorithm statements | Complex flops required | Real flops required |
| 1 | | | | 2 | | | |
| 3 | for to | 2 | | 4 | | 5 | end |
| 6 | for to | | | 7 | | | | 8 | | | | 9 | | | | 10 | If | | |
| 11 | | | |
| 12 | | | |
| 13 | for all | | | 14 | | 15 | end | 16 | end | 17 | end |
| 18 | | | |
|
|