DIT-FFT Digital Signal Processing--DFT/FFT Algorithms X1(k)=DFT[x1(r)]X2(k)=DFT[x2(r)]N/2Points, That is N/2-1 X (k)=>x(r)WN2=DFT[x(r)] r=0 /2-1 X,()=∑ x2(r)WNn2=DFT[x2(r)] r=0 X(k)、X,k)(N/2),And m宁=-n，∴Xk) X(k)=X(k)+WX2()k=0,1,. Xk+当=x-WX,)k=0,1 2 上游充通大粤Digital Signal Processing—— DFT/FFT Algorithms DIT-FFT X1(k)=DFT[x1(r)]、X2(k)=DFT[ x2(r)] N/2Points， That is / 2 1 1 1 / 2 1 0 / 2 1 2 2 / 2 2 0 ( ) ( ) [ ( )] ( ) ( ) [ ( )] N kr N r N kr N r X k x r W DFT x r X k x r W DFT x r           X1 (k)、X2 (k) (N/2)，And ，∴X(k) 2 N k k W W N N    1 2 1 2 ( ) ( ) ( ) 0,1, 1 2 ( ) ( ) ( ) 0,1, 1 2 2 k N k N N X k X k W X k k N N X k X k W X k k           