Does fft() always require 2^n sample points?
10 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Nina
le 21 Fév 2013
Commenté : Surendra Maharjan
le 3 Avr 2019
Hi, Does FFT always require 2^n? why is that? Thank you.
0 commentaires
Réponse acceptée
Azzi Abdelmalek
le 21 Fév 2013
Modifié(e) : Azzi Abdelmalek
le 21 Fév 2013
No. any number of samples. Just try it. The algorithm needs 2*n samples to have even samples and odd samples. If you have odd number, you can add a 0 to your samples then use the fft algorithm, at the end you have just to take in account your original samples.
2 commentaires
Surendra Maharjan
le 3 Avr 2019
Dear Nina,
A = [1 2 3 4 5];
B = [1 2 3 4 5 0 0 0];
For example, A is your row matrix, then you can add three zeros to make A into power multiples of 2. So, B has 8 elements. Then, you can perform C = fft(B,[],2),,[] indicates matrix and 2 indicates the fft direction in row.
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Fourier Analysis and Filtering dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!