Optimal practical adders using perceptrons

No abstract is available for this paper.

• Publication year

  2003

• Venue

  International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ICNNSP.2003.1279280
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• VLSI implementations of threshold logic-a comprehensive survey

  2003cited by this paper
• Threshold logic circuit design of parallel adders using resonant tunneling devices

  2000cited by this paper
• Optimal-depth circuits for prefix computation and addition

  2000cited by this paper
• Optimal-depth threshold circuits for multiplication and related problems

  1999cited by this paper
• Two Operand Binary Adders with Threshold Logic

  1999cited by this paper
• Neural Addition and Fibonacci Numbers

  1999cited by this paper
• Deeper Sparsely Nets can be Optimal

  1998cited by this paper
• On the circuit and VLSI complexity of threshold gate COMPARISON

  1998cited by this paper
• Reduction of the Hodgkin-Huxley Equations to a Single-Variable Threshold Model

  1997cited by this paper
• 2-1 Additions and Related Arithmetic Operations with Threshold Logic

  1996cited by this paper
• Single electron tunneling technology for neural networks

  1996cited by this paper
• On the Circuit Complexity of Sigmoid Feedforward Neural Networks

  1996cited by this paper
• Addition Using Constrained Threshold Gates

  1994cited by this paper
• On The Power Of Threshold Circuits With Small Weights

  1991cited by this paper
• Depth-Size Tradeoffs for Neural Computation

  1991cited by this paper
• Neural computation of arithmetic functions

  1990cited by this paper
• e-Entropy and the Complexity of Feedforward Neural Networks

  1990cited by this paper
• The Complexity of Computations by Networks

  1987cited by this paper
• Fast area-efficient VLSI adders

  1987cited by this paper
• The Connectivity Analysis of Simple Association

  1987cited by this paper
• A Regular Layout for Parallel Adders

  1982cited by this paper
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

  1973cited by this paper
• Threshold logic and its applications

  1971cited by this paper
• Conditional-Sum Addition Logic

  1960cited by this paper

• Characterization of a 16-bit threshold logic single-electron technology adder

  2004cites this paper
• On the Design of Multibit SET Adders

  2004cites this paper
• On the Design of SET Adders

  2004cites this paper
• Over 100 dBc ROM-less piecewise non-linear direct digital frequency synthesizers

  2003cites this paper