Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
W.D. Little (1974) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: