Skip to main content
SpringerLink
Log in

On some representations of Boolean functions. Application to the theory of switching elements nets

  • Published:
Kybernetik Aims and scope Submit manuscript

Abstract

We consider three representations of a Boolean function, two of them in the real field and one in a Galois field modulo-2. By using these representations, an arbitrary Boolean function of n variables can always be expanded as a power series on the Boolean variables cut off to the n-th degree (n-form). Such representations are particularly useful for a unified treatment of the dynamics of a net of switching elements.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Akers, S. B.: On a theory of Boolean functions. J. Soc. Indust. Appl. Math. 7, 487 (1959).

    Google Scholar 

  • Caianiello, E. R., De Luca, A., Ricciardi, L. M.: Reverberations and control of neural networks. Kybernetik 4, 10 (1967).

    Google Scholar 

  • De Luca, A., Drago, A.: A new representation of linear and affine circuits. ICC Bull. 6, 133 (1967).

    Google Scholar 

  • Elspas, B.: Autonomous linear sequential networks. IRE Trans. Circuit Theory 6, 45 (1959).

    Google Scholar 

  • Householder, A. S.: Principles of numerical analysis. New York: McGraw-Hill, Inc. 1953.

    Google Scholar 

  • Hu, S. T.: Threshold logic. Los Angeles: University of California Press 1965.

    Google Scholar 

  • Huffman, D. A.: The synthesis of linear sequential networks. In: Linear sequential switching circuits (Kautz, ed.). San Francisco: Holden-Day, Inc. 1965.

    Google Scholar 

  • Hwa, H. R., Sheng, C. L.: An approach for realization of threshold functions of order r. IEEE Trans. Electronic Computers 18, 923 (1969).

    Google Scholar 

  • Ishida, H.: A non-linear threshold element. Proc. of IEEE (correspondence) 52, 1077 (1964).

    Google Scholar 

  • McCulloch, W. S., Da Fonseca, J. L.: Synthesis and linearization of non-linear feedback shift registers. Basis of a model of memory. M.I.T. Report (1967).

  • Muroga, S.: Majority logic and problems of probabilistic behavior. In: Self-organizing system (Yovits, M. C., Jacobi, G. T., and Goldstein, G. D., eds.). Washington: Spartan Books 1962.

    Google Scholar 

  • —: Lower bounds of the number of threshold functions and a maximum weight. IEEE Trans, on Electronic Computers 14, 136 (1965).

    Google Scholar 

  • Yajima, S., Ibaraky, T.: A lower bound of the number of threshold functions. IEEE Trans, on Electronic Computers (short notes) 14, 926 (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratorio di Cibernetica del C.N.R. (Arco Felice), Naples, Italy

    A. De Luca

Authors
  1. A. De Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Luca, A. On some representations of Boolean functions. Application to the theory of switching elements nets. Kybernetik 9, 1–10 (1971). https://doi.org/10.1007/BF00272553

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00272553

Keywords

Search

Navigation