| 摘要 |
PROBLEM TO BE SOLVED: To provide a content addressable memory which allows accurate and rapid similarity search even when using Manhattan distances.SOLUTION: The content addressable memory includes R distance/clock count conversion circuits DCto DCeach of which includes counter matching detection circuits 31 to 3W. Each of distance signals Dto Drepresents a distance between search data and reference data. The counter matching detection circuit 31 counts the number of clocks for acquisition of a counter value matching the distance signal D, and then the counter matching detection circuit 32 counts the number of clocks for acquisition of a counter value matching the distance signal D. The same operation is performed hereafter, and the counter matching detection circuit 3W counts the number of clocks for acquisition of a counter value matching a distance signal Dafter the counter matching detection circuit 3W-1 counts the number of clocks for acquisition of a counter value matching a distance signal D. |
