- 1.K. Keutzer, "DAGON:Technology Binding and Local Optimization by DAG Matching", in Proc. 24th Design Automation conf., pp. 341-347, June 1987. Google ScholarDigital Library
- 2.R.L. Rudell, "Logic Synthesis for VLSI Design", PhD thesis, UCB/ERL M89/49, April 1989. Google ScholarDigital Library
- 3.C. Hoffrnan and M. O'Donnell, "Pattern matching in trees", Jour. ACM, 29(1):68-95, January 1982. Google ScholarDigital Library
- 4.H.J. Touati, "Performance-Oriented Technology Mapping", PhD thesis, UCB/ERL M90/109, November 1990. Google ScholarDigital Library
- 5.E Mailhot and G. De Micheli, "Algorithms for Technology Mapping Based on Binary Decision Diagrams and on Boolean Operations" Technical Report of Stanford University, No. CSL-TR-91-486, August 199 I.Google Scholar
- 6.J.B. Burch and D.E.Long, "Efficient boolean function matching", In Proceedings of ICCAD, pp. 408--41 I, November 1992. Google ScholarDigital Library
- 7.H. Savoj ,M.J. Silva, R.K. Brayton and Alberto Sangiovanni- Vincentelli, "Boolean Matching in Logic Synthesis", In Proceedings of Euro-DAC, pp. 168-174, September 1992. Google ScholarDigital Library
- 8.Y. Matsunaga, "A new Algorithm for Boolean Matching Utilizing Structural Information", in Proceedings of SASIMI'93, pp. 366-373, October 1993.Google Scholar
- 9.R.E. Bryant, "Graph-based algorithms for boolean function manipulation", IEEE Transactions on Computer, C-35(12), 1986. Google ScholarDigital Library
Index Terms
On accelerating pattern matching for technology mapping
Recommendations
Matching by Tone Mapping: Photometric Invariant Template Matching
A fast pattern matching scheme termed matching by tone mapping (MTM) is introduced which allows matching under nonlinear tone mappings. We show that, when tone mapping is approximated by a piecewise constant/linear function, a fast computational scheme ...
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Baker and Bird and Baeza-Yates and Regnier are two of the most efficient and widely used algorithms for exact online two-dimensional pattern matching. Both use the automaton of the Aho-Corasick multiple pattern matching algorithm to locate all the ...
Order-preserving pattern matching with scaling
AbstractGiven a text T and a pattern P, the order-preserving pattern matching (OPPM for short) problem is to find all substrings of T which have the same relative orders as P. Recently, approximate OPPM that allows errors have been studied ...
Highlights- We propose a novel criteria for approximate order-preserving pattern matching.
- ...
Comments