Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kang Yi, Chu-Shik Jhon: A New FPGA Technology Mapping Approach by Cluster Merging. In: R.W. Hartenstein, M. Glesner (Eds.): Field-Programmable Logic. Springer 1996, pp 366–370.
M. Servft, J. Zamazal: Heuristic Approach to Binate Covering Problem. EDAC'92 Proc., 1992, pp. 123–129.
R. Murgai, R. Brayton, A. Sangiovanni-Vincentelli: Logic Synthesis for FieldProgrammable Gate Arrays. Kluver, 1995.
L Stok et al.: BooleDozer — Logic Synthesis for ASICs. IBM J. of Res. and Dev., 1995, Vol. 40, No. 4, pp. 407–430.
J. Zamazal: Boolean Satisfiability and Covering Problems-Design and Evaluation of Efficient Algorithms. PhD Dissertation, Czech Technical University, 1995.
O. Coudert, J. Madre: New Ideas for Solving Covering Problems. 31st DAC Proc., 1995.
M. Servít, J Zamazal: Decomposition and Reduction — General Problem-Solving Paradigms. VLSI Design J., 1995, Vol. 3, Nos. 3-4, pp. 359–371.
C. Papadimitriou, K. Steglitz: Combinatorial Optimization — Algorithms and Complexity. Prentice-Hall, 1982, pp. 406–409.
The Actel FPGA Data Book, Actel Inc., 1993.
R. Murgai, K. Brayton, A. Sangiovanni-Vincentelli: An Improved Synthesis Algorithm for Multiplexor-based PGA's. 28th DAC Proc., 1992, pp. 380–386.
Kang Yi, Soeng-Yong Ohm, Chu-Shik Jhon: An Efficient FPGA Technology Mapping Tightly Coupled with Logic Minimization. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, to appear in September 1997.
M. Servít, Kang Yi: Binate Covering Approach to FPGA Technology Mapping Problem. CTU Research Report under preparation.
T. Kam et al.: Synthesis of Finite State Machines-Functional Optimization. Kluver, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Servít, M.Z., YI, K. (1997). Technology mapping by binate covering. In: Luk, W., Cheung, P.Y.K., Glesner, M. (eds) Field-Programmable Logic and Applications. FPL 1997. Lecture Notes in Computer Science, vol 1304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63465-7_225
Download citation
DOI: https://doi.org/10.1007/3-540-63465-7_225
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63465-2
Online ISBN: 978-3-540-69557-8
eBook Packages: Springer Book Archive