Patent · US Expired

Dynamic hierarchial associative memory

US5341483A · kind A · utility

81Cited by
67References
48Claims
0Family size

Assignee

Inventors

Key dates

Filing dateMay 31, 1990
Grant dateAug 23, 1994
Priority date
Expiry dateMay 31, 2010

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F2212/272
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

An associative memory having an associativity of 2.sup.q, where (q) is an integer greater than or equal to one, is provided for storing information relating to data. The memory includes (n) tables, each having a plurality of entries for storing signals associated with data descriptors having a common set portion and common other portions. The entries of table (k), where (k) represents successive integers between (1) and (n-1), store pointers to respective entries of table (k+1). The entries of table (1) are arranged for access as a function of the common set portion and the common portion (1) with which they are respectively associated. The entries of the other tables are arranged for access as a function of (i) a value of the common set portion, (ii) a value of a pointer-respresentative signal of the respective table (m-1) entry means, and (iii) the value of the common portion(m) with which such table(m) entry means is respectively associated. The entries of table(n) store information relating to one or more data having a common portion(n).

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.