A Cutpoint Cellular Associative Memory

C. C. Yang, Sik-Sang Yau

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Due to the rapidly growing technological ability to batch fabricate a large number of components on one substrate, it is economical and reliable to implement an associative memory by cellular arrays. Such an associative memory is presented in this paper. The proposed memory is word-organized, and its basic building blocks are cutpoint cells with various indices. All the bit-memories, word-sequential-control networks, word-match tag-networks, and bit-output networks have identical structures, and the proposed memory system is especially compatible with the manufacture of integrated circuit. The memory can perform the comparison, tag, writing and nondestructive reading processes in the parallel-by-bit form, as well as Lewin's sorting scheme for ordered retrieval. The dematching process is completely automatic. The memory sequential-control system does not use any ladder structure which is commonly employed in previous associative memory systems; hence the operation speed is largely increased. The stage delays for various operations are given, and may be employed to estimate the speed of the associative memory.

Original languageEnglish (US)
Pages (from-to)522-528
Number of pages7
JournalIEEE Transactions on Electronic Computers
VolumeEC-15
Issue number4
DOIs
StatePublished - 1966
Externally publishedYes

Fingerprint

Associative Memory
Data storage equipment
Number of Components
Integrated Circuits
Sorting
Building Blocks
Batch
Cellular arrays
Retrieval
Substrate
Control System
Ladders
Output
Cell
Integrated circuits
Estimate
Control systems
Substrates

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Software
  • Theoretical Computer Science

Cite this

A Cutpoint Cellular Associative Memory. / Yang, C. C.; Yau, Sik-Sang.

In: IEEE Transactions on Electronic Computers, Vol. EC-15, No. 4, 1966, p. 522-528.

Research output: Contribution to journalArticle

@article{fe747a44b00844ba8103074109903498,
title = "A Cutpoint Cellular Associative Memory",
abstract = "Due to the rapidly growing technological ability to batch fabricate a large number of components on one substrate, it is economical and reliable to implement an associative memory by cellular arrays. Such an associative memory is presented in this paper. The proposed memory is word-organized, and its basic building blocks are cutpoint cells with various indices. All the bit-memories, word-sequential-control networks, word-match tag-networks, and bit-output networks have identical structures, and the proposed memory system is especially compatible with the manufacture of integrated circuit. The memory can perform the comparison, tag, writing and nondestructive reading processes in the parallel-by-bit form, as well as Lewin's sorting scheme for ordered retrieval. The dematching process is completely automatic. The memory sequential-control system does not use any ladder structure which is commonly employed in previous associative memory systems; hence the operation speed is largely increased. The stage delays for various operations are given, and may be employed to estimate the speed of the associative memory.",
author = "Yang, {C. C.} and Sik-Sang Yau",
year = "1966",
doi = "10.1109/PGEC.1966.264359",
language = "English (US)",
volume = "EC-15",
pages = "522--528",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - A Cutpoint Cellular Associative Memory

AU - Yang, C. C.

AU - Yau, Sik-Sang

PY - 1966

Y1 - 1966

N2 - Due to the rapidly growing technological ability to batch fabricate a large number of components on one substrate, it is economical and reliable to implement an associative memory by cellular arrays. Such an associative memory is presented in this paper. The proposed memory is word-organized, and its basic building blocks are cutpoint cells with various indices. All the bit-memories, word-sequential-control networks, word-match tag-networks, and bit-output networks have identical structures, and the proposed memory system is especially compatible with the manufacture of integrated circuit. The memory can perform the comparison, tag, writing and nondestructive reading processes in the parallel-by-bit form, as well as Lewin's sorting scheme for ordered retrieval. The dematching process is completely automatic. The memory sequential-control system does not use any ladder structure which is commonly employed in previous associative memory systems; hence the operation speed is largely increased. The stage delays for various operations are given, and may be employed to estimate the speed of the associative memory.

AB - Due to the rapidly growing technological ability to batch fabricate a large number of components on one substrate, it is economical and reliable to implement an associative memory by cellular arrays. Such an associative memory is presented in this paper. The proposed memory is word-organized, and its basic building blocks are cutpoint cells with various indices. All the bit-memories, word-sequential-control networks, word-match tag-networks, and bit-output networks have identical structures, and the proposed memory system is especially compatible with the manufacture of integrated circuit. The memory can perform the comparison, tag, writing and nondestructive reading processes in the parallel-by-bit form, as well as Lewin's sorting scheme for ordered retrieval. The dematching process is completely automatic. The memory sequential-control system does not use any ladder structure which is commonly employed in previous associative memory systems; hence the operation speed is largely increased. The stage delays for various operations are given, and may be employed to estimate the speed of the associative memory.

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

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

U2 - 10.1109/PGEC.1966.264359

DO - 10.1109/PGEC.1966.264359

M3 - Article

VL - EC-15

SP - 522

EP - 528

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 4

ER -