COMPARISON OF A PIPELINED 'BEST MATCH' CONTENT ADDRESSABLE MEMORY WITH NEURAL NETWORKS.

L. T. Clark; R. O. Grondin

COMPARISON OF A PIPELINED 'BEST MATCH' CONTENT ADDRESSABLE MEMORY WITH NEURAL NETWORKS.

L. T. Clark, R. O. Grondin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Neural networks in a variety of configurations have demonstrated the ability to choose rapidly the stored item that most closely matches a given input. A significant drawback to such an approach from an integrated circuit standpoint is the large number of interconnections required between the individual elements. The authors have designed and fabricated a memory device with the above feature that is capable of significant data throughput rates. An overview of the architecture is presented, and its characteristics are compared to that of other neural networks through simulation.

Original language	English (US)
Title of host publication	Unknown Host Publication Title
Editors	Maureen Caudill, Charles T. Butler, San Diego Adaptics
Place of Publication	San Diego, CA, USA
Publisher	SOS Printing
State	Published - 1987

ASJC Scopus subject areas

General Engineering

Cite this

@inproceedings{cd73b5f6a957427cbdd1480d28a29c9c,

title = "COMPARISON OF A PIPELINED 'BEST MATCH' CONTENT ADDRESSABLE MEMORY WITH NEURAL NETWORKS.",

abstract = "Neural networks in a variety of configurations have demonstrated the ability to choose rapidly the stored item that most closely matches a given input. A significant drawback to such an approach from an integrated circuit standpoint is the large number of interconnections required between the individual elements. The authors have designed and fabricated a memory device with the above feature that is capable of significant data throughput rates. An overview of the architecture is presented, and its characteristics are compared to that of other neural networks through simulation.",

author = "Clark, {L. T.} and Grondin, {R. O.}",

year = "1987",

language = "English (US)",

editor = "Maureen Caudill and Butler, {Charles T.} and Adaptics, {San Diego}",

booktitle = "Unknown Host Publication Title",

publisher = "SOS Printing",

}

TY - GEN

T1 - COMPARISON OF A PIPELINED 'BEST MATCH' CONTENT ADDRESSABLE MEMORY WITH NEURAL NETWORKS.

AU - Clark, L. T.

AU - Grondin, R. O.

PY - 1987

Y1 - 1987

N2 - Neural networks in a variety of configurations have demonstrated the ability to choose rapidly the stored item that most closely matches a given input. A significant drawback to such an approach from an integrated circuit standpoint is the large number of interconnections required between the individual elements. The authors have designed and fabricated a memory device with the above feature that is capable of significant data throughput rates. An overview of the architecture is presented, and its characteristics are compared to that of other neural networks through simulation.

AB - Neural networks in a variety of configurations have demonstrated the ability to choose rapidly the stored item that most closely matches a given input. A significant drawback to such an approach from an integrated circuit standpoint is the large number of interconnections required between the individual elements. The authors have designed and fabricated a memory device with the above feature that is capable of significant data throughput rates. An overview of the architecture is presented, and its characteristics are compared to that of other neural networks through simulation.

UR - http://www.scopus.com/inward/record.url?scp=0023538610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023538610&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023538610

BT - Unknown Host Publication Title

A2 - Caudill, Maureen

A2 - Butler, Charles T.

A2 - Adaptics, San Diego

PB - SOS Printing

CY - San Diego, CA, USA

ER -

COMPARISON OF A PIPELINED 'BEST MATCH' CONTENT ADDRESSABLE MEMORY WITH NEURAL NETWORKS.

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this