Optimal Synthesis of Boolean Functions by Threshold Functions

  • José Luis Subirats
  • Iván Gómez
  • José M. Jerez
  • Leonardo Franco
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4131)


We introduce a new method for obtaining optimal architectures that implement arbitrary Boolean functions using threshold functions. The standard threshold circuits using threshold gates and weights are replaced by nodes computing directly a threshold function of the inputs. The method developed can be considered exhaustive as if a solution exist the algorithm eventually will find it. At all stages different optimization strategies are introduced in order to make the algorithm as efficient as possible. The method is applied to the synthesis of circuits that implement a flip-flop circuit and a multi-configurable gate. The advantages and disadvantages of the method are analyzed.


Boolean Function Output Function Hide Node Output Node Node 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Winder, R.O.: Threshold Logic, Ph.D. dissertation, Department of Mathematics, Princeton University (1962)Google Scholar
  2. 2.
    Dertouzos, M.L.: Threshold Logic: A Synthesis Approach. The M.I.T. Press, Cambridge (1965)Google Scholar
  3. 3.
    Muroga, S.: Threshold Logic and its Applications. Wiley, New York (1971)MATHGoogle Scholar
  4. 4.
    Franco, L.: Generalization ability of Boolean functions implemented in feedforward neural networks. Neurocomputing (2006) (In Press)Google Scholar
  5. 5.
    Franco, L., Anthony, M.: The influence of oppositely classified examples on the generalization complexity of Boolean functions. IEEE Transactions on Neural Networks (2006) (In Press)Google Scholar
  6. 6.
    Siu, K.Y., Roychowdhury, V.P., Kailath, T.: Depth-Size Tradeoffs for Neural Computation. IEEE Transactions on Computers 40, 1402–1412 (1991)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Oliveira, A.L., Sangiovanni-Vincentelli, A.: LSAT: an algorithm for the synthesis of two level threshold gate networks. In: Proceedings of the ACM/IEEE International Conference on Computer Aided Design, Santa Clara, CA, pp. 130–133. IEEE Computer Society Press, Los Alamitos (1991)Google Scholar
  8. 8.
    Noth, W., Hinsberger, U., Kolla, R.: TROY: A Tree-Based Approach to Logic Synthesis and Technology Mapping. In: Proceedings of the 6th Great Lakes Symposium on VLSI, p. 188 (1996)Google Scholar
  9. 9.
    Zhang, R., Gupta, P., Zhong, L., Jha, N.K.: Threshold Network Synthesis and Optimization and Its Application to Nanotechnologies. IEEE Transactions on computer-aided design of integrated circuits and systems 24, 107–118 (2005)CrossRefGoogle Scholar
  10. 10.
    Beiu, V., Quintana, J.M., Avedillo, M.J.: LSI implementations of threshold logic - A comprehensive survey. IEEE Trans. Neural Networks 14, 1217–1243 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • José Luis Subirats
    • 1
  • Iván Gómez
    • 1
  • José M. Jerez
    • 1
  • Leonardo Franco
    • 1
  1. 1.Departamento de Lenguajes y Ciencias de la ComputaciónUniversidad de MálagaMálagaSpain

Personalised recommendations