BEST MATCH CONTENT ADDRESSABLE MEMORY

摘要

BEST MATCH CONTENT ADDRESSABLE MEMORY 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.