Abstract
In this paper we investigate δ-bit serial addition in the context of feed-forward linear threshold gate based networks. We show that twon-bit operands can be added in\(2\left\lceil {\sqrt n } \right\rceil \) overall delay with a feed-forward network constructed with\(\left\lceil {\sqrt n } \right\rceil + 1\) linear threshold gates and\(\frac{1}{2}\left( {5\left\lceil {\sqrt n } \right\rceil ^2 + 9\left\lceil {\sqrt n } \right\rceil } \right) + 2\) latches. The maximum weight value is\(2^{\left\lceil {\sqrt n } \right\rceil } \) and the maximum fan-in is\(3\left\lceil {\sqrt n } \right\rceil + 1\). We also investigate the implications our scheme have to the performance and the cost under small weights and small fan-in requirements. We deduce that if the weight values are to be limited by a constantW, twon-bit operands can be added in\(\left[ {\log W} \right] + \tfrac{n}{{\left[ {\log W} \right]}}\) overall delay with a feed-forward network that has the implementation cost [logW]+1, in terms of linear threshold gates,\(\tfrac{1}{2}(5[\log W]^2 + 9[\log W]) + 2\) in terms of latches and a maximum fan-in of 3[logW]+1. We also prove that, if the fan-in values are to be limited by a constantF+1, twon-bit operands can be added in\([\tfrac{F}{3}] + \tfrac{n}{{[\tfrac{F}{3}]}}\) overall delay with a feed-forward network that has the implementation cost\([\tfrac{F}{3}] + 1\), in terms of linear threshold gates,\(\tfrac{1}{2}(5[\tfrac{F}{3}]^2 + 9[\tfrac{F}{3}]) + 2\) in terms of latches, and a maximum weight value of\(2^{[\tfrac{F}{3}]} \). An asymptotic bound of\(O(\tfrac{n}{{\log n}})\) is derived for the addition overall delay in the case that the weight values have to be linearly bounded, i.e., in the order ofO(n). The implementation cost in this case is in the order ofO(logn), in terms of linear threshold gates, and in the order ofO(log2 n), in terms of latches. The maximum fan-in is in the order ofO(logn). Finally, a partition technique, that substantially reduces the overall cost of the implementation for all the schemes in terms of delay, latches, weights, and fan-in with some few additional threshold gates, is also presented.
Similar content being viewed by others
References
M. Ercegovac, “On-line arithmetic: An overview,” inReal Time Signal Processing VII, Vol. 495, pp. 86–93, SPIE, 1984.
J. Muller, “On-line computing: A survey and some new results,” inAlgorithms and Parallel VLSI Architectures II, P. Quinton and Y. Robert (Eds.), pp. 261–272, Elsevier, 1992.
M.J. Irwin and R.M. Owens, “Digit-pipelined arithmetic as illustrated by the paste-up system: A tutorial,”IEEE Computer, No. 1, pp. 61–73, 1987.
M.J. Irwin and R.M. Owens, “A case for digit serial VLSI signal processing,”Journal of VLSI Signal Processing, No. 1, pp. 321–334, 1990.
K. Trivendi and M. Ercegovac, “On-line algorithms for division and multiplication,”IEEE Transactions on Computers, Vol. C-26, pp. 681–687, July 1977.
V. Oklobdzija and M. Ercegovac, “An on-line square root algorithm,”IEEE Transactions on Computers, Vol. C-31, pp. 70–75, Jan. 1982.
N. Strader and V. Rhyne, “A canonical bit-sequential multiplier,”IEEE Transactions on Computers, Vol C-31, pp. 791–795, Aug. 1982.
L. Dadda, “Fast multipliers for two's-complement numbers in serial form,” inIEEE 7th Symposium of Computer Arithmetic, pp. 57–63, 1985.
L. Dadda, “Squarers for binary numbers in serial form,” inIEEE 7th Symposium on Computer Arithmetic, pp. 173–180, 1985.
L. Dadda, “On serial-input multipliers for two's-complement numbers,”IEEE Transactions on Computers, Vol. C-38, pp. 1341–1345, Sept. 1989.
R. North and W. Ku, “β-bit serial/parallel multipliers,”Journal of VLSI Signal Processing, No. 2, pp. 219–233, 1991.
T. Shibata and T. Ohmi, “A functional MOS transistor featuring gate-level weighted sum and threshold operations,”IEEE Transactions on Electron Devices, Vol. 39, pp. 1444–1455, June 1992.
T. Shibata and T. Ohmi, “Neuron MOS binary-logic integrated circuits—Part I: Design fundamentals for soft-hardware circuit implementation,”IEEE Transactions on Electron Devices, Vol. 40, pp. 570–575, March 1993.
T. Shibata and T. Ohmi, “Neuron MOS binary-logic integrated circuits—Part II: Simplifying techniques of circuit configuration and their practical applications,”IEEE Transactions on Electron Devices, Vol. 40, pp. 974–979, May 1993.
W.S. McCulloch and W. Pitts, “A logical calculus of the ideas immanent in nervous activity,”Bulletin of Mathematical Biophysics, Vol. 5, pp. 115–133, 1943 (Reprinted in “Neurocomputing Foundations of Research”, J.A. Anderson and E. Rosenfeld (Eds.), The MIT Press, 1988).
W. Pitts and W.S. McCulloch, “How we know universals: The perception of auditory and visual forms”Bulletin of Mathematical Biophysics, Vol. 9, pp. 127–147, 1947, (Reprinted in “Neurocomputing Foundations of Research,” J.A. Anderson and E. Rosenfeld (Eds.), The MIT Press, 1988).
K. Siu, V. Roychowdhury, and T. Kailath, “Depth-size tredeoffs for neural computation,”IEEE Transactions on Computers, Vol. 40, No. 12, Dec. 1991.
K.Y. Siu and J. Bruck, “Neural computation of arithmetic functions,”Proc. IEEE, Vol. 78, pp. 1669–1675, Oct. 1990.
S. Vassiliadis, S. Cotofana, and J. Hoekstra, “Block save addition with threshold logic,” inIEEE 29th Asilomar Conference on Signals, Systems and Computers, Oct. 1995.
S. Vassiliadis, S. Cotofana, and K. Bertels, “2-1 addition and related arithmetic operations with threshold logic,”IEEE Transaction on Computers, Vol. 45, No. 9, Sept. 1996.
W. Kautz, “The realization of symmetric switching functions with linear-input logical elements,”IRE Transaction on Electronic Computers, Vol. EC-10, pp. 371–378, Sept. 1961.
S. Cotofana and S. Vassiliadis, “Periodic symmetric functions with feed-forward neural networks,” inNEURAP '95/96 Neural Networks and their Applications, Marseille, March 1996, pp. 215–221.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cotofana, S., Vassiliadis, S. δ-Bit serial binary addition with linear threshold networks. J VLSI Sign Process Syst Sign Image Video Technol 14, 249–264 (1996). https://doi.org/10.1007/BF00929619
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00929619