简易滑动滤波算法
算法原理
将新数据放入到数组的最后,每次在得到数据之前先将数据左移一个元素,踢掉第一个元素最旧的数据,最后数组计算平均
#include<stdio.h>
#define ADC_CAPTURE 10 //采集数量
static int uiChannel1Buffer[ADC_CAPTURE] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
static long ulChannel1AdcValue = 0;
static int value[ADC_CAPTURE] = {10, 15, 18, 16, 17, 20, 19, 22, 17, 13};
void SilderFilter(int _value)
{
char i;
for(i=0; i<ADC_CAPTURE-1; i++)
{
uiChannel1Buffer[i] = uiChannel1Buffer[i+1];
}
uiChannel1Buffer[ADC_CAPTURE-1] = _value;
for(char i=0; i<ADC_CAPTURE; i++)
{
ulChannel1AdcValue = uiChannel1Buffer[i] + ulChannel1AdcValue;
}
for(i=0; i<ADC_CAPTURE; i++)
{
printf("uiChannel1Buffer[%d] = %d Average: %ld\n",i, uiChannel1Buffer[i], ulChannel1AdcValue / ADC_CAPTURE);
}
printf("----------------------------\n");
}
int main(void)
{
char i;
for(i=0; i<ADC_CAPTURE; i++)
{
printf("uiChannel1Buffer[%d] = %d\n",i, uiChannel1Buffer[i]);
}
printf("----------------------------\n");
for(i=0; i<ADC_CAPTURE; i++)
{
SilderFilter(value[i]);
}
}