This lecture is not FFT, I think it is FT. All right??
@Yasu223594 жыл бұрын
Are you saying that, this lecture is focused on FT, (strictly DFT), right? It's true that FFT itself denotes the algorithm which can calculate DFT with O(n log n) complexity, but most people in this field say DFT as FFT in my experience.