DocumentCode
928179
Title
Boolean matrix transforms for the minimization of modulo-2 canonical expansions
Author
Lui, P.K. ; Muzio, J.C.
Author_Institution
Dept. of Comput. Sci.,Victoria Univ., BC, Canada
Volume
41
Issue
3
fYear
1992
fDate
3/1/1992 12:00:00 AM
Firstpage
342
Lastpage
347
Abstract
Fast transforms for computing modulo-2 ring-sum canonical expansions of a Boolean function are described using Kronecker products of elementary Boolean matrices. These transforms unify and generalize existing ones in the literature. Previous algorithms which employ such transforms for finding a minimal fixed polarity expansion (FPE) are reviewed, analyzed, and extended to a minimal fixed basis expansion (FBE)
Keywords
Boolean functions; minimisation of switching nets; Boolean function; Boolean matrix transforms; Kronecker products; elementary Boolean matrices; minimal fixed basis expansion; minimal fixed polarity expansion; minimization of modulo-2 canonical expansions; Algorithm design and analysis; Arithmetic; Boolean functions; Circuits; Logic design; Logic gates; Minimization methods; Programmable logic arrays; Reflective binary codes; Terminology;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.127446
Filename
127446
Link To Document