An Algorithm for High-Speed Digital Filters

Authors:
W. D. Little
Affiliations:
Department of Electrical Engineering, University of Waterloo
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 6
Cited 5

Negative Radix Conversion

IEEE Transactions on Computers
New Hardware Realizations of Nonrecursive Digital Filters

IEEE Transactions on Computers
The Counting Recursive Digital Filter

IEEE Transactions on Computers
A/D Conversion for Radix (-2)

IEEE Transactions on Computers
A Comparison of Some Theoretical Models of Parallel Computation

IEEE Transactions on Computers
Parallel program schemata

Journal of Computer and System Sciences

A High-Speed Microprogrammable Digital Signal Processor Employing Distributed Arithmetic

IEEE Transactions on Computers
On Little's Digital Filtering Algorithm

IEEE Transactions on Computers
Rounding and Truncation in Radix (-2) Systems

IEEE Transactions on Computers
Combinational Circuit Synthesis with Time and Component Bounds

IEEE Transactions on Computers
A Realization of the RAM Digital Filter

IEEE Transactions on Computers

Quantified Score

Hi-index	15.00

Visualization

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.