By Topic

A Method for Improving Cascode-Switch Macro Wirability

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

4 Author(s)
Schlag, M.D.F. ; IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA ; Yoffa, Ellen J. ; Hauge, Peter S. ; Wong, C.K.

In this paper, a problem in macro design using cascode-switch tree logic is studied. It involves selecting specific tree instantiations of Boolean functions and input variable assignments to maximize the alignment of variables between adjacent trees. An algorithm to find optimal solutions based on the principle of optimality is proposed. Although in general it is not a polynomial time algorithm, it runs sufficiently fast for our practical application. Finally we prove the problem is NP-complete, thus the existence of polynomial time algorithms is indeed unlikely.

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:4 ,  Issue: 2 )