Cart (Loading....) | Create Account
Close category search window
 

Multiplierless FIR filter design algorithms

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

2 Author(s)
Macleod, M.D. ; QinetiQ Ltd., Malvern, UK ; Dempster, A.G.

This letter concerns the design of multiplierless implementations of finite impulse response (FIR) filters to achieve minimum adder cost. Existing approaches include dependence-graph multiplier-block methods and Common Subexpression Elimination (CSE) techniques applied either to the Canonic Signed Digit (CSD) representation of the coefficients or to other Signed Digit (SD) representations. We introduce a new CSE algorithm, which searches a bounded number of Minimal Signed Digit (MSD) representations. The performance of existing algorithms and the new algorithm is compared. It is shown that the relative performance of different algorithms depends on filter length and wordlength and that the new algorithm gives significant improvements in some cases.

Published in:

Signal Processing Letters, IEEE  (Volume:12 ,  Issue: 3 )

Date of Publication:

March 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.