Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 1990 | Published
Book Section - Chapter Open

Fast arithmetic computing with neural networks

Abstract

The authors introduce a restricted model of a neuron which is more practical as a model of computation then the classical model of a neuron. The authors define a model of neural networks as a feedforward network of such neurons. Whereas any logic circuit of polynomial size (in n) that computes the product of two n-bit numbers requires unbounded delay, such computations can be done in a neural network with constant delay. The authors improve some known results by showing that the product of two n-bit numbers and sorting of n n-bit numbers can both be computed by a polynomial size neural network using only four unit delays, independent of n . Moreover, the weights of each threshold element in the neural networks require only O(log n)-bit (instead of n-bit) accuracy.

Additional Information

© 1990 IEEE. Date of Current Version: 06 August 2002. This work was done while the author was a research student associate at IBM Almaden Research Center and was supported in part by the Joint Services Program at Stanford University (US Army, US Navy, US Air Force) under Contract DAAL03-88-C-0011, and the Department of the Navy (NAVELEX) under Contract N00039-84-C-0211, NASA Headquarters, Center for Aeronautics and Space Information Sciences under Grant NAGW-419-S6. The first author would like to thank Prof. Thomas Kailath for his guidance, constant encouragement, and financial support.

Attached Files

Published - SIUtencon90.pdf

Files

SIUtencon90.pdf
Files (307.6 kB)
Name Size Download all
md5:c1731cfb285a65050d037615b26a545b
307.6 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 17, 2023