By Topic

Simultaneous scheduling and binding for low gate leakage nano-complementary metaloxide-semiconductor data path circuit behavioural synthesis

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 $31
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)
Mohanty, S.P. ; Comput. Sci. & Eng., Univ. of North Texas, Denton, TX ; Kougianos, E. ; Pradhan, D.K.

The authors present two polynomial time-complexity heuristic algorithms for optimisation of gate- oxide leakage (tunnelling current) during behavioural synthesis through simultaneous scheduling and binding. One algorithm considers the time-constraint explicitly and the other considers it implicitly, whereas both account for resource constraints. The algorithms selectively bind the off-critical operations to instances of the pre-characterised resources consisting of transistors of higher oxide thickness, and critical operations to the resources of lower oxide thickness for power and performance optimisation. We design and characterise functional and storage units of different gate-oxide thicknesses and built a data path library. Extensive experiments for several behavioural synthesis benchmarks for 45 nm complementary metal-oxide- semiconductor technology showed that reduction as high as 85% can be obtained.

Published in:

Computers & Digital Techniques, IET  (Volume:2 ,  Issue: 2 )