Table 1 Computational complexity of optimum tree-structured analysis/synthesis filter bank
From: Optimum low complexity filter bank for generalized orthogonal frequency division multiplexing
| Â | Total number of multiplications | Total number of additions |
|---|---|---|
Frequency domain implementation | \( \frac{N}{2}{\log}_2M+2N{\log}_2K+\frac{N}{2}{\log}_2N \) | Nlog2M + Nlog2K + Nlog2N |
Time domain implementation | 2N2 − 2NM | \( 2{N}^2-2 NM-\frac{N\log_2K}{2}\left(\ {\log}_2K+1\right) \) |