Efficient spectral method for disjoint bi-decompositions of Boolean functions

Author

Falkowski, Bogdan J. ; Kannurao, Sudha

Author_Institution

Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore

Volume

2

fYear

2000

fDate

2000

Firstpage

313

Abstract

A method has been developed to find disjoint bi-decomposition of Boolean functions. From the knowledge of a subset of Walsh spectrum for a Boolean function and by checking some preliminary conditions, the new algorithm is applied to identify the type of bi-decomposition and its existence. All three types of bi-decomposition are considered including OR, AND and EXOR type. The new method is very efficient by using a filtering procedure that establishes quickly the lack of bi-decomposition from the knowledge of just a few Walsh spectral coefficients. The type of bi-decomposition and affirmation/negation of variables in its logic sub-functions are directly identified by manipulation on the reduced cubical representation of Boolean functions and their corresponding Walsh spectra

Keywords

Boolean functions; Hadamard transforms; logic CAD; AND type; Boolean functions; EXOR type; OR type; Walsh spectral coefficients; Walsh spectrum; disjoint bi-decompositions; filtering procedure; logic synthesis; reduced cubical representation; spectral method; Algebra; Benchmark testing; Boolean functions; Filtering; Input variables; Libraries; Logic devices; Programmable logic arrays; Programmable logic devices;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on

Conference_Location

Geneva

Print_ISBN

0-7803-5482-6

Type

conf

DOI

10.1109/ISCAS.2000.856324

Filename

856324