A new method towards achieving global optimality in technology mapping

Authors:
Wen Xiaoqing;Kewal K. Saluja
Affiliations:
Dept. of Information Engr., Akita University, Akita 010, Japan;Dept. of Electrical & Computer Engr., University of Wisconsin-Madison, Madison, WI
Venue:
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Year:
1997

Citing 4
Cited 0

DAGON: technology binding and local optimization by DAG matching

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
SOCRATES: a system for automatically synthesizing and optimizing combinational logic

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Computing the area versus delay trade-off curves in technology mapping

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new method for covering a Boolean network by library cells. In this method, matches are classified according to their properties. Some matches are selected unconditionally into a cover and the remaining nodes are divided into independent portions. Then, a match compatibility graph (MCG) is constructed for each portion and an optimum cover is found for it using the MCG. Thus, our method finds an efficient and closer to optimum cover for the complete network.