Table 1 Computational complexity of the proposed SO-THP+GMI algorithm
Steps | Operations | FLOPS | Case |
|---|---|---|---|
|  |  |  | (2,2,2)×6 |
1 | G r =U r Σ r [V r (1) V r (0)]H; | \(32R(N_{t}{N_{r}^{2}}\) |  |
| Â | Â | \(+{N_{r}^{3}})\) | 3072 |
2 | \(\boldsymbol {\bar {G}}=\) | \((2{N_{t}^{3}}-2{N_{t}^{2}}\) | Â |
|  | G=(H H H+α I)−1 H H | \(+N_{t}+16N_{R} {N_{t}^{2}})\) | 3822 |
3 | \(\boldsymbol {\bar {G}}_{n}=\bar {\boldsymbol {Q}_{n}}\bar {\boldsymbol {R}_{n}}\) | \(\sum \limits _{r=1}^{R} 16r({N_{t}^{2}} N_{r}\) | Â |
| Â | Â | \( + N_{t} {N_{r}^{2}} +\frac {1}{3} {N_{r}^{3}})\) | 9472 |
4 | \({\boldsymbol {H}_{eff,n}}={\boldsymbol {H}_{n}}\bar {\boldsymbol {Q}_{n}}\boldsymbol {T}_{n}\) | \(\sum \limits _{r=1}^{R} 16r N_{R} {N_{t}^{2}}\) | 20,736 |
5 | \({\boldsymbol {H}_{eff,n}}={\boldsymbol {U}_{n}^{(4)}}{\boldsymbol {\Sigma }_{n}^{(4)}} {{\boldsymbol {V}_{n}}^{(4)}}^{H}\) | \(\sum \limits _{r=1}^{R} 64r(\frac {9}{8}{N_{r}^{3}}+ \) | Â |
| Â | Â | \(N_{t} {N_{r}^{2}}+\frac {1}{2}{N_{t}^{2}} N_{r})\) | 26,496 |
6 | B=lower triangular | Â | Â |
| Â | \(\left (\boldsymbol {D}\boldsymbol {H}\boldsymbol {F}\bullet \text {diag}\left ([\boldsymbol {D} \boldsymbol {H}\boldsymbol {F}]_{rr}^{-1}\right)\right)\) | \( 16N_{R} {N_{t}^{2}}\) | 3456 |
| Â | Â | Â | Total 67,054 |