cuitlc0710的博客

//在此采用的是时间抽选奇偶分解方式，所以在参加运算前首先要对时间序列进行倒序 ReverseOrder(N,pAData); int L=1; while(L<=M) { LE=(int)pow(2.0,L); LE1=LE/2; U.Re=1.0f; U.Im=0.0f; W.Re=(double)cos(PI/(1.0*LE1));//计算W算子的值 W.Im=(double)-1.0*sin(PI/(1.0*LE1)); if(fabs(W.Re)<1.0e-12) W.Re=0.0f; if(fabs(W.Im)<1.0e-12) W.Im=0.0f; J=1; while(J<=LE1) { I=J; while(I<=N) { IP=I+LE1; T.Re=(double)A[IP-1].Re*U.Re-A[IP-1].Im*U.Im;//计算复数运算A*U T.Im=(double)A[IP-1].Re*U.Im+A[IP-1].Im*U.Re; A[IP-1].Re=(double)A[I-1].Re-T.Re;//计算复数运算A-T A[IP-1].Im=(double)A[I-1].Im-T.Im; A[I-1].Re+=T.Re;//计算复数运算A+T A[I-1].Im+=T.Im; I+=LE; } double temp=U.Re; U.Re=(double)U.Re*W.Re-U.Im*W.Im;//计算复数运算U*W U.Im=(double)temp*W.Im+U.Im*W.Re; J++; } L++; } }