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 covering problem 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.
CITATION STYLE
Servít, M. Z., & Yi, K. (1997). Technology mapping by binate covering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1304, pp. 203–212). Springer Verlag. https://doi.org/10.1007/3-540-63465-7_225
Mendeley helps you to discover research relevant for your work.