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
Citation pour cette source
Mahmoud Aldababsa (2024). Computational complexity (https://www.mathworks.com/matlabcentral/fileexchange/43707-computational-complexity), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.1.0.0 | correction the order of ploting the function with text related in legend |
||
1.0.0.0 |