Research Article
A Low Complexity Near-Optimal MIMO Antenna Subset Selection Algorithm for Capacity Maximisation
Table 6
Complexity break-up of Molisch et al. algorithm [
6].
| Sl. no. | Algorithm statements | Complex flops required | Real flops required |
| 1 | | | |
| 2 | for to | | | 3 | | 4 | end |
| 5 | for to | | | 6 | for to | 7 | if | 8 | | 9 | end | 10 | end | 11 | end | 12 | for to | 13 | | 14 | if | 15 | | 16 | | 17 | else |
| 18 | | | | 19 | | | | 20 | end | | | 21 | end | | | 26 | | | |
|
|