This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2-1 Addition and Related Arithmetic Operations with Threshold Logic
September 1996 (vol. 45 no. 9)
pp. 1062-1067

Abstract—In this paper we investigate the reduction of the size for small depth feed-forward linear threshold networks performing binary addition and related functions. For n bit operands we propose a depth-3 $O({\textstyle{{n^2} \over {\log\,n}}})$ asymptotic size network for the binary addition with polynomially bounded weights. We propose also a depth-3 addition of optimal O(n) asymptotic size network and a depth-2 comparison of $O({\sqrt n})$ asymptotic size network, both with $O(2^{\sqrt n})$ asymptotic size of weight values. For existing architectural formats we show that our schemes, with equal or smaller depth networks, substantially outperform existing schemes in terms of size and fan-in requirements and on occasions in weight requirements.

[1] S. Muroga, "The Principle of Majority Decision Elements and the Complexity of their Circuits," Proc. Int'l Conf. Information Processing, pp. 400-407, UNESCO House, Paris, June 1959.
[2] R. Minnick, "Linear-Input Logic," IRE Trans. Electronic Computers, vol. 10, pp. 6-16, Mar. 1961.
[3] S. Muroga, "Threshold Logic and its Applications," John Wiley and Sons, 1971.
[4] K.-Y. Siu, V.P. Roychowdhury, and T. Kailath, “Depth-Size Tradeoffs for Neural Computation,” IEEE Trans. Computers, vol. 40, no. 12, pp. 1,402-1,412, Dec. 1991.
[5] N. Alon and J. Bruck, "Explicit Construction of Depth-2 Majority Circuits for Comparison and Addition," Technical Report RJ 8300 (75661), IBM Research Division, Aug. 1991.
[6] S. Cotofana and S. Vassiliadis, "Periodic Symmetric Functions with Feed-Forward Neural Networks," NEURAP '95/'96 Neural Networks and their Applications, pp. 215-221,Marseille, Mar. 1996.
[7] T. Shibata and T. Ohmi, “A Functional MOS Transistor Featuring Gate-Level Weighted Sum and Threshold Operations,” IEEE Trans. Electron Devices, vol. 39, pp. 1,444-1,455, June 1992.
[8] T. Shibata and T. Ohmi, “Neuron MOS Binary-Logic Integrated Circuits—Part I: Design Fundamentals for Soft-Hardware Circuit Implementation,” IEEE Trans. Electron Devices, vol. 40, pp. 570-575, Mar. 1993.
[9] M. Jackson, Software Requirements and Specifications, Addison-Wesley, Reading, Mass., 1995.
[10] K. Siu and J. Bruck, "On the Power of Threshold Circuits with Small Weights," SIAM J. Discrete Math., pp. 423-435, Aug. 1991.
[11] V. Roychowdhury, A. Orlitsky, and K. Y. Siu, "Lower Bounds on Threshold and Related Circuits via Communication Complexity," IEEE Trans. Information Theory, vol. 40, no. 2, pp. 467-474, Mar. 1994.

Index Terms:
Computer arithmetic, binary adders, binary comparison, majority circuits, threshold logic, neural networks.
Citation:
Stamatis Vassiliadis, Sorin Cotofana, Koen Bertels, "2-1 Addition and Related Arithmetic Operations with Threshold Logic," IEEE Transactions on Computers, vol. 45, no. 9, pp. 1062-1067, Sept. 1996, doi:10.1109/12.537130
Usage of this product signifies your acceptance of the Terms of Use.