function?[Xk]=DFT（xnN）
xxn=zeros（1N）;
xxn（[1:length（xn）]）=xn;?%構造長度為N的序列
Xk=ones（1N）;
Wn=exp（-j*2*pi/N）;
wn=ones（NN）;
for?k=0:1:N-1
????for?n=0:1:N-1
????????wn（k+1n+1）=Wn^（k*n）;
????end
end
Xk=（wn*xxn‘）‘;

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件????????231??2011-04-25?20:40??DFT\DFT.m

?????文件????????121??2011-04-25?20:30??DFT\FT.m

?????文件????????171??2011-04-25?14:24??DFT\IDFT.m

?????文件????????408??2011-04-25?20:52??DFT\zuoye1.m

?????文件????????636??2011-04-25?21:07??DFT\zuoye2.m

?????文件??????30887??2011-04-25?21:13??DFT\作業1.jpg

?????文件??????48331??2011-04-25?21:13??DFT\作業2.jpg

?????目錄??????????0??2011-08-05?20:43??DFT

-----------?---------??----------?-----??----

????????????????80785????????????????????8