Content-addressable memory with soft-match capability

作者： James L. Burrows

DOI:

关键词: Exact match 、 Arithmetic 、 Signal 、 Word (computer architecture) 、 Matching (graph theory) 、 Algorithm 、 Computer science 、 Encoder 、 Content-addressable memory 、 Key (cryptography) 、 Electronic circuit

摘要: Each word location (18-0, 18-1, 18-255) in a content-addressable memory has tally circuit (24-0, 24-1, 24-255) associated with it. A data on lines (12) is compared simultaneously the words all of locations, and each counts number matches between key that represented by signals line. The circuits apply representing matching bits their respective locations to comparison (28-1, 28-255), which compares output from its previous forwards higher two next circuit. also applies priority encoder (32) an indicates whether generated signal greater than previious locations. encodes address having highest tally, last represents is. In this manner, (10) can be addressed closest match, not only exact match.