By Topic

Cascaded coefficient number systems lead to FIR filters of striking computational efficiency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Coleman, J.O. ; Naval Res. Lab., Washington, DC, USA

Multiplierless FIR filters (or other fixed linear combiners) are built as add/subtract networks operating on bit-shifted input data. Classically, the computational structure required is determined by simply expressing the coefficients in canonical-signed-digit (CSD) form. In this paper, expressing coefficients in a higher-radix number system instead results in a computational structure for a partial solution, one that reduces a large linear-combination problem to a smaller one. A well-chosen sequence of such number systems then leads to a cascade of these problem-reducing networks that together solve the original problem with remarkable overall computational efficiency, especially for larger filters. An example FIR filter with a real chirp impulse response 3000 samples in length (a matched filter for a pulse-compression radar) was easily realized with -95 dB rms approximation error using less than two add or subtract operations per coefficient. This is a reduction of approximately 60% relative to the usual CSD method

Published in:

Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on  (Volume:1 )

Date of Conference:

2001