This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Polynomial Form of Boolean Functions: Derivations and Applications
February 1998 (vol. 47 no. 2)
pp. 217-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.

[1] S.K. Kumar and M.A. Breuer, “Probabilistic Aspects of Boolean Switching Functions via a New Transform,” J. ACM, vol. 28, pp. 502-520, 1981.
[2] W.G. Schneeweiss, Boolean Functions with Engineering Applications and Computer Programs, chapter 7. New York: Springer-Verlag, 1989.
[3] W. Schneeweiss, "Calculating the Probability of Boolean Expression Being 1," IEEE Trans. Reliability, vol. 26, pp. 16-22, 1977.
[4] P. Hammer (Ivanescu) and S. Rudeanu, Boolean Methods in Operations Research.Berlin: Springer, 1968.
[5] W. Schneeweiss and U. Niessen-Gillhaus, "Fehlerbaum-Auswertung auf der Basis von zwei Versionen der Shannon-Zerlegung (Fault Tree Evaluation Based on Two Versions of the Shannon Decomposition)," Proc. Techn. Zuverlaessigkeit 1991, pp. 31-41.Berlin: VDE-Verlag, 1991.
[6] W. Enzmann, "Ein Algorithmus zur Berechnung von Zuverlaessigkeitsdaten komplexer redundanter Systeme," Angewandte Informatik, pp. 493-499, 1973.
[7] J. Jain, J. Abraham, J. Bitner, and D. Fussell, "Probabilistic Verification of Boolean Functions," Formal Methods in System Design, vol. 1, pp. 61-115, 1992.
[8] R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C-35, No. 8, Aug. 1986, pp. 667-690.
[9] G. Boole, The Laws of Thought.London: Macmillan, 1854, New York: Dover, 1958.
[10] W. Schneeweiss, Zuverlaessigkeitstheorie (Reliability Theory).Berlin: Springer, 1973.
[11] W. Schneeweiss, "SyRePa'89—A Package of Programs for Systems Reliability Evaluations," Informatik-Rep. 91, Fern Univ., Hagen, Germany, 1990.
[12] J. Abraham, "An Improved Algorithm for Network Reliability," IEEE Trans. Reliability, vol. 28 pp. 58-61, 1979.
[13] W. Schneeweiss, "Approximate Fault Tree Analysis with Prescribed accuracy," IEEE Trans. Reliability, vol. 36, pp. 250-254, 1987.
[14] W. Schneeweiss, "Approximate Fault Tree Analysis without Cutsets," Proc. Ann. Reliability and Maintainability Symp. 1993, pp. 370-375.New York: IEEE, 1993.
[15] W. Schneeweiss, "A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions; with Deterministic and Stochastic Applications," IEEE Trans. Computers, vol. 45, pp. 1,300-1,302, 1996.
[16] O. Coudert and J. Madre, "Fault-Tree Analysis: 1020 Prime Implicants and Beyond," Proc. Ann. Reliability and Maintainability Symp. 1993, pp. 240-245.New York: IEEE, 1993.
[17] W. Schneeweiss, "Modularization of Fault Trees for Determining Mean Life of Non-Repaired Electronics Systems," Proc. RELECTRONIC 95, pp. 85-94,Budapest, 1995.
[18] H. Liu, W. Yang, and C. Liu, "An Improved Minimization Algorithm for the Summation of Disjoint Products by Shannon's Expansion," Microelectronics and Reliability, vol. 33, pp. 599-613, 1993.
[19] W. Schneeweiss, "Limited Usefulness of BDDs for Mean Failure Frequency Calculation," JESA, vol. 30, pp. 1,131-1,136, 1996.

Index Terms:
Boolean function, polynomial form, Shannon expansion, fault tolerance, Reed-Muller form, Bonferroni inequalities.
Citation:
Winfrid G. Schneeweiss, "On the Polynomial Form of Boolean Functions: Derivations and Applications," IEEE Transactions on Computers, vol. 47, no. 2, pp. 217-221, Feb. 1998, doi:10.1109/12.663768
Usage of this product signifies your acceptance of the Terms of Use.