Skip to main content

Table 4 Computational complexity per node per time instant

From: Adaptive link selection algorithms for distributed estimation

Algorithm Multiplications Additions
ES-LMS \(\left [{\frac {(t+1)|\mathcal {N}_{k}|!}{t!(|\mathcal {N}_{k}|-t)!}}+8\right ]M+2\) \(\left [{\frac {|\mathcal {N}_{k}|!}{(t-1)!(|\mathcal {N}_{k}|-t)!}}+8\right ]M\)
ES-RLS \(4M^{2}+\left [{\frac {(t+1)|\mathcal {N}_{k}|!}{t!(|\mathcal {N}_{k}|-t)!}}+16\right ]M+2\) \(4M^{2}+\left [{\frac {|\mathcal {N}_{k}|!}{(t-1)!(|\mathcal {N}_{k}|-t)!}}+12\right ]M-1\)
SI-LMS \((8+2|\mathcal {N}_{k}|)M+4|\mathcal {N}_{k}|+2\) \((8+|\mathcal {N}_{k}|)M+2|\mathcal {N}_{k}|\)
SI-RLS \(4M^{2}+(16+2|\mathcal {N}_{k}|)M+4|\mathcal {N}_{k}|+2\) \(4M^{2}+(12+|\mathcal {N}_{k}|)M+2|\mathcal {N}_{k}|-1\)