原文链接:http://www.itdoy.com/index.php/post/22.html
头文件:itdoy_FilterData.h
C
#ifndef __ITDOY_FILTERDATA_H__
#define __ITDOY_FILTERDATA_H__
#define FilterDataNumber 5
#define RecurrenceNumber 10
typedef struct
{
float Data[FilterDataNumber];
float LastResult;
float RecurrenceData[RecurrenceNumber];
float RecurrenceState;
float Result;
}FilterData_Struct;
extern void itdoy_FilterData(FilterData_Struct * filter_data);//组合实现:去除极限平均值+加权+递归平均数据滤波
#endif
源文件:itdoy_FilterData.c
C
#include "itdoy_FilterData.h"
float RemoveLimitAverage(FilterData_Struct * filter_data)//去除极限值并求平均值
{
int i = 0;
float max_data = 0;
float min_data = 0;
float sum = 0;
float average = 0;
max_data = filter_data->Data[0];
min_data = filter_data->Data[0];
for(i = 0; i < FilterDataNumber; i++)
{
if(filter_data->Data[i] > max_data) max_data = filter_data->Data[i];
else if(filter_data->Data[i] < min_data) min_data = filter_data->Data[i];
sum = sum + filter_data->Data[i];
}
sum = sum - max_data - min_data;
average = sum / (FilterDataNumber - 2);
return average;
}
float AddWeight(FilterData_Struct * filter_data)//依据变化幅度进行加权
{
float temp = 0;
float weight = 0;
float weight_data = 0;
temp = RemoveLimitAverage(filter_data);
if(temp > filter_data->LastResult)
{
weight = (temp - filter_data->LastResult) / filter_data->LastResult;
}
else
{
weight = (filter_data->LastResult - temp) / filter_data->LastResult;
}
weight_data = weight * temp;
return weight_data;
}
float RecurrenceAverage(FilterData_Struct * filter_data)//对数据进行递归平均
{
int i =0;
float sum = 0;
float average = 0;
if(RecurrenceState < (RecurrenceNumber - 1))
{
RecurrenceState++;
}
else
{
RecurrenceState = 0;
}
filter_data->RecurrenceData[RecurrenceState] = AddWeight(filter_data);
for(i = 0; i < RecurrenceNumber; i++)
{
sum = sum + filter_data->RecurrenceData[i];
}
average = sum / RecurrenceNumber;
return average;
}
void itdoy_FilterData(FilterData_Struct * filter_data)//组合实现:去除极限平均值+加权+递归平均数据滤波
{
RecurrenceAverage(filter_data);
}