ACM Home Page
Please provide us with feedback. Feedback
Technology mapping algorithms for domino logic
Full text PdfPdf (481 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 7 ,  Issue 2  (April 2002) table of contents
Pages: 306 - 335  
Year of Publication: 2002
ISSN:1084-4309
Authors
Min Zhao  Advanced Tools, Motorola Inc., Austin, TX
Sachin S. Sapatnekar  University of Minnesota, Minneapolis, MN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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/544536.544541
What is a DOI?

ABSTRACT

We present an efficient algorithm for technology mapping of domino logic to a parameterized library. The algorithm is optimal for mapping trees consisting of two-input AND/OR nodes, and has a computation time that is polynomial in terms of constraint size. The mapping method is then extended to DAG covering that permits the implicit duplication of logic nodes. Our synthesis procedure maps the complementary logic cones independently when AND/OR logic is to be implemented, and together using dual-monotonic gates in the case of XOR/XNOR logic. The mapping procedure solves the output phase assignment problem as a preprocessing step. Based on a key observation that the output phase assignment could reduce the implementation cost due to the possible large cost difference between two polarities, a 0--1 integer linear programming formulation was designed to minimize the implementation cost. Our experimental results show the effectiveness of the proposed techniques.


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
 
2
Berkelaar, M. R. C. M. 1998. LP SOLVE 2.3 Users' Manual.
 
3
Berkelaar, M. R. C. M. and Jess, J. A. G. 1988. Technology mapping for standard-cell generators. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 470--473.
 
4
Brayton, R. K., Chen, C. L., McMullen, C. T., Otten, R. H. J. M., and Yamour, Y. J. 1984. Automated implementation of switching functions as dynamic CMOS circuits. In Proceedings of the IEEE Custom Integrated Circuits Conference, 346--350.
 
5
Burns, J. L. and Feldman, J. A. 1998. C5M---A control-logic layout synthesis system for high-performance microprocessors. IEEE Trans. Comput. Aided Des. 17, 1 (Jan.), 14--23.
 
6
Campenhout, D. V., Mudge, T., and Sakallah, K. 1996. Modeling domino logic for static timing analysis. Tech. Rep. CSE-TR-295-96, The University of Michigan.
 
7
Chaudhary, K. and Pedram, M. 1995. Computing the area versus delay trade-off curves in technology mapping. IEEE Trans. Comput. Aided Des. 14, 12 (Dec.), 1480--1489.
 
8
 
9
Detjens, E., Gannot, G., Rudell, R., Sangiovanni-Vincentelli, A., and Wang, A. 1987. Technology mapping in MIS. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 116--119.
 
10
Fishburn, J. P. and Dunlop, A. E. 1985. TILOS: A posynomial programming approach to transistor sizing. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, 326--328.
 
11
Harris, D. and Horowitz, M. A. 1997. Skew-tolerant domino circuits. IEEE J. Solid-State Circ. 32, 11 (Nov.), 1702--1711.
12
13
14
 
15
16
 
17
Lehman, E., Watanabe, Y., Grodstein, J., and Harkness, H. 1997. Logic decomposition during technology mapping. J. ACM 16, 8 (Aug.), 813--834.
18
 
19
 
20
Ortiz, R. R. and Lefebvre, M. C. 1993. Technology mapping for NORA dynamic logic circuits. In Proceedings of the European Design Automation Conference, 310--314.
21
 
22
Prasad, M. R., Kirkpatrick, D., and Brayton, R. K. 1997. Domino logic synthesis and technology mapping. In Workshop Notes, International Workshop on Logic Synthesis.
 
23
 
24
 
25
26
 
27
 
28
Venkat, K., Chen, L., Lin, I., Mistry, P., and Madhani, P. 1996. Timing verification of dynamic circuits. IEEE J. Solid-State Circ. 31, 3 (Mar.), 452--455.
 
29
Wang, J., Wang, Z. D., Jullien, G. A., and Miller, W. C. 1994. Area-time analysis of carry lookahead adders using enhanced multiple output domino logic. In Proceedings of the IEEE International Symposium on Circuits and Systems, 59--62.
 
30
Wang, Z., Jullien, G. A., Miller, W. C., Wang, J., and Bizzan, S. S. 1997. Fast adders using enhanced multiple-output domino logic. IEEE J. Solid-State Circ. 32, 2 (Feb.), 206--213.
 
31
Williams, T. 1996. Dynamic logic: Clocked and asynchronous. In Tutorial Notes at the International Solid State Circuits Conference.
 
32
Yee, G. and Sechen, C. 1997. Dynamic logic synthesis. In Proceedings of the IEEE Custom Integrated Circuits Conference, 345--348.
33
 
34
Zhao, M. and Sapatnekar, S. S. 2000. Timing-driven partitioning and timing optimization of mixed static-domino implementations. J. ACM 19, 11 (Nov.), 1322--1336.


Collaborative Colleagues:
Min Zhao: colleagues
Sachin S. Sapatnekar: colleagues