// 采用蝶形算法进行快速傅里叶变换
for(k = 0; k < r; k++)
{
for(j = 0; j < 1 << k; j++)
{
bfsize = 1 << (r-k);
for(i = 0; i < bfsize / 2; i++)
{
p = j * bfsize;
X2[i + p] = X1[i + p] + X1[i + p + bfsize / 2];
X2[i + p + bfsize / 2] = (X1[i + p] - X1[i + p + bfsize / 2])
* W[i * (1<<k)];
}
}
X = X1;
X1 = X2;
X2 = X;
}
————————————
其中
X2[i + p] = X1[i + p] + X1[i + p + bfsize / 2];
X2[i + p + bfsize / 2] = (X1[i + p] - X1[i + p + bfsize / 2])
* W[i * (1<<k)];
这两句不太明白,看蝶形图,不是应该
X2[i+p] = X1[i+p] + x1[i+p+bfsize/2]*W;
X2[i + p + bfsize / 2] = X1[i + p] - X1[i + p + bfsize / 2]*W;
哪位大神能帮帮看下，初学，分少