Computational complexity

Computational complexity between FBMC/OQAM and OFDM
1,2K téléchargements
Mise à jour 1 oct. 2013

Afficher la licence

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
Créé avec R2011b
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
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