DSPRelated.com

(@jshowa)


But wouldn't doing this:for (n=0, sum=0; n<times; n++) {)>    // for (i=0; i<M-1; i++) replace inner loop with one line;>         sum += data[n]...
I've seen FIR algorithms with one future point, however this implementation perplexes me because it begins with data(1) twice. For example:Loop iteration 1----------------data(0)...
I'm kind of out of my element here trying to understand this algorithm and I wanted to see if this is a FIR algorithm or not? If this isn't the right place to ask...

Use this form to contact jshowa

Before you can contact a member of the *Related Sites:

  • You must be logged in (register here)
  • You must confirm you email address