[問題] FFT請教
小弟現在用C在寫FFT函數，有在網路上發現到一段程式碼，擷取下來後發現是可以用的
但我仔細看了該段程式碼發現它的程式碼裡面並沒有用到sin和cos去做FFT轉換，
所以想請教對FFT原理有研究的大大能否幫我說明一下該段程式碼為何沒有用sin和cos
就可以做FFT轉換，以下是該段程式碼內容。感謝大家
/*
This computes an in-place complex-to-complex FFT
x and y are the real and imaginary arrays of 2^m points.
dir = 1 gives forward transform
dir = -1 gives reverse transform
*/
short FFT(short int dir,long m,double *x,double *y)
{
long n,i,i1,j,k,i2,l,l1,l2;
double c1,c2,tx,ty,t1,t2,u1,u2,z;
/* Calculate the number of points */
n = 1;
for (i=0;i<m;i++)
n *= 2;
/* Do the bit reversal */
i2 = n >> 1;
j = 0;
for (i=0;i<n-1;i++) {
if (i < j) {
tx = x[i];
ty = y[i];
x[i] = x[j];
y[i] = y[j];
x[j] = tx;
y[j] = ty;
}
k = i2;
while (k <= j) {
j -= k;
k >>= 1;
}
j += k;
}
/* Compute the FFT */
c1 = -1.0;
c2 = 0.0;
l2 = 1;
for (l=0;l<m;l++) {
l1 = l2;
l2 <<= 1;
u1 = 1.0;
u2 = 0.0;
for (j=0;j<l1;j++) {
for (i=j;i<n;i+=l2) {
i1 = i + l1;
t1 = u1 * x[i1] - u2 * y[i1];
t2 = u1 * y[i1] + u2 * x[i1];
x[i1] = x[i] - t1;
y[i1] = y[i] - t2;
x[i] += t1;
y[i] += t2;
}
z = u1 * c1 - u2 * c2;
u2 = u1 * c2 + u2 * c1;
u1 = z;
}
c2 = sqrt((1.0 - c1) / 2.0);
if (dir == 1)
c2 = -c2;
c1 = sqrt((1.0 + c1) / 2.0);
}
/* Scaling for forward transform */
if (dir == 1) {
for (i=0;i<n;i++) {
x[i] /= n;
y[i] /= n;
}
}
return(TRUE);
}
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.116.75.201
→
02/21 15:53, , 1F
02/21 15:53, 1F
→
02/21 15:55, , 2F
02/21 15:55, 2F
→
02/21 18:31, , 3F
02/21 18:31, 3F
→
02/21 18:32, , 4F
02/21 18:32, 4F
→
02/21 18:42, , 5F
02/21 18:42, 5F
→
02/21 18:43, , 6F
02/21 18:43, 6F
→
02/21 23:09, , 7F
02/21 23:09, 7F
討論串 (同標題文章)