Table 1 Computational complexity of existing and proposed MUD algorithms
Algorithms | Computational complexity (flops) |
|---|---|
Matched filter | \(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p}+6K)-2K\) |
Conventional SIC | \(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p} +18K-12)-4K+2\) |
Conventional PIC | \(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p}+10K+4K^{2})-4K\) |
Linear MMSE receiver | \(8M^{3}+M^{2}(16K-8)+M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p}+4K+4)-2K\) |
Proposed GL-SIC | \(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p}+6K) -2K+{N_{c}^{n}}(20MK-8Mn+4M-2K+2n-2) \) |
Proposed GL-PIC | \(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p} +10K+4K^{2})-4K+N_{c}^{n_{q}}(8MK+8M-2)\) |
Standard likelihood (ML) detector | \(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p}-2K)+{N_{c}^{K}}(8MK+8M-2)\) |