Does FFT method input argument have to be power of 2, i.e, $2^n$
I just realized there are many algorithm for FFT implementation, is there any algorithm that takes arbitrary amount of samples as input argument?
if yes, what is their advantages amongst each other? namely, what algorithm does Matlab apply?
Wednesday, October 30, 2019
matlab - FFT method input argument have to be $2^n$ ?
Subscribe to:
Post Comments (Atom)
digital communications - Understanding the Matched Filter
I have a question about matched filtering. Does the matched filter maximise the SNR at the moment of decision only? As far as I understand, ...
-
Moderator's note: As with all discussions of Jewish law on this site, any information included in this question or its answers is presen...
-
Are there any statistics as to what percentage of Chabad still believes that their Rebbe is the Messiah? Is it the majority or simply a very...
-
I know (from a friend who attends) that the Maimonides, the school founded by R' Soloveitchik, observes Thanksgiving. Did the Rav, or an...
No comments:
Post a Comment