博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
noise_process.c
阅读量:6875 次
发布时间:2019-06-26

本文共 3796 字,大约阅读时间需要 12 分钟。

 

#include <math.h>
#include "otdr_const.h"
#include "haar.h"
#include "otdr_bufferfilter.h"

WORD32 windowsize=200;
WORD32 backnum=900;
extern void filter(double *a, double *b, CurveData *data, int n);
void ReverseCurveData(CurveData *pCurveDataIn,CurveData *pCurveDataOut,WORD32 len)
{
WORD32 i;
i=len;
while(i--)
pCurveDataOut[len-(i+1)].y=pCurveDataIn[i].y;
}

void CurveMinusData(CurveData *pCurveDataIn,double data, WORD32 len)

{
WORD32 i=0;
for(i=0;i<len;i++)
pCurveDataIn[i].y=pCurveDataIn[i].y-data;
}

void FilterCurve(WORD32 plsWid, CurveData *pCurveData,const WORD32 len)

{
double a[2] = {0}, b[2] = {0};

NOISE_LPF_BUTTER(plsWid,a,b);

filter(a, b, pCurveData, len);
}

void CurveAddData(CurveData *pCurveDataIn,double data, WORD32 len)

{
WORD32 i=0;
for(i=0;i<len;i++)
pCurveDataIn[i].y=pCurveDataIn[i].y+data;
}

double getMean(CurveData *pCurveDataIn, WORD32 start,WORD32 n)

{
WORD32 i=0;
double ymean=0.0;
for(i=start;i<start+n;i++)
ymean+=pCurveDataIn[i].y/(double)n;
return ymean;
}

double getStd(CurveData *pCurveDataIn,WORD32 n)

{
WORD32 i=0;
double ymean=0.0,var=0.0,std=0.0;
for(;i<n;i++)
ymean+=pCurveDataIn[i].y/(double)n; /*getMean*/

for(i=0;i<n;i++)

var+=((pCurveDataIn[i].y-ymean)*(pCurveDataIn[i].y-ymean));

var/=(float)n;

std=sqrt(var);
return std;
}

WORD32 foundDataNo(CurveData *CurveDataIn,double ymean,double y2std,WORD32 found,WORD32 len)

{
int i=0;
double ymn=0.0;
for(i=0;i<len/windowsize-1;i++)
{
ymn=getMean(CurveDataIn,i*windowsize,windowsize);

if((ymn-ymean)>6*y2std)

{
if(i<(len/windowsize-1))
{
ymn=getMean(CurveDataIn,(i+1)*windowsize,windowsize);
if(ymn-ymean>3*y2std)
{
found=i;
break;
}
}
}
else if(ymn<ymean)
{
ymean=ymn;
}
}

return found;

}

void CaculateNoise(CurveData *pCurveDataIn1,CurveData *pCurveDataIn2,WORD32 found,WORD32 len,double *noise)
{
WORD32 j=0;
WORD32 k=found*windowsize-backnum ;
for(j=0;j<found*windowsize-backnum;j++)
{
noise[j]=pCurveDataIn1[len+backnum-found*windowsize+j].y - pCurveDataIn2[k--].y;
}
}

void ReconstructData(CurveData *pCurveDataIn,WORD32 found,WORD32 len,double *noise,double ymn,CurveData *pCurveDataOut)

{
WORD32 j = 0;
for(j = 0;j <=(len-found*windowsize+backnum-1);j++)
{
/* if(j>500 || j>found*windowsize-backnum)
break;*/
pCurveDataOut[j].y=pCurveDataIn[j].y-ymn;
}

for(j = (len-found*windowsize+backnum);j<len;j++)

{
pCurveDataOut[j].y=noise[j-(len-found*windowsize+backnum)];
}
for(j=0;j<len;j++)
{
pCurveDataIn[j].y=pCurveDataOut[j].y;
}
}

WORD32 NoiseProcess(Curve *pCurveOut,WORD32 sampinterval, WORD32 sampperiod, WORD32 len)

{
CurveData *data1=NULL;
CurveData *data2=NULL;
double ymean=0.0;
double y2std=0.0;
double ymn=0.0;
double *noise=NULL;
WORD32 found=0xff;
double endata = 0.0;

data1=(CurveData *)malloc(len * sizeof(CurveData));

if(NULL==data1)
{
return ERROR;
}
memset(data1,0,len);

data2=(CurveData *)malloc(len* sizeof(CurveData));

if(NULL==data2)
{
free(data1);
return ERROR;
}
memset(data2,0,len);

ReverseCurveData(pCurveOut->data,data1,len);

endata = getMean(pCurveOut,len-100,100);
CurveMinusData(data1,endata,len);
FilterCurve(pCurveOut->config.comm.plsWid,data1,len);
CurveAddData(data1,endata,len);

if(len<windowsize || len<500)

return ERROR;
ymean=getMean(data1,0,windowsize);
y2std=getStd(data1,500);

found=foundDataNo(data1,ymean,y2std,found,len);

printf("found:%d\n",found);
if((found*windowsize-backnum-30)<0 || found == 0xff)
{
return ERROR;
}

ymn=getMean(data1,found*windowsize-backnum-30,30);

noise=(double *)malloc((found*windowsize-backnum)* sizeof(double));

if(NULL==noise)
{
free(data1);
free(data2);
return ERROR;
}
memset(noise,0,found*windowsize-backnum);

CaculateNoise(pCurveOut->data,data1,found,len,noise);

ReconstructData(pCurveOut->data,found,len,noise,ymn,data2);

free(data1);

free(data2);
free(noise);

return OK;

}

//没有专门的求任意底数对数的函数,不过可以用
//log(x)/log(y)表示log y x

转载地址:http://bpofl.baihongyu.com/

你可能感兴趣的文章
LNMMP架构的安装配置和功能的实现
查看>>
几个设置让你的邮箱不会爆满
查看>>
我的友情链接
查看>>
在linux6上安装RAC时多路径的权限设置
查看>>
[转载] 七龙珠第一部——第037话 忍者出现
查看>>
网络数据通信加密系统中加密解密流程
查看>>
PXE+KickStart无人值守安装RHEL
查看>>
十年,站酷已成设计论坛霸主,博客园却成无兵之将
查看>>
ansible安装
查看>>
使用bind搭建DNS服务器
查看>>
Windows server 2008R2 DHCP服务器
查看>>
计算机网络笔记--数据链路层(一)
查看>>
我的友情链接
查看>>
Java方法重载注意事项
查看>>
爱创课堂每日一题第五十九天- javascript继承的6种方法
查看>>
16.1 Tomcat介绍 16.2 安装jdk 16.3 安装Tomcat
查看>>
JS 正则表达式用法
查看>>
文档查看cat_more_less_head_tail
查看>>
python课堂笔记之django-day01(4)
查看>>
九月十九日作业
查看>>