FIR的一直方便算法实现

最新推荐文章于 2024-05-08 11:11:56 发布

samssm

最新推荐文章于 2024-05-08 11:11:56 发布

阅读量1.2k

点赞数

文章标签：算法 input delay basic filter

本文链接：https://blog.csdn.net/samssm/article/details/7698591

版权

/******************************************************/

SAMPLE fir_basic(SAMPLE input, int ntaps, const SAMPLE h[], SAMPLE z[])       
{
    int ii;
    SAMPLE accum;
    
    /* store input at the beginning of the delay line */
    z[0] = input;

    /* calc FIR */
    accum = 0;
    for (ii = 0; ii < ntaps; ii++) {
        accum += h[ii] * z[ii];
    }

    /* shift delay line */
    for (ii = ntaps - 2; ii >= 0; ii--) {
        z[ii + 1] = z[ii];
    }

    return accum;
}

/******* taps have been reverse before do fir computation *******/
gr_complex
gr_fir_ccc_generic::filter (const gr_complex input[])
{
  static const int N_UNROLL = 2;

  gr_complex    acc0 = 0;
  gr_complex    acc1 = 0;

  unsigned    i = 0;
  unsigned    n = (ntaps () / N_UNROLL) * N_UNROLL;

  for (i = 0; i < n; i += N_UNROLL){
    acc0 += d_taps[i + 0] *  input[i + 0];
    acc1 += d_taps[i + 1] *  input[i + 1];
  }

  for (; i < ntaps (); i++)
    acc0 += d_taps[i] *  input[i];

  return (gr_complex) (acc0 + acc1);
}