设x(n)={1,0.5,0,0.5,1,1,0.5,0),用FFT算法求x(n)的DFT。FFT算法...答:include <stdio.h> include <math.h> include <stdlib.h> define N 1000 /*定义复数类型*/ typedef struct{ double real;double img;}complex;complex x[N], *W; /*输入序列,变换核*/ int size_x=0;/*输入序列的大小,在本程序中仅限2的次幂*/ double PI;/*圆周率*/ void fft();/*...