The computational complexity of filter bank structures can be evaluated by calculating the number
of real multiplications and additions that are necessary to compute a new length-M complex-valued
output sequence. However, our analysis is just based on the number of multiplications because it is
a known fact that adders are considerably cheaper to implement than multipliers.
For OFDM, it is only consist IFFT anf FFT
引用格式
Mahmoud Aldababsa (2026). Computational complexity (https://ww2.mathworks.cn/matlabcentral/fileexchange/43707-computational-complexity), MATLAB Central File Exchange. 检索时间: .
