FFT算法实现_DIT.docxVIP

FFT算法实现——DIT源代码1：function X = FFT_func1( x )%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%没有用bitrevorder命令%%%%%%%%%%%%%%%%%%%%%x_1=load(data.txt);N=length(x_1);M=ceil(log2(N));%如果N不等于2＾M，zero-paddingx=zeros(2^M);N=2^M;for ii=1:length(x_1) x(ii)=x_1(ii);endif M==0 %if语句为考虑特殊情况M==0,即只有一个点做变换 y=0;elsea=zeros(N,M); for jj=1:M for kk=1:(N/(2^(jj-1))) if mod(kk,2)==0 a(((kk-1)*2^(jj-1)+1):kk*2^(jj-1),jj)=1; end endendfor i=1:M b(i)=2^(M-i);endy=a*b; end%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%XX=zeros(N,M+1);for nn=1:N %for循环得出倒序后的x[n],并令之为XX的第一列 XX(nn,1)=x(y(nn)+1);endif M==0 X=x;elsefor m=2:M+1 w=exp(-1i*2*pi/(2^(m-1)));%w为旋转因子 for p=0:2^(M-m+1)-1 for n=1:2^(m-2) XX(n+p*2^(m-1),m)=XX(n+p*2^(m-1),m-1)+XX(n+p*2^(m-1)+2^(m-2),m-1)*w^(n-1); XX(n+p*2^(m-1)+2^(m-2),m)=XX(n+p*2^(m-1),m-1)-XX(n+p*2^(m-1)+2^(m-2),m-1)*w^(n-1); end endendendX=XX(:,M+1); %X为XX的最后一列K=0:N-1; %作图stem(K,abs(X));grid onend源代码2：function X = FFT_recome( x )%%%%%%%%%%%%%%%%%%%%%%用了bitrevorder命令的%%%%%%%%%%%%%%%%%%%%%%%%%x_1=load(data.txt);N=length(x_1);M=ceil(log2(N)); %如果N不等于2＾M，zero-paddingN=2^M;x=zeros(N);for ii=1:length(x_1) x(ii)=x_1(ii);endx1=0:N-1;y=bitrevorder(x1);XX=zeros(N,M+1);for nn=1:N%for循环得出倒序后的x[n],并令之为XX的第一列 XX(nn,1)=x(y(nn)+1);endif M==0 X=x;elsefor m=2:M+1 w=exp(-1i*2*pi/(2^(m-1))); %w为旋转因子 for p=0:2^(M-m+1)-1 for n=1:2^(m-2) XX(n+p*2^(m-1),m)=XX(n+p*2^(m-1),m-1)+XX(n+p*2^(m-1)+2^(m-2),m-1)*w^(n-1); XX(n+p*2^(m-1)+2^(m-2),m)=XX(n+p*2^(m-1),m-1)-XX(n+p*2^(m-1)+2^(m-2),m-1)*w^(n-1); end endendendX=XX(:,M+1); %X为XX的最后一列K=0:N-1; %作图stem(K,abs(X));grid onend实验结果：data.txt为与FFT_func1.m和FFT_recome.m同目录下的文件，即为x[n]；两个程序的结果相同，都经过MATLAB中fft函数的验证，且结果正确。以下为两个例子结果：（1）取x[0]到x[N-1]依次为1 1 1 2 3 4 5 6 7 8，N=10，补零直到16个点X[k]: 38.0000 -21.6042 -12.4032i 11.3640 + 3.2929i -6.2987 + 1.9773i 5.0000 - 5.0000i -0.0444 + 4.4626i -1.3640 - 4.7071i 3.9474 + 2.0820i