DocumentCode :
1347550
Title :
On the polynomial form of Boolean functions: derivations and applications
Author :
Schneeweiss, Winfrid G.
Author_Institution :
Dept. of Comput. Sci., Fern Univ., Hagen, Germany
Volume :
47
Issue :
2
fYear :
1998
fDate :
2/1/1998 12:00:00 AM
Firstpage :
217
Lastpage :
221
Abstract :
After discussing a few derivations of the canonical, i.e., unique, polynomial form of a Boolean function, various interesting applications of this form are discussed. Mainly, the polynomial form is shown to be very useful for a deeper understanding of switching functions with emphasis on fault tolerant electronics systems
Keywords :
Boolean functions; fault tolerant computing; switching functions; Bonferroni inequalities; Boolean functions; Reed-Muller form; Shannon expansion; derivations; fault tolerance; fault tolerant; polynomial form; switching functions; Boolean algebra; Boolean functions; Equations; Failure analysis; Fault tolerance; Fault tolerant systems; Fault trees; Logic design; Polynomials; Probability;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.663768
Filename :
663768
Link To Document :
بازگشت