Abstract
Since multipliers are the slowest and most expensive components in digital filters, schemes for increasing speed and reducing cost are of interest. For a device that does multiplication by successive shift and add operations, different architectures can be used to speed the process and allow for hardware sharing. Several architectures are discussed in this paper. For filters that carry a small digital word length, nonconventional multiply schemes may well be appropriate. Two such schemes, table look up and residue algebra, are discussed.
Original language | English (US) |
---|---|
Pages | 116-121 |
Number of pages | 6 |
DOIs | |
State | Published - 1974 |
Event | IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974 - Phoenix, AZ, USA Duration: Nov 20 1974 → Nov 22 1974 |
Other
Other | IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974 |
---|---|
City | Phoenix, AZ, USA |
Period | 11/20/74 → 11/22/74 |
All Science Journal Classification (ASJC) codes
- General Engineering