research-article

KL-cuts: a new approach for logic synthesis targeting multiple output blocks

Authors:

Osvaldo Martinello, Jr.,

Felipe S. Marques,

Renato P. Ribas,

André I. ReisAuthors Info & Claims

DATE '10: Proceedings of the Conference on Design, Automation and Test in Europe

Pages 777 - 782

Published: 08 March 2010 Publication History

Get Access

Abstract

This paper introduces the concept of kl-feasible cuts, by controlling both the number k of inputs and the number l of outputs in a circuit cut. To provide scalability, the concept of factor cuts is extended to kl-cuts. Algorithms for computing this kind of cuts, including kl-cuts with unbounded k, are presented and results are shown. As a practical application, a covering algorithm using these cuts is presented.

References

[1]

Ling, A. C., Zhu, J., "Scalable Synthesis and Clustering Techniques Using Decision Diagrams", IEEE Trans. on CAD. 2008.

Digital Library

Google Scholar

[2]

Mishchenko, A., Brayton, R., "Scalable Logic Synthesis using a Simple Circuit Structure", Int'l Workshop on Logic & Synthesis, 2006. http://www.eecs.berkeley.edu/~alanmi/publications/2006/iwls06_sls.pdf

Google Scholar

[3]

Cong J., Wu, C., Ding, Y., "Cut Ranking and Pruning: Enabling A General and Efficient FPGA Mapping Solution", Int'l Symp. on FPGA, 1999.

Digital Library

Google Scholar

[4]

Pan, P., Lin C., "A New Retiming-based Technology Mapping Algorithm for LUT-based FPGAs", Int'l Symp. on FPGA, 1998.

Digital Library

Google Scholar

[5]

Mishchenko, A., Chatterjee, S., Brayton, R., "DAG-Aware AIG Rewriting: A Fresh Look at Combinational Logic Synthesis", Design Automation Conference, 2006.

Digital Library

Google Scholar

[6]

Mishchenko, A., Brayton, R., Chatterjee, S., "Boolean Factoring and Decomposition of Logic Networks", Int'l Conf. on CAD, 2008.

Digital Library

Google Scholar

[7]

Chatterjee, S., Mishchenko, A. and Brayton, R., "Factor Cuts", Int'l Conf. on CAD, 2006.

Digital Library

Google Scholar

[8]

Werber, J., Rautenbach, D., Szegedy, C., "Timing Optimization by Restructuring Long Combinatorial Paths", Int'l Conf. on CAD, 2007.

Digital Library

Google Scholar

[9]

Rosiello, A. P. E., Ferrandi, F., Pandini, D., Sciuto, D., "A Hash-based Approach for Functional Regularity Extraction During Logic Synthesis", IEEE Comp. Soc. Annual Symp. on VLSI, 2007.

Digital Library

Google Scholar

[10]

Mishchenko, A., Chatterjee, S., Brayton, R., "Improvements to Technology Mapping for LUT-Based FPGAs", Int'l Symp. on FPGA, 2006.

Digital Library

Google Scholar

[11]

Berkeley Logic Synthesis and Verification Group, "ABC: A System for Sequential Synthesis and Verification". http://www.eecs.berkeley.edu/~alanmi/abc

Google Scholar

[12]

Xilinx, "Achieving Higher System Performance with the Virtex-5 Family of FPGAs", White Paper, 2006. http://www.xilinx.com/

Google Scholar

[13]

Altera, "Improving FPGA Performance and Area Using an Adaptive Logic Module", White Paper, 2004. http://www.altera.com/

Google Scholar

[14]

Mishchenko, A., Brayton, R., Jiang, J. H. R., Jang, S., "Scalable Don't-Care-Based Logic Optimization and Resynthesis", Int'l Symp. on FPGA, 2009.

Digital Library

Google Scholar

Cited By

View all

Scarabottolo IAnsaloni GConstantinides GPozzi L(2019)Partition and PropagateProceedings of the 56th Annual Design Automation Conference 201910.1145/3316781.3317878(1-6)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1145/3316781.3317878
Hashemi STann HReda S(2018)BLASYSProceedings of the 55th Annual Design Automation Conference10.1145/3195970.3196001(1-6)Online publication date: 24-Jun-2018
https://dl.acm.org/doi/10.1145/3195970.3196001
Reis AChu CBustany I(2018)Towards a VLSI Design Flow Based on Logic Computation and Signal DistributionProceedings of the 2018 International Symposium on Physical Design10.1145/3177540.3177557(58-59)Online publication date: 25-Mar-2018
https://dl.acm.org/doi/10.1145/3177540.3177557
Show More Cited By

Recommendations

On the Rank of Disjunctive Cuts

Let L be a family of lattice-free polyhedra in R^m containing the splits. Given a polyhedron P in R^{m + n}, we characterize when a valid inequality for P ∩ (Z^m × Rⁿ) can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in ...
Computing generalized ham-sandwich cuts

Barany et al. (2008) [1] proved that, for any @b@?[0,1]^d and any d well-separated convex bodies S"1,S"2,...,S"d in R^d, there exists a hyperplane (a generalized ham-sandwich cut) splitting the volume of S"i as (@b"i,1-@b"i) for all i. Steiger and Zhao (...
Computational Experiments with Cross and Crooked Cross Cuts

<P>In this paper, we study whether cuts obtained from two simplex tableau rows at a time can strengthen the bounds obtained by Gomory mixed-integer (GMI) cuts based on single tableau rows. We also study whether cross and crooked cross cuts, which ...

Comments

Information & Contributors

Information

Published In

DATE '10: Proceedings of the Conference on Design, Automation and Test in Europe

March 2010

1868 pages

ISBN:9783981080162

General Chairs:
Giovanni De Micheli
EPF Lausanne, CH
,
Bashir Al-Hashimi
University of Southampton, UK
,
Program Chairs:
Wolfgang Mueller
University of Paderborn, SE
,
Enrico Macii
Politecnico di Torino, IT

Publisher

European Design and Automation Association

Leuven, Belgium

Publication History

Published: 08 March 2010

Check for updates

Author Tags

Qualifiers

Research-article

Conference

DATE '10

Sponsor:

EDAA
EDAC
SIGDA
The Russian Academy of Sciences

DATE '10: Design, Automation and Test in Europe

March 8 - 12, 2010

Germany, Dresden

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25

Sponsor:
sigda

Design, Automation and Test in Europe

March 31 - April 2, 2025

Lyon , France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
98
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 31 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Scarabottolo IAnsaloni GConstantinides GPozzi L(2019)Partition and PropagateProceedings of the 56th Annual Design Automation Conference 201910.1145/3316781.3317878(1-6)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1145/3316781.3317878
Hashemi STann HReda S(2018)BLASYSProceedings of the 55th Annual Design Automation Conference10.1145/3195970.3196001(1-6)Online publication date: 24-Jun-2018
https://dl.acm.org/doi/10.1145/3195970.3196001
Reis AChu CBustany I(2018)Towards a VLSI Design Flow Based on Logic Computation and Signal DistributionProceedings of the 2018 International Symposium on Physical Design10.1145/3177540.3177557(58-59)Online publication date: 25-Mar-2018
https://dl.acm.org/doi/10.1145/3177540.3177557
Machado LCortadella JBehjat LHan JVelev MChen D(2017)Boolean Decomposition for AIG OptimizationProceedings of the Great Lakes Symposium on VLSI 201710.1145/3060403.3060420(143-148)Online publication date: 10-May-2017
https://dl.acm.org/doi/10.1145/3060403.3060420
Elbayoumi MChoudhury MKravets VSullivan AHsiao MElnainay M(2014)TACUEProceedings of the 51st Annual Design Automation Conference10.1145/2593069.2593227(1-6)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1145/2593069.2593227

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

On the Rank of Disjunctive Cuts

Computing generalized ham-sandwich cuts

Computational Experiments with Cross and Crooked Cross Cuts

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations