Optimal Synthesis of Boolean Functions by Threshold Functions
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.
KeywordsBoolean Function Output Function Hide Node Output Node Node Function
Unable to display preview. Download preview PDF.
- 1.Winder, R.O.: Threshold Logic, Ph.D. dissertation, Department of Mathematics, Princeton University (1962)Google Scholar
- 2.Dertouzos, M.L.: Threshold Logic: A Synthesis Approach. The M.I.T. Press, Cambridge (1965)Google Scholar
- 4.Franco, L.: Generalization ability of Boolean functions implemented in feedforward neural networks. Neurocomputing (2006) (In Press)Google Scholar
- 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
- 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.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