Abstract :
This paper describes an algorithm that is suitable for fast implementations of nonrecursive and recursive digital filters. High speed is realized at the expense of memory; however, the memory-speed tradeoff is flexible so that many hardware and software implementations are practical. When memory is not limited, the time required to compute a filter output value is independent of the order of the filter.
Keywords :
Computation schema, digital filter, filter algorithm, negative radix arithmetic, nonrecursive filter, recursive filter.; Costs; Digital arithmetic; Digital filters; Equations; Flow graphs; Hardware; Signal processing; Software algorithms; Computation schema, digital filter, filter algorithm, negative radix arithmetic, nonrecursive filter, recursive filter.;
