Table 1:
Computational complexity of approximated RLS-CE and WEB-CE algorithms.
Algorithm
Overall number of complex Mul./Add.
Approximated
𝑁
l
o
g
2
𝑁
+
3
𝑁
(Mul.)
RLS-CE
2
𝑁
l
o
g
2
𝑁
+
2
𝑁
(Add.)
WEB-CE
𝑁
l
o
g
2
𝑁
+
3
𝐵
𝑁
(Mul.)
2
𝑁
l
o
g
2
𝑁
+
2
𝐵
𝑁
(Add.)