Does fft() always require 2^n sample points?
8 次查看(过去 30 天)
显示 更早的评论
Hi, Does FFT always require 2^n? why is that? Thank you.
0 个评论
采纳的回答
Azzi Abdelmalek
2013-2-21
编辑:Azzi Abdelmalek
2013-2-21
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 个评论
Surendra Maharjan
2019-4-3
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.
更多回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Fourier Analysis and Filtering 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!