Does fft() always require 2^n sample points?

Question

Nina 2013-2-21

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/64423-does-fft-always-require-2-n-sample-points

评论： Surendra Maharjan 2019-4-3

采纳的回答： Azzi Abdelmalek

Hi, Does FFT always require 2^n? why is that? Thank you.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Azzi Abdelmalek 2013-2-21

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/64423-does-fft-always-require-2-n-sample-points#answer_76009

编辑：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 个评论
显示无隐藏无

Nina 2013-2-22

Thank you Azzi, but could you please be kind and clarify what you meant by "at the end you have just to take in account your original samples."? where does that come into play? sorry I am really new to this whole thing so I don't have much background...

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.

请先登录，再进行评论。