Giovanni Agosta
ABSTRACT
In this paper, we face the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the canonical form-based approaches to the problem.
As a first major contribution, we show how these approaches are particular cases of a single generic algorithm, parametric with respect to a given linear transformation of the input function.
As a second major contribution, we identify a linear transformation that can be used to significantly speed up Boolean matching with respect to the state of the art. Experimental results show that, on average, our approach is five times faster than the main competitor on 20-variables input functions, and scales better, allowing to match even larger components.
- Afshin Abdollahi and Massoud Pedram. A new canonical form for fast boolean matching in logic synthesis and verification. In DAC '05: Proceedings of the 42nd annual conference on Design automation, pages 379--384, New York, NY, USA, 2005. ACM Press. Google Scholar
Digital Library
- Ken G. Beauchamp. Applications of Walsh and Related Functions. Academic Press, 1984.Google Scholar
- Luca Benini and Giovanni De Micheli. A survey of Boolean matching techniques for library binding. ACM Trans. Des. Autom. Electron. Syst., 2(3): 193--226, 1997. Google ScholarDigital Library
- Jerry R. Burch and David E. Long. Efficient Boolean function matching. In ICCAD '92: Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, pages 408--11, Los Alamitos, CA, USA, 1992. IEEE Computer Society Press. Google ScholarDigital Library
- Donald Chai and Andreas Kuehlmann. Building a better Boolean matcher and symmetry detector. In DATE '06: Proceedings of the conference on Design, automation and test in Europe, pages 1079--1084, 3001 Leuven, Belgium, Belgium, 2006. European Design and Automation Association. Google ScholarDigital Library
- Jovanka Ciric and Carl Sechen. Efficient canonical form for Boolean matching of complex functions in large libraries. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 22(5):535--544, May 2003. Google ScholarDigital Library
- Debatosh Debnath and Tsutomu Sasao. Efficient computation of canonical form for Boolean matching in large libraries. In Masaharu Imai, editor, ASP-DAC, pages 591--596. IEEE, 2004. Google ScholarDigital Library
- C. R. Edwards and S. L. Hurst. A digital synthesis procedure under function symmetries and mapping methods. IEEE Trans. Comp., (11):985--997, Nov 1978. Google ScholarDigital Library
- Serge Lang. Linear Algebra. Addison Wesley, 1966.Google Scholar
- Janett Mohnke, Paul Molitor, and Sharad Malik. Limits of using signatures for permutation independent Boolean comparison. In ASP-DAC '95: Proceedings of the 1995 conference on Asia Pacific design automation (CD-ROM), page 74, New York, NY, USA, 1995. ACM Press. Google ScholarDigital Library
- Fabio Somenzi. CUDD: CU Decision Diagram Package. http://vlsi.colorado.edu/fabio/CUDD/.Google Scholar
Index Terms
- A unified approach to canonical form-based Boolean matching
Recommendations
An efficient cost-based canonical form for Boolean matching
GLSVLSI '07: Proceedings of the 17th ACM Great Lakes symposium on VLSIIn this paper, we present new canonical forms for P, NP and NPN equivalence relations on boolean functions. The canonical forms are based on the minimization of a cost function. With respect to previous approaches based on cost minimization, our ...
Efficient computation of canonical form for Boolean matching in large libraries
ASP-DAC '04: Proceedings of the 2004 Asia and South Pacific Design Automation ConferenceThis paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR); two functions ...
Efficient Computation of Canonical Form under Variable Permutation and Negation for Boolean Matching in Large Libraries
This paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR): two functions ...
Comments