Optimal-depth threshold circuits for multiplication and related problems

Multiplication is one of the most fundamental operations in arithmetic and algebraic computations. We present depth-optimal circuits for performing multiplication, multioperand addition, and symmetric function evaluation with small size and restricted fan-in. In particular, we show that the product of two n-bit numbers can be computed using a unit-weight threshold circuit of fan-in k, depth 3 log/sub k/n+log/sub 2/d/log/sub 2/(1+/spl radic/5)-1+o(log/sub k/n+logd)+O(1), and edge complexity O(n/sup 2+1/d/log(d+1)), for any integer d>0. All the circuits proposed in this paper have constant depth when log/sub k/n is a constant and are depth-optimal within small constant factors for any fan-in k.

[1]  D. H. Jacobsohn,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[2]  T. C. Chen,et al.  Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic , 1973, IEEE Transactions on Computers.

[3]  Earl E. Swartzlander.  Parallel Counters , 1973, IEEE Transactions on Computers.

[4]  Ravi B. Boppana,et al.  Threshold functions and bounded deptii monotone circuits , 1984, STOC '84.

[5]  Ravi B. Boppana,et al.  Threshold Functions and Bounded Depth Monotone Circuits , 1986, J. Comput. Syst. Sci..

[6]  Jehoshua Bruck.  Computing with networks of threshold elements , 1989 .

[7]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[8]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Jehoshua Bruck,et al.  Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..

[10]  J. Reif,et al.  On Threshold Circuits and Polynomial Computation , 1992, SIAM J. Comput..

[11]  Richard E. Ladner,et al.  The Complexity of Computing Symmetric Functions Using Threshold Circuits , 1992, Theor. Comput. Sci..

[12]  Noga Alon,et al.  Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition , 1994, SIAM J. Discret. Math..

[13]  Ian Parberry,et al.  Circuit complexity and neural networks , 1994 .

[14]  Thomas Kailath,et al.  Toward Massively Parallel Design of Multipliers , 1995, J. Parallel Distributed Comput..

[15]  T. Kailath,et al.  Discrete Neural Computation: A Theoretical Foundation , 1995 .

[16]  Stamatis Vassiliadis,et al.  2-1 Additions and Related Arithmetic Operations with Threshold Logic , 1996, IEEE Trans. Computers.

[17]  Chi-Hsiang Yeh,et al.  Efficient pipelined multi-operand adders with high throughput and low latency: designs and applications , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

[18]  C. Yeh,et al.  New Efficient Majority Circuits for the Computation of Some Basic Arithmetic Functions 1 , 1996 .

[19]  Emmanouel A. Varvarigos,et al.  Depth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation , 1996, COCOON.

[20]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .