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

Authors:
Osvaldo Martinello, Jr.;Felipe S. Marques;Renato P. Ribas;André I. Reis
Affiliations:
Federal University of Rio Grande do Sul - UFRGS, Porto Alegre, Brazil;Federal University of Rio Grande do Sul - UFRGS, Porto Alegre, Brazil;Federal University of Rio Grande do Sul - UFRGS, Porto Alegre, Brazil;Federal University of Rio Grande do Sul - UFRGS, Porto Alegre, Brazil
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2010

Citing 10
Cited 0

A new retiming-based technology mapping algorithm for LUT-based FPGAs

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Cut ranking and pruning: enabling a general and efficient FPGA mapping solution

FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
Improvements to technology mapping for LUT-based FPGAs

Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays
DAG-aware AIG rewriting a fresh look at combinational logic synthesis

Proceedings of the 43rd annual Design Automation Conference
Factor cuts

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Hash-based Approach for Functional Regularity Extraction During Logic Synthesis

ISVLSI '07 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
Timing optimization by restructuring long combinatorial paths

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Scalable don't-care-based logic optimization and resynthesis

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Boolean factoring and decomposition of logic networks

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Scalable Synthesis and Clustering Techniques Using Decision Diagrams

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

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.