×

Dynamic hierarchial associative memory

  • US 5,341,483 A
  • Filed: 05/31/1990
  • Issued: 08/23/1994
  • Est. Priority Date: 12/22/1987
  • Status: Expired due to Term
First Claim
Patent Images

1. An associative memory for information-representative signals representative of information relating to a plurality of descriptors, each descriptor including a set portion and (n) other portions, where (n) is an integer greater than or equal to two, said associative memory having an associativity of two to the (q)th power, where (q) is an integer greater than or equal to one, said associative memory comprisingA. input means for receiving a candidate descriptor,B. directory means for storing and accessing said information-representative signals, said directory means including:

  • i. (n) table means including table means(n) for storing said information-representative signals and table means (j), where (j) where (j) represents successive integers between (1) and (n-1), inclusive, for storing pointer-representative signals, andii. each said table means (j) including a plurality of entry means, each for storing a (q)-bit pointer-representative signal directed to at least one respective entry means of table means (j+1), said table means (n) including a plurality of entry means, each for storing an information-representative signal relating to at least one said descriptor,iii. each said entry means of table means (1) being accessible as a function of a common set portion and a common portion (1) of a plurality of descriptors with which that entry means is respectively associated, said table means (1) including memory means responsive to values of a common set portion and a common portion (1) of a candidate descriptor for accessing the entry means of table means (1) respectively associated with that candidate descriptor and for generating a pointer signal representative of the pointer stored therein,iv. each said entry means of table means (m), where (m) represents successive integers between (2) and (n), being accessible as a function of values of a common set and a common portion (m) of a plurality of descriptors with which such table means (m) entry means is respectively associated, and a value of a pointer signal of the respective table means (m-1) entry means with which such table means (m) entry means is respectively associated, each said table means (m) including memory means responsive to values of a common set and a common portion (m) of candidate descriptors with which such table means (m) entry means is respectively associated, as well as to a value of a pointer signal of the respective table means (m-1) entry means with which such table means (m) entry means is respectively associated, for accessing the entry means of table means (m) respectively associated with that candidate descriptor and for generating a signal representative of the information stored therein,C. look-up means connected to said input means and to said directory means for determining whether said directory means stores an information-representative signal relating to said candidate descriptor, and for generating a signal representative of that determination, andD. update means, coupled to said input means and to said look-up means and to said directory means, selectively responsive to a determination that an information-representative signal relating to said candidate descriptor is not stored in said directory means for updating at least one of said (n) table means to include a signal representative of said candidate descriptor.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×