Optimal practical adders using perceptrons

Mawahib Sulieman, Valeriu Beiu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Networks of perceptrons provide simple and elegant solutions for many classes of Boolean functions, including addition. That is why, a large number of solutions have been proposed for the addition of two binary numbers. Such solutions have been optimized with respect to several cost functions like: depth, size, fan-ins, weights, and thresholds. In this paper we will shortly review constructive solutions for the addition of two binary numbers, and subsequently introduce a novel optimal hybrid structure for threshold logic practical adders (i.e., adders having from 16- to 128-bit inputs). Quantitative comparison of the new structure with the latest solutions in terms of depth, size, weights, thresholds, fan-in, as well as fan-out, will be presented for a particular case.

Original languageEnglish
Title of host publicationProceedings of 2003 International Conference on Neural Networks and Signal Processing, ICNNSP'03
Pages345-348
Number of pages4
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event2003 International Conference on Neural Networks and Signal Processing, ICNNSP'03 - Nanjing, China
Duration: Dec 14 2003Dec 17 2003

Publication series

NameProceedings of 2003 International Conference on Neural Networks and Signal Processing, ICNNSP'03
Volume1

Other

Other2003 International Conference on Neural Networks and Signal Processing, ICNNSP'03
Country/TerritoryChina
CityNanjing
Period12/14/0312/17/03

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Optimal practical adders using perceptrons'. Together they form a unique fingerprint.

Cite this