Timing-driven N-way decomposition
Pages 363 - 368
Abstract
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techniques to reduce the depth of the netlist due to the affordable computational cost. We present a novel n-way decomposition technique that improves bi-decomposition. The problem of decomposition is formulated as a Boolean relation which captures a larger set of possible solutions compared to bi-decomposition. The solution obtained from the Boolean relation improves the delay with near-zero cost in area. As it is shown on the experimental results, a considerable improvement is achieved on large netlists and even larger depending on which technology mapper is used.
References
[1]
D. Bochmann, F. Dresig, and B. Steinbach, "A new decomposition method for multilevel circuit design," in Proc. European Design Automation Conference (EURO-DAC), 1991, pp. 374--377.
[2]
S. Yamashita, H. Sawada, and A. Nagoya, "New methods to find optimal non-disjoint bi-decompositions," in Proc. ACM/IEEE Design Automation Conference, 1998, pp. 59--68.
[3]
C. Yang, M. Ciesielski, and V. Singhal, "BDS: A BDD-based logic optimization system," in Proc. ACM/IEEE Design Automation Conference, June 2000, pp. 92--97.
[4]
A. Mishchenko, B. Steinbach, and M. Perkowski, "An algorithm for bi-decomposition of logic functions," in Proc. ACM/IEEE Design Automation Conference, June 2001, pp. 282--285.
[5]
B. Steinback and A. Wereszczynski, "Synthesis of multi-level circuits using exor-gates," in Proc. of Reed-Muller'95, 1995, pp. 161--168.
[6]
Y.-Y. Lian and Y.-L. Lin, "Layout-based logic decomposition for timing optimization," in Proc. of Asia and South Pacific Design Automation Conference, 1999, pp. 229--232.
[7]
J. Cortadella, "Timing-driven logic bi-decomposition," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 6, pp. 675--685, June 2003.
[8]
D. Kuck, The Structure of Computers and Computation. John Wiley & Sons, 1978.
[9]
D. Baneres, J. Cortadella, and M. Kishinevsky, "A recursive paradigm to solve
[10]
Boolean relations," IEEE Transactions on Computers, vol. 58, no. 4, pp. 512--527, Apr. 2009.
[11]
K. J. Singh, A. Wang, R. Brayton, and A. Sangiovanni-Vincentelli, "Timing optimization of combinational logic," in Proc. Int. Conf. Computer-Aided Design (ICCAD), Nov. 1988, pp. 282--285.
[12]
R. Rudell, "Logic synthesis for VLSI design," Ph.D. dissertation, UC Berkeley, Apr. 1989.
[13]
H. J. Touati, C. W. Moon, R. K. Brayton, and A. Wang, "Performance-oriented technology mapping," in Proc. 6th M.I.T. Conference on Advanced Research in VLSI, Apr. 1990, pp. 79--97.
[14]
S. Chatterjee, A. Mishchenko, R. Brayton, X. Wang, and T. Kam, "Reducing structural bias in technology mapping," Proc. Int. Conf. Computer-Aided Design (ICCAD), pp. 519--526, 2005.
Index Terms
- Timing-driven N-way decomposition
Recommendations
Timing-driven via placement heuristics for three-dimensional ICs
The dependence of the interconnect delay on the interplane via location in three-dimensional (3-D) ICs is investigated in this paper. The delay of these interconnects can be significantly decreased by optimally placing the interplane vias. The via ...
ITOP: integrating timing optimization within placement
ISPD '10: Proceedings of the 19th international symposium on Physical designTiming-driven placement is a critical step in nanometer-scale physical synthesis. To improve design timing on a global scale, net-weight based global timing-driven placement is a commonly used technique. This paper shows that such an approach can ...
Crosstalk- and performance-driven multilevel full-chip routing
In this paper, we propose a novel framework for fast multilevel routing considering crosstalk and performance optimization. To handle the crosstalk minimization problem, we incorporate an intermediate stage of layer/track assignment into the multilevel ...
Comments
Information & Contributors
Information
Published In
May 2009
558 pages
ISBN:9781605585222
DOI:10.1145/1531542
- Co-chair:
- Fabrizio Lombardi,
- General Chairs:
- Sanjukta Bhanja,
- Yehia Massoud,
- Program Chair:
- R. Iris Bahar
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 10 May 2009
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
Acceptance Rates
Overall Acceptance Rate 312 of 1,156 submissions, 27%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 99Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in