US4084260A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Best match content addressable memory
Assignee: Unisys Corp
•
Filing: 1976-07-12
•
Granted: 1978-04-11
•
Expires: 1996-07-12
Abstract
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.
Inventors
- 👤 David Leslie Fleming
- 👤 Leslie Matthew Jenson
- 👤 Gerald Francis Sauter
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 06:25
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/02; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
177 words
A best match content addressable memory, comprising: a search file memory for storing M file words, each of N-bits in length; a file word register coupled to said search file memory for storing one of said M file words; a match word register coupled to said search file memory for storing a selected one of said M file words as a match word; a search word register for storing a search word of N-bits in length; first means responsively coupled to said file word register and to said search word register for generating a first Hamming distance representation of the file word and the search word; second means responsively coupled to said match word register and to said search word register for generating a second Hamming distance representation of the match word and the search word; comparator means responsively coupled to said first and second means, comparing said first and second Hamming distance representations for transferring said file word into said match word register only if said first Hamming distance is less than said second Hamming distance.
Claim 2
Dependent Claim
177 words
A best match content addressable memory, comprising: a search file memory for storing M file words, each of N-bits in length; a file word register coupled to said search file memory for storing one of said M file words; a match word register coupled to said search file memory for storing a selected one of said M file words as a match word; a search word register for storing a search word of N-bits in length; first means responsively coupled to said file word register and to said search word register for generating a first Hamming distance representation of the file word and the search word; second means responsively coupled to said match word register and to said search word register for generating a second Hamming distance representation of the match word and the search word; comparator means responsively coupled to said first and second means, comparing said first and second Hamming distance representations for transferring said file word into said match word register only if said first Hamming distance is less than said second Hamming distance.
Claim 3
Dependent Claim
148 words
The best match content addressable memory of claim 1 in which said first means comprises: N xor's, each separate one responsively coupled to a like-ordered stage of said search word register and of said file word register; a resistor ladder network having N resistor legs, each resistor leg coupled to the output of a separate associated one of said N XOR's, the other ends of which are common coupled to a first input terminal of said comparator means; and in which said second means comprises: N xor's, each separate one responsively coupled to a like-ordered stage of said search word register and of said match word register; a resistor ladder network having N resistor legs, each resistor leg coupled to the output of a separate associated one of said N XOR's, the other ends of which are common coupled to a second input terminal of said comparator means.
Claim 4
Dependent Claim
65 words
The best match content addressable memory of claim 1 in which said search file memory comprises: N shift registers, each of M bits in length, each separate one of said N shift registers storing the like-ordered bit of said M file word and coupling, in parallel, each of the N bits of a given file word to the like-ordered stage of said file word register.
References Cited (Backward Citations)
US3548385A
Cited
US3540002A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1981-04-10 | 1981-10-10 | 1982-04-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1985-04-10 | 1985-10-10 | 1986-04-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1989-04-10 | 1989-10-10 | 1990-04-11 | $7700.00 | Window Closed / Lapsed |