Cybernetics and Systems Analysis

, Volume 51, Issue 6, pp 969–977 | Cite as

Synthesis of Adaptive Logical Networks on the Basis of Zhegalkin Polynomials

SOFTWARE–HARDWARE SYSTEMS

Abstract

The authors consider the problem of adaptation of a logical network composed of universal logical elements to the solution of the problem of classification of input sets of binary vectors. The adaptation consists of determining types of logical functions for composite components of the logical network by representing it in the form of a polynomial whose coefficients are specified by a Hadamard matrix or a Zhegalkin polynomial.

Keywords

adaptation Boolean function universal logical element polynomial 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Palagin and V. N. Opanasenko, “Reconfigurable computing technology,” Cybernetics and Systems Analysis, 43, No. 5, 675–686 (2007).MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    N. M. Kussul, A. Yu. Shelestov, and A. M. Lavrenyuk, Intelligent Computations [in Ukrainian], Naukova Dumka, Kyiv (2006).Google Scholar
  3. 3.
    Y. P. Kondratenko and E. Gordienko, “Implementation of neural networks for adaptive control system on FPGA,” in: Proc. 23rd DAAAM Intern. Symp. on Intelligent Manufacturing and Automation, 23, No. 1 (2012), pp. 389–392.Google Scholar
  4. 4.
    A. Palagin, V. Opanasenko, and S. Krivoi, “The structure of FPGA-based cyclic-code converters,” Optical Memory & Neural Networks (Information Optics), 22, No. 4, 207–216 (2013).CrossRefGoogle Scholar
  5. 5.
    A. V. Palagin and V. N. Opanasenko, “Design and application of the PLD-based reconfigurable devices,” in: Design of Digital Systems and Devices, Series: Lecture Notes in Electrical Engineering, 79, 59–91 (2011).Google Scholar
  6. 6.
    V. N. Opanasenko and S. L. Kryvyi, “Partitioning the full range of Boolean functions based on the threshold and threshold relation,” Cybernetics and Systems Analysis, 48, No. 3, 459–468 (2012).MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    A. V. Palagin and V. N. Opanasenko, Reconfigurable Computing Systems [in Russian], Prosvita, Kyiv (2006).Google Scholar
  8. 8.
    V. N. Opanasenko, “Reconfigurable structures of “triangular matrix type,” in: Selected Scientific Papers of V. M. Glushkov Institute of Cybernetics of NAS of Ukraine: Technologies for Constructing Promising Computer Tools and Systems Using a Modern Element Base, Kyiv (2000), pp. 31–35.Google Scholar
  9. 9.
    V. N. Opanasenko, “Synthesis of a parametrical module of a multilevel combinational logic circuit,” Mathematical Machines and Systems, Nos. 1-2, 34–39 (2001).Google Scholar
  10. 10.
    J. Bruck and M. Blaum, “Neural networks, error-correcting codes, and polynomials over the binary n-cube,” IEEE Transactions on Information Theory, 35, No. 5, 976–987 (1989).MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    S. L. Kryvyi, “Algorithms for solving systems of linear Diophantine equations in integer domains,” Cybernetics and Systems Analysis, 42, No. 2, 163–175 (2006).MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.V. M. Glushkov Cybernetics InstituteNational Academy of Sciences of UkraineKyivUkraine
  2. 2.Taras Shevchenko National University of KyivKyivUkraine

Personalised recommendations