Best match content addressable memory
US4084260A · kind A · utility
24Cited by
2References
3Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jul 12, 1976 |
| Grant date | Apr 11, 1978 |
| Priority date | — |
| Expiry date | Jul 12, 1996 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99933
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of and an apparatus for determining the best match, i.e., minimum Hamming distance, between a search word and a plurality of file words is disclosed. The method involves simultaneously comparing the search word to a file word and to a match word. If the comparison indicates that the file word is a better match than the match word, the file word becomes the match word and the next file word is compared to the new match word. The operation continues until all the file words have been operated upon such that the last match word becomes the best match word.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.