ACM Home Page
Please provide us with feedback. Feedback
Transistor reordering for power minimization under delay constraint
Full text PdfPdf (290 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 1 ,  Issue 2  (April 1996) table of contents
Pages: 280 - 300  
Year of Publication: 1996
ISSN:1084-4309
Authors
S. C. Prasad  Texas Instruments, Inc., Dallas, TX
K. Roy  Purdue Univ., West Lafayette, IN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 21,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/233539.233543
What is a DOI?

ABSTRACT

In this article we address the problem of optimization of VLSI circuits to minimize power consumption while meeting performance goals. We present a method of estimating power consumption of a basic or complex CMOS gate which takes the internal capacitances of the gate into account. This method is used to select an ordering of series-connected transistors found in CMOS gates to achieve lower power consumption. The method is very efficient when used by library-based design styles. We describe a multipass algorithm that makes use of transistor reordering to optimize performance and power consumption of circuits, has a linear time complexity per pass, and converges to a solution in a small number of passes. Transformations in addition to transistor reordering can be used by the algorithm. The algorithm has been benchmarked on several large examples and the results are presented.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
AGARWALA, S. AND BOSSHART, P. 1994. A linear time algorithm for timing directed optimizations. IEEE International Symposium on Circuits and Systems (May), 107-110.
2
 
3
BOBROW, D. G., DEMICHIEL, L. G., GABRIEL, R. G., KEENE, S. E., KICZALES, G., AND MOON, D. A. 1990.Common Lisp object system. In Common Lisp, Digital Press, Maynard, MA, 770-864.
 
4
5
 
6
 
7
 
8
 
9
HARARY, F. 1984. Combinatorial problems in graphical enumeration. In Applied Combinatorial Mathematics, E. F. Beckenbach, Ed., Wiley, New York.
 
10
HITCHCOCK, R. B., SMITH, G. L., AND CHENG, D. D. 1982. Timing analysis of computer hardware. IBM J. Res. Dev, 26, 1 (Jan.), 100-105.
11
12
 
13
LIN, B. AND DE MAN, H. 1993. Low-power driven technology mapping under timing constraint. In Proceedings of the International Conference on Computer Design, (Oct.) 421-427.
14
 
15
NAJM, F. N. AND HAJJ, I. 1987. The complexity of test generation at transistor level. Rep. UILU-ENG-87-2280, Coordinated Science Lab., Univ. of Illinois at Urbana Champaign, Dec.
 
16
NAJM, F., BURCH, R., YANG, P., AND HAJJ, I. 1990. Probabilistic simulation for reliability analysis of CMOS VLSI circuits. IEEE Trans. Comput.-Aided Des. 9, 4 (April), 439-450.
 
17
PARKER, K. P. AND MCCLUSKEY, E.g. 1975. Probabilistic treatment of general combinatorial networks. IEEE Trans. Comput. C-24 (June), 668-670.
 
18
PRASAD, S. C. AND ROY, K. 1993. Circuit activity driven multi-level logic optimization for low-power reliable operation. In Proceedings of the European Design Automation Conference, (Feb.) 368-372.
 
19
RoY, K. AND PRASAD, S.C. 1993. Circuit activity based logic synthesis for low power reliable operation. IEEE Trans. VLSI Syst. 1, 4 (Dec.) 503-513.
 
20
SAKURAI, T. AND NEWTON, A.R. 1991. Delay analysis of series-connected MOSFET circuits. IEEE J. Solid-State Circuits 26, 2 (Feb.), 122-131.
 
21
SHOJI, M. 1988. CMOS Digital Circuit Technology. Prentice Hall, Englewood Cliffs, NJ.
22
 
23
TOUATI, H. J., ET AL. 1991. Delay optimization of combinational logic circuits by clustering and partial collapsing. In Proceedings of the IEEE International Conference on CAD, (Nov.) 188-191.
 
24
25
 
26



Peer to Peer - Readers of this Article have also read: