A VLSI-optimal constructive algorithm for classification problems

Sorin Draghici, Valeriu Beiu, Ishwar K. Sethi

Research output: Contribution to conferencePaperpeer-review

8 Citations (Scopus)

Abstract

If neural networks are to be used on a large scale, they have to be implemented in hardware. However, the cost of the hardware implementation is critically sensitive to factors like the precision used for the weights, the total number of bits of information and the maximum fan-in used in the network. This paper presents a version of the Constraint Based Decomposition training algorithm which is able to produce networks using limited precision integer weights and units with limited fan-in. The algorithm is tested on the 2-spiral problem and the results are compared with other existing algorithms.

Original languageEnglish
Pages145-150
Number of pages6
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 Artificial Neural Networks in Engineering Conference, ANNIE'97 - St.Louis, MO, USA
Duration: Nov 9 1997Nov 12 1997

Other

OtherProceedings of the 1997 Artificial Neural Networks in Engineering Conference, ANNIE'97
CitySt.Louis, MO, USA
Period11/9/9711/12/97

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'A VLSI-optimal constructive algorithm for classification problems'. Together they form a unique fingerprint.

Cite this