Issue No. 05 - May (1974 vol. 23)
W.D. Little , Department of Electrical Engineering, University of Waterloo
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.
Computation schema, digital filter, filter algorithm, negative radix arithmetic, nonrecursive filter, recursive filter.
W. Little, "An Algorithm for High-Speed Digital Filters," in IEEE Transactions on Computers, vol. 23, no. , pp. 466-469, 1974.