




全文预览已结束
下载本文档
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
根据fir滤波器的公式y(n)=h(m)x(n-m);(m: 0(N-1).利用MATLAB产生滤波器系数(h(n)并归一化,下面为一个LP滤波算法void filter(void)uint16 i,j;fp32 sum;int16 x12030;fp32 h19= -0.0027, -0.0025, 0.0050, 0.0157, -0.0000, -0.0471, -0.0482, 0.0838, 0.2953, 0.4013,0.2953, 0.0838, -0.0482, -0.0471, -0.0000,0.0157, 0.0050, -0.0025, -0.0027;for(i=0;i2020;i+)x1i = data0i;for(i=0;i2020;i+)sum=0.0;for(j=0;j= j)sum+=hj*x1i-j;else;data0i=(int16)sum;for(i=0;i2000;i+)data0i = data0i+20;考虑到前19个点为不完全累加和,故抛去前19个点。(应该是前后各18个点都是不完全累加和,都应该去掉,对于数据分段进入滤波器的情况,应该把前一段的后面数据放到下一段的前面,这段时间我在解调FSK时遇到了这个问题,通过滤波器的数据的分段处理。)设输入数据xN,输出数据yN,滤波器系数hn1.直接法(由y(m)=h(0)*x(m)+h(1)*x(m-1)+.+h(N-1)*x(m-n-1);void fir(short x, short h, short y) int i,j; long long sum; for (j = 0; j N; j+) sum = 0; for (i = 0; i 15; 乘法器使用次数:N*n2.逆推法:void fir(short x, short h, short y) int i,j; long sum; for (j = 0; j n; j+) for (i = 0; i 15; 乘法器使用次数:N*n3.倒序法:(输入输出可以是同一量)void fir(short x, short h, short y) int i,j; long long sum; for (j = N; j 0; j-) sum = 0; for (i = n; i 0; i-) sum += xj-i * hi; yj = sum 15; #include #include #define true 1#define false 0#define n 8#define bufsize 100 /* the buffer size is 100 */* global declarations */int in_bufferbufsize; /* processing data buffers */int out_bufferbufsize;/* functions */static int processing(int *input, int *output);static void dataio(void);static long round(long a);void main() int *input = &in_buffer0; int *output = &out_buffer0; puts(the 1st experiment startedn); /* loop forever */ while(true) /* * read input data using a probe-point connected to a host file. * write output data to a graph connected through a probe-point. */ / read the input signal. / if the input file is sine1.dat, the signal contains 300hz,400hz and 500hz. / if the input file is sine2.dat, the signal contains 100hz,400hz and 500hz. / the sampling frequency is 1200hz. dataio(); /* remove the frequency compoment of 400hz and 500hz*/ processing(input, output); / write the output signal. / the output file is result.dat. dataio(); /* * = processing = * * function: apply a low-pass fir filter to input signal and remove the frequency higher than 350hz. * * parameters: address of input and output buffers. * * return value: true. */static int processing(int *input, int *output) int i,size = bufsize; short xx0,x,y; / short zn=0,0,0,0,0,0,0,0,0; short zn=0,0,0,0,0,0,0,0;/short w2*n+1=22,356,155,990,466,220,777,216,777,26,466,9,155,0,22;/short w2*n+1=6,457,56,1024,224,418,523,382,784,99,784,43,523;/ short w2*n+1=330*2,3299*2,1982*2,6867*2,4955*2,1594*2,6607*2,1065*2,4955*2,109*2,1982*2,17*2,330*2; /short w2*n+1=661,6598,3964,13733,9910,3187,13214,2131,9910,217,3964,34,661; / short w2*n+1=58,5628,526,8192,2105,5883,4913,3829,7369,1543,7369,504,4913,102,2105,14,526,1,58; /short w2*n+1=28,4432,280,8192,1259,4883,3356,3975,5873,1509,7048,644,5873,142,3356,30,1259,3,280,0,28; / short w2*n+1=26,651,182,1024,545,421,909,247,909,51,545,11,182,1,26;/short w2*n+1=831,20846,5815,32768,17445,13486,29075,7888,29075,1647,17445,349,5815,21,831;/short w2*n+1=208,5211,1454,8192,4361,3371,7269,1972,7269,412,4361,87,1454,5,208; short w2*n+1=101,4356,810,8192,2835,3403,5670,2517,7088,605,5670,193,2835,21,810;/ short w2*n+1=101,4356,810,8192,2835,3403,5670,2517,7088,605,5670,193,2835,21,810,2,101; / short w2*n+1=50,3814,454,8192,1815,3504,4235*,3084,6353,831,6353,349,4235,50,1815,8,454,0,50; long y0,z0;/22222222222222 while(size-) xx0=*input+; x=xx0*6; z0=(long)x15; y0=0; for(i=0;i15); y0=round(y0); for(i=n-1;i0;i-) zi=zi-1; z0=round(z0); z0=(short)(z015); y=(short)(y015); *output+ =y; /* additional processing load */ return(true);/* * = dataio = * * function: read input signal an
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
评论
0/150
提交评论