loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 International Conference on Computer Design
Exact lower bound for the number of switches in series to implement a combinational logic cell
San Jose, California
October 02-October 05
ISBN: 0-7695-2451-6
F.R. Schneider, Instituto de Inform?tica - UFRGS CEP - Caixa Postal Porto Alegre - RS - Brasil
R.P. Ribas, Instituto de Inform?tica - UFRGS CEP - Caixa Postal Porto Alegre - RS - Brasil
S.S. Sapatnekar, Department of Electrical and Computer Engineering 200 Union Street SE, University of Minnesota, MN
A.I. Reis, Department of Electrical and Computer Engineering 200 Union Street SE, University of Minnesota, MN

This paper addresses the question of how many serial switches are necessary to implement a given logic function as a switch network. This issue is important because it affects directly the resistance that will be charging/discharging output loads, thus affecting cell and circuit performance. We derive exact lower bounds to easily evaluate the number of serial switches needed and demonstrate that Complementary Series/Parallel (CSP) and Pass Transistor Logic (PTL) topologies exceed the lower bounds for many practical examples. We also propose a design methodology that will produce cells with minimum number of transistors in series and evaluate the benefits obtained in circuit delay.

Citation:
F.R. Schneider, R.P. Ribas, S.S. Sapatnekar, A.I. Reis, "Exact lower bound for the number of switches in series to implement a combinational logic cell," iccd, pp.357-362, 2005 International Conference on Computer Design, 2005
Usage of this product signifies your acceptance of the Terms of Use.