Boolean Function Matching using Walsh Spectral Decision Diagrams

Moore, Jason; Fazel, K.; Thornton, Mitchell A.; Miller, David M.

doi:10.1109/dcas.2006.321050

Cited by 7 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared with studies based on the previous three methods, studies on Boolean matching that use spectral techniques are fewer in number. Moore et al [21] presented an NPN Boolean matching algorithm using Walsh spectra. The authors of [22] utilized Haar spectra to check the equivalence of two logic circuits.…”

Section: Related Workmentioning

confidence: 99%

A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature

et al. 2018

View full text Add to dashboard Cite

In this paper, we address an NPN Boolean matching algorithm. The proposed structural difference signature (SDS) of a Boolean function significantly reduces the search space in the Boolean matching process. The paper analyses the size of the search space from three perspectives: the total number of possible transformations, the number of candidate transformations and the number of decompositions. We test the search space and run time on a large number of randomly generated circuits and Microelectronics Center of North Carolina (MCNC) benchmark circuits with 7–22 inputs. The experimental results show that the search space of Boolean matching is greatly reduced and the matching speed is obviously accelerated.

show abstract

Section: Related Workmentioning

confidence: 99%

A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature

et al. 2018

View full text Add to dashboard Cite

show abstract

“…A few other methods exist for solving the Boolean matching problem. In [23], the authors studied NPN Boolean matching using a Walsh Spectral Decision Diagram, and achieved an efficiency higher than that of Luks' hypergraph method. Lai et al [24] utilized a conflict-driven learning method to solve the multiple-output Boolean function matching problem.…”

Section: Related Workmentioning

confidence: 99%

A Canonical-based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature

Zhang

Yang

Hung

et al. 2017

Preprint

View full text Add to dashboard Cite

This paper presents a new compact canonical-based algorithm to solve the problem of single-output completely specified NPN Boolean matching. We propose a new signature vector Boolean difference and cofactor (DC) signature vector. Our algorithm utilizes the Boolean difference, cofactor signature and symmetry properties to search for canonical transformations. The use of symmetry and Boolean difference notably reduces the search space and speeds up the Boolean matching process compared to the algorithm proposed in [1]. We tested our algorithm on a large number of circuits. The experimental results showed that the average runtime of our algorithm 37% higher and its average search space 67% smaller compared to [1] when tested on general circuits.

show abstract

“…One of the reasons for this renewed interest in spectral coefficients is that researchers such as Hansen and Sekine [18] have suggested new synthesis techniques based on the spectral coefficients of a function. Other work in this area includes techniques for Boolean matching [19], in reversible logic synthesis [20,21], and in multiple-valued applications [22]. The reader is directed to [23] for further details on advancements in spectral techniques in this field as well as various works by Falkowski and Yan including [24,25].…”

Section: Related Workmentioning

confidence: 99%

New Considerations for Spectral Classification of Boolean Switching Functions

2011

View full text Add to dashboard Cite

This paper presents some new considerations for spectral techniques for classification of Boolean functions. These considerations incorporate discussions of the feasibility of extending this classification technique beyond n = 5. A new implementation is presented along with a basic analysis of the complexity of the problem. We also note a correction to results in this area that were reported in previous work.

show abstract

Boolean Function Matching using Walsh Spectral Decision Diagrams

Abstract: ABSTRACT

Cited by 7 publications

References 9 publications

A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature

A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature

A Canonical-based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature

New Considerations for Spectral Classification of Boolean Switching Functions

Contact Info

Product

Resources

About