Circular Buffering in Finite Impulse Response Filtering?

Question

Why is this more efficient than most other simple methods? Why is the pointer significant in the coding of one of them? Thanks

Answer 1

Because you can maintain pointers to the data (on both storage and retrieval) as a modulo-n counter (where n is the number of stages) and the constants (the impulse response of the filter) in another, identical aray.

It's just a lot less code and monkey-motion ☺

Doug