Sliding average filtering algorithm (recursive averaging filter method)

Source: Internet
Author: User

Sliding average filtering algorithm (recursive averaging filter method)

Adnum for the number of ad received

The number of elements of the GN array value_buf[]. This function is called primarily, using the array of parameters to pass the value

const int GN = 12;

int filterptr = 0;

bool IsFirst = true;

public float gsum = 0;

float[] Gbuf = new FLOAT[GN];

Float Glidefilterad (float adnum)

{

if (IsFirst)

{

IsFirst = false;

for (int i = 0; i< GN; i++)

Gbuf[i] = Adnum;

Gsum = Adnum * GN;

return adnum;

}

Else

{

Gsum-= gbuf[filterptr] + adnum;

gbuf[filterptr++] = Adnum;

if (filterptr = = GN)

filterptr = 0; FIFO first, then average

return (GSUM/GN);

}

}

Sliding average filtering algorithm (recursive averaging filter method)

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.