This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Signed Digit Addition and Related Operations with Threshold Logic
March 2000 (vol. 49 no. 3)
pp. 193-207

Abstract—Assuming signed digit number representations, we investigate the implementation of some addition related operations assuming linear threshold networks. We measure the depth and size of the networks in terms of linear threshold gates. We show first that a depth-$2$ network with $O(n)$ size, weight, and fan-in complexities can perform signed digit symmetric functions. Consequently, assuming radix-$2$ signed digit representation, we show that the two operand addition can be performed by a threshold network of depth-$2$ having $O(n)$ size complexity and $O(1)$ weight and fan-in complexities. Furthermore, we show that, assuming radix-$(2n-1)$ signed digit representations, the multioperand addition can be computed by a depth-$2$ network with $O(n^3)$ size with the weight and fan-in complexities being polynomially bounded. Finally, we show that multiplication can be performed by a linear threshold network of depth-$3$ with the size of $O(n^3)$ requiring $O(n^3)$ weights and $O(n^2 \log n)$ fan-in.

[1] A. Avizienis, “Signed-Digit Number Representations for Fast Parallel Arithmetic,” IRE Trans. Electronic Computers, vol. 10, pp. 389-400, Sept 1961.
[2] C. Chow and J. Robertson, “Logic Design of a Redundant Binary Adder,” Proc. Fourth Symp. Computer Arithmetic, pp. 109-115, Oct. 1978.
[3] N. Takagi,H. Yasuura,, and S. Yajima,“High-speed VLSI multiplication algorithm with a redundant binary addition tree,” IEEE Trans. Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985.
[4] M.D. Ercegovac and T. Lang, “Fast Radix-2 Division with Quotient-Digit Prediction,” J. VLSI Signal Processing, vol. 1, pp. 169-180, Nov. 1989.
[5] M.D. Ercegovac and T. Lang,“Simple radix-4 division with operands scaling,” IEEE Trans. Computers, vol. 39, no. 9, pp. 1,204-1,207, Sept. 1990.
[6] L. Ciminiera and P. Montuschi, “High Radix Square Rooting,” IEEE Trans. Computers, vol. 39, no. 10, pp. 1,220-1,231, Oct. 1990.
[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] H. Ozdemir, A. Kepkep, B. Pamir, Y. Leblebici, and U. Cilingiroglu, “A Capacitive Threshold-Logic Gate,” IEEE J. Solid-State Circuits, vol. 31, pp. 1,141-1,150, Aug. 1996.
[11] W.S. McCulloch and W. Pitts, “A Logical Calculus of the Ideas Immanent in Nervous Activity,” Bulletin Math. Biophysics 5, pp. 115-133, 1943 (reprinted in Neurocomputing Foundations of Research, J.A. Anderson and E. Rosenfeld, eds. MIT Press, 1988 ).
[12] W. Pitts and W.S. McCulloch, “How We Know Universals: The Perception of Auditory and Visual Forms,” Bulletin Math. Biophysics 9, pp. 127-147, 1947 (reprinted in Neurocomputing Foundations of Research, J.A. Anderson and E. Rosenfeld, eds. MIT Press, 1988 ).
[13] K.Y. Siu and J. Bruck, “Neural Computation of Arithmetic Functions,” Proc. IEEE, vol. 78, no. 10, pp. 1,669-1,675, Oct. 1990.
[14] T. Hofmeister, W. Hohberg, and S. Kohling, “Some Notes on Threshold Circuits and Multiplication in Depth 4,” Information Processing Letters, vol. 39, pp. 219-225, 1991.
[15] R. Lauwereins and J. Bruck, “Efficient Implementation of a Neural Multiplier,” Proc. Second Int'l Conf. Microelectronics for Neural Networks, pp. 217-230, Oct. 1991.
[16] 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.
[17] S. Vassiliadis, S. Cotofana, and K. Bertels, “$2-1$Addition and Related Arithmetic Operations with Threshold Logic,” IEEE Trans. Computers, vol. 45, no. 9, pp. 1,062-1,068, Sept. 1996.
[18] S. Cotofana and S. Vassiliadis, “$\delta$-bit Serial Addition with Linear Threshold Gates,” J. VLSI Signal Processing, vol. 3, pp. 249-264, Dec. 1996.
[19] Y. Leblebici, H. Ozdemir, A. Kepkep, and U. Cilingiroglu, “A Compact High-Speed$(31,5)$Parallel Counter Circuit Based on Capacitive Threshold-Logic Gates,” IEEE J. Solid-State Circuits, vol. 31, pp. 1,177-1,183 Aug. 1996.
[20] W. Weber, S. Prange, R. Thewes, E. Wohlrab, and A. Luck, “On the Application of the Neuron MOS Transistor Principle for Modern VLSI Design,” IEEE Trans. Electron Devices, vol. 43, pp. 1,700-1,708, Oct. 1996.
[21] S. Cotofana and S. Vassiliadis, “Periodic Symmetric Functions with Feed-Forward Neural Networks,” Proc. NEURAP '95/96 Neural Networks and Their Applications, pp. 215-221, Mar. 1996.
[22] S. Muroga, “The Principle of Majority Decision Elements and the Complexity of Their Circuits,” Proc. Int'l Conf. Information Processing, pp. 400-407, June 1959.
[23] R. Minnick, “Linear Input Logic,” IEEE Trans. Electronic Computers, vol. 10, pp. 6-16, Mar. 1961.
[24] W. Kautz, “The Realization of Symmetric Switching Functions with Linear-Input Logical Elements,” IRE Trans. Electronic Computers, vol. 10, pp. 371-378, Sept. 1961.
[25] R. Paturi and M. Saks, “On Threshold Circuits for Parity,” Proc. IEEE Symp. Foundations of Computer Science, pp. 397-404, Oct. 1990.
[26] S. Vassiliadis, J. Hoekstra, and S. Cotofana, “Block Save Addition with Telescopic Sums,” Proc. 21st Euromicro Conf., pp. 701-707, Sept. 1995.
[27] K. Hwang,Computer Arithmetic, Principles, Architecture, and Design.New York: John Wiley&Sons, 1979.
[28] S. Cotofana and S. Vassiliadis, “$2|1$Redundant Binary Addition with Threshold Logic,” Proc. IEEE 30th Asilomar Conf. Signals, Systems, and Computers, pp. 889-893, Nov. 1996.
[29] S. Vassiliadis, S. Cotofana, and J. Hoekstra, “Block Save Addition with Threshold Logic,” IEEE 29th Asilomar Conf. Signals, Systems, and Computers, pp. 575-579, Oct. 1995.
[30] K.-Y. Siu and V.P. Roychowdhury, “On Optimal Depth Threshold Circuits for Multiplication and Related Problems,” SIAM J. Discrete Math., vol. 7, pp. 284-292, May 1994.
[31] M. Goldmann, J. Håstad, and A. Razborov, “Majority Gates vs. General Weighted Threshold Gates,” Proc. Seventh Ann. Conf. Structure in Complexity Theory (SCTC '92), pp. 2-13, June 1992.
[32] M. Goldmann and M. Karpinski, “Simulating Threshold Circuits by Majority Circuits,” SIAM J. Computing, vol. 27, pp. 230-246, Feb. 1998.
[33] T. Hofmeister, “A Note on the Simulation of Exponential Threshold Weights,” Proc. COCOON: Ann. Int'l Conf. Computing and Combinatorics, pp. 136-141, 1996.

Index Terms:
Computer arithmetic, signed-digit number representation, signed-digit arithmetic, carry-free addition, redundant adders, redundant multipliers, threshold logic, neural networks.
Citation:
Sorin Cotofana, Stamatis Vassiliadis, "Signed Digit Addition and Related Operations with Threshold Logic," IEEE Transactions on Computers, vol. 49, no. 3, pp. 193-207, March 2000, doi:10.1109/12.841124
Usage of this product signifies your acceptance of the Terms of Use.