- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
快速傅立叶变换对信号频谱的分析 C语言(国外英语资料)
快速傅立叶变换对信号频谱的分析 C语言(国外英语资料)
# includes graphics.h
# includes stdio.h
# includes stdlib.h
# includes string.h
# includes conio.h
# includes math.h
const int maxsize = 1600.
const double pi = 3.1416;
const int n = 32;
void ss (double road [], double xi [], int n)
{
int i = 0, j, s1.
float a, b;
for (j = 1; j n; j + +)
{
for (s1 = n / 2; s1 = i; s1 = s1 / 2)
{
i = i - 1.
}
i = i + 1;
if (i j)
{
a = xr [];
bj = xi [];
xi [i] = xi [j].
xr [i] = xr [j].
xr [j] = a;
xi [j] = bj.
}
}
}
void fft (double road [], double xi [], int m, int n)
{int loop1, loop2, loop3,, le1, ip, i = 1;
float wr, wl, tr, i, ur, ur1, iu, ls.
ls = log (n) / log (2).
ss (xr, xl, n);
for (loop1 = 1; loop1 = ls; loop1 + +)
{
ur = 1.0;
iu = 0.0.
the = pow (2, loop1);
le1 = / 2;
wr = cos (pi * m / le1);
wi = - sin (pi * m / le1);
for (loop2 = 0; loop2 le1; loop2 + +)
{
for (loop3 = loop2; loop3 n; loop3 = loop3 +)
(ip = loop3 + le1;
tr = ur * xr [ip] - iu * xi [ip];
i = a * xi [ip] + iu * xr [ip];
xr [ip] = xr (loop3] - t;
xi [ip] = xi (loop3] you.
xr (loop3] = rs + xr (loop3];
xi [loop3] = i + xi [loop3];
}
ur1 = wr * ur iu * wi.
iu = wr * iu + ur * wi.
ur = ur1;}}
if (i = = - 1)
{
for (i = 0; i n; i + +)
{
xr [i] = xr [] / n;
xi [i] = xi [] / n;
}
}
}
void hua (double x [])
{int d = detect, m = vgahi;
initgraph ( d m, );
int i, j;
for (i = 0; i maxsize; i + +)
line (50 + 1, 200 - 100 * x [i], + 51200 - 100 * x [i + 1]).
}
void hua2 (double x [])
{int d = detect, m = vgahi;
initgraph ( d m, );
int i, j;
for (i = 0; i maxsize; i + +)
line (i + as - 10 * x [i], + 10 * x 41200 [i + 1]).
}
void gaoshi ()
{int i, j;
float p, q;
double xx [maxsize];
double xe [maxsize];
double x1 [maxsize];
for (i = 0; i maxsize; i + +)
xx [i] = 0.
printf (输入p \ n);
scanf (% f, p);
printf (输入q \ n);
scanf (% f, q);
for (i = 0; i maxsize; i + +)
{
if (i n)
x1 [i] = exp (- (1 - p) * (s - p) / q).
else
x1 [i] = 0.
}
fft (x 1, xx, 1256).
for (i = 0; i maxsize; i + +)
xe [i] = sqrt (x1 * x1 [i] [i] +
文档评论(0)