快速傅立叶变换对信号频谱的分析 c语言（Analysis of the fast Fu Liye transform of the signal spectrum of the C language）.doc

下载文档 降价啦

19
0
约3.61千字
约 14页
2017-08-21 发布于河南
举报
版权申诉
保障服务

快速傅立叶变换对信号频谱的分析 c语言（Analysis of the fast Fu Liye transform of the signal spectrum of the C language）.doc

1、本文档共14页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

快速傅立叶变换对信号频谱的分析 c语言（Analysis of the fast Fu Liye transform of the signal spectrum of the C language）

快速傅立叶变换对信号频谱的分析 c语言（Analysis of the fast Fu Liye transform of the signal spectrum of the C language） # 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