Table 3 Computational complexity for the combination step per node per time instant
From: Adaptive link selection algorithms for distributed estimation
Algorithms | Multiplications | Additions |
|---|---|---|
ES–LMS/RLS | \(M(t+1){\frac {|\mathcal {N}_{k}|!}{t!(|\mathcal {N}_{k}|-t)!}}\) | \(Mt{\frac {|\mathcal {N}_{k}|!}{t!(|\mathcal {N}_{k}|-t)!}}\) |
SI–LMS/RLS | \((2M+4)|\mathcal {N}_{k}|\) | \((M+2)|\mathcal {N}_{k}|\) |