ScholarLens Back to search
1995•Proceedings - ACM IEEE Design Automation ConferenceRequires access

Boolean Matching for Incompletely Specified Functions

Kuo‐Hua Wang

Open publisher page 0 citations

Abstract

Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. In this paper, we will address Boolean matching problem for incompletely specified functions. We will formulate the searching of input variable mapping between two target functions as a logic equation by using multiple-valued function. Based on this equation, a Boolean matching algorithm will be proposed. Delay and power dissipation can also be taken into consideration when this method is used for technology mapping. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving Boolean matching problem for incompletely specified functions.

About this research paper

What this paper is about

Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. In this paper, we will address Boolean matching problem for incompletely specified functions. We will formulate the searching of input variable mapping between two target functions as a logic equation by using multiple-valued function. Based on this equation, a Boolean matching algorithm will be proposed. Delay and power dissipation can also be taken into consideration when this method is used for technology mapping. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving Boolean matching problem for incompletely specified functions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. In this paper, we will address Boolean matching problem for incompletely specified functions. We will formulate the searching of input variable mapping between two target functions as a logic equation by using multiple-valued function. Based on this equation, a Boolean matching algorithm will be proposed. Delay and power dissipation can also be taken into consideration when this method is used for technology mapping. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving Boolean matching problem for incompletely specified functions.

Key concepts: Boolean function, Product term, Boolean network, Boolean expression, Maximum satisfiability problem, And-inverter graph, Standard Boolean model, Boolean circuit

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Boolean Matching for Incompletely Specified Functions — Research Paper | ScholarLens