2D Fast Fourier Transform Matlab Code
2016-08-23
1 0 0
no vote
Other
Earn points
For 2D FFT, it's actually applying 1D FFT to every row of the matrix A. We get A1 and then apply 1D FFT to every column of A1.
In my code, I use recursive algorithm for 1D FFT.
matlab
傅立叶
变换
代码
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment