Advertisement

Cybernetics and Systems Analysis

, Volume 32, Issue 6, pp 794–803 | Cite as

Polynomial expansion of symmetric boolean functions by the table method

  • L. B. Avgul'
Cybernetics
  • 29 Downloads

Conclusion

The proposed method for polynomial expansion of SBF based on construction of the triangular tableTn(π(F)) of local codes of its derivatives has the lowest computational complexity among known methods. Constructing the table only once, the method easily determines all the “residual” functions ϑ rl km for various expansion parametersk andm.

Another advantage of the method is its applicability for polynomial expansion of arbitrary BF and partially symmetric BF. In this case, the base of the “triangle” is the truth table of the arbitrary BF or the local code (including convolved local code) of the partially symmetric BF.

The method can be successfully used for the synthesis of a wide class of digital networks.

Keywords

Operating System Artificial Intelligence Computational Complexity System Theory Boolean Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. S. Yau and Y. S. Tang, “Transformation of an arbitrary switching function to a totally symmetric function,” IEEE Trans. Comput.,C20, No. 12, 1606–1609 (1971).MathSciNetGoogle Scholar
  2. 2.
    W. H. Kautz, “The realization of symmetric switching function with linear-input logical elements,” IRE Trans. Electron. Comput.,EC-10, No. 9, 371–378 (1961).MathSciNetGoogle Scholar
  3. 3.
    V. P. Suprun, “Polynomial expansion of symmetric Boolean functions,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 4, 123–127 (1985).MATHMathSciNetGoogle Scholar
  4. 4.
    L. B. Avgul' and V. P. Suprun, “Generalized polynomial expansion of symmetric Boolean functions,” Kibernetika, No. 1, 122–125 (1991).MathSciNetGoogle Scholar
  5. 5.
    O. B. Lupanov, “An approach to control system synthesis: local coding principle,” Probl. Kibern., No. 14, 31–110 (1965).MATHMathSciNetGoogle Scholar
  6. 6.
    L. B. Avgul' and V. P. Suprun, “Decomposition of Boolean functions by polynomial expansion,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 3, 187–191 (1989).Google Scholar
  7. 7.
    L. B. Avgul', N. A. Egorov, O. B. Podrubnyi, and S. M. Tereshko, “A threshold device,” Soviet patent 1741126 USSR, MKI G06F7/04, Byulleten',22 (15.06.92).Google Scholar

Copyright information

© Plenum Publishing Corporation 1997

Authors and Affiliations

  • L. B. Avgul'

There are no affiliations available

Personalised recommendations