資源簡介
自己編寫的FFT算法,可用于理解原理,與matlab自帶的FFT算法進(jìn)行對比,感興趣的同學(xué)可以一起交流。
代碼片段和文件信息
function?y=myfft(x)
%x?is?the?input?sequence
%n?is?the?point?of?fft
M=nextpow2(length(x));%Series?of?Butterfly?operation
N=2^M;
for?m=0:N/2-1%range?of?Rotating?factor?index?
????WN(m+1)=exp(-1i*2*pi/N)^m;%Compute?Rotating?factor
end
A=[xzeros(1N-length(x))];
%The?operation?of?reverse?order?data
J=0;%inversition?of?Decimal?number
for?I=0:N-1
????if?I ????????T=A(I+1);
????????A(I+1)=A(J+1);
????????A(J+1)=T;
????end
%Calculate?an?next?inv
- 上一篇:信道相關(guān)性對信道容量的影響
- 下一篇:MVDR波束形成
評論
共有 條評論