Computational complexity
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
Cite As
Mahmoud Aldababsa (2024). Computational complexity (https://www.mathworks.com/matlabcentral/fileexchange/43707-computational-complexity), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.