• DocumentCode
    2299879
  • Title

    Fast arithmetic computing with neural networks

  • Author

    Siu, Kai-Yeung ; Bruck, Jehoshua

  • Author_Institution
    Inf. Syst. Lab., Stanford Univ., CA, USA
  • fYear
    1990
  • fDate
    24-27 Sep 1990
  • Firstpage
    28
  • 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
  • Keywords
    computational complexity; digital arithmetic; neural nets; arithmetic computing; computational complexity; feedforward network; neural networks; threshold element; Arithmetic; Computer networks; Contracts; Integrated circuit interconnections; Logic circuits; Neural networks; Neurons; Pattern classification; Polynomials; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on
  • Print_ISBN
    0-87942-556-3
  • Type

    conf

  • DOI
    10.1109/TENCON.1990.152559
  • Filename
    152559