Technology mapping by binate covering

Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of this problem in turn can be formulated as the binate coveringproblem that is NP-hard. A number of heuristics solving the binate covering problem has been proposed. However, no experimental comparison of efficiency of such techniques with respect to this specific domain has been published according to our knowledge. The aim of this paper is to analyze specific features of the binate covering formulation of the technology mapping, to propose and test a collection of heuristics using MCNC benchmarks and to select the most efficient heuristic algorithm.

• Type: Conference
• Year: 1997
• Where: FPL
• Authors: Michal Servít, Kang Yi
• Keywords: Binate Covering, FPL 1997, Hardware, Minimum Cost Cover, Technology Mapping