By Topic

Transition analysis on FPGA for multiplier-block based FIR filter structures

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
$33 $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

3 Author(s)
S. S. Demirsoy ; Dept. of Electron. Syst., Univ. of Westminster, London, UK ; A. Dempster ; I. Kale

This paper presents a study on the power consumption analysis of several multiplier-block based FIR filter structures. Transitions have been counted for the filter structures that were implemented on an FPGA device. The algorithms employed to generate the multiplier-blocks are compared with respect to their power performance. A new term, Glitch Path count, has been proposed and tested for use as an indicator of power consumption. This measure has been shown to be more correlated with the transition counts than the adder-count and logic depth approaches

Published in:

Electronics, Circuits and Systems, 2000. ICECS 2000. The 7th IEEE International Conference on  (Volume:2 )

Date of Conference: