By Topic

Low-power multiplexer decomposition by suppressing propagation of signal transitions

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

5 Author(s)
Kisun Kim ; R&D, Hyundai Electron. Ind. Co. Ltd., Seoul, South Korea ; Taekyoon Ahn ; Sang-Yeol Han ; Chang-Seung Kim
more authors

Most circuits contain a number of multiplexers. An n-to-1 multiplexer is generally implemented by decomposition into 2-to-1 multiplexer. Due to its ordered tree structure, the n-to-1 multiplexer decomposition problem can be relatively easily solved for minimizing design considerations such as timing, area, and power consumption. In this paper, we propose an efficient and accurate method for estimating the number of signal transitions in multiplexer tree and a low-power multiplexer decomposition method using the proposed estimation method without any change of boolean functions of selection signals. The decomposition method is a kind of re-engineering method. Experimental results show that our proposed method can accurately estimate the number of internal signal transitions and their propagations, and our optimization technique using the proposed method reduces power consumption by considerable amount in multiplexer trees

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference:

2001