发明名称 Associative memory apparatus for searching data in which Manhattan distance is minimum
摘要 In the present invention, focusing on the point that the number of transistors can be reduced to about 2/5 of that in a prior art due to an absolute-value-of-difference calculating circuit for an associative memory being configured of two of an addition circuit and a bit inversion circuit. The absolute-value-of-difference calculating circuit is built in a fully-parallel type associative memory as a unit comparison circuit (UC), and all of the outputs of the absolute-value-of-difference calculating circuits (UC ij ) for which the number of comparisons thereof are prepared are input to weight comparison circuits (WC ij ), whereby the calculation of the Manhattan distance between the search data (SW) and the reference data (REF) is carried out. In accordance with the configuration, because a Manhattan distance calculating circuit can be realized by a fewer number of transistors and with a small area, an associative memory apparatus as well can be realized at a low power consumption and with a small area.
申请公布号 EP1557842(A2) 申请公布日期 2005.07.27
申请号 EP20040019069 申请日期 2004.08.11
申请人 HIROSHIMA UNIVERSITY 发明人 KOIDE, TETSUSHI;MATTAUSCH, HANS JUERGEN;YANO, YUJI
分类号 G11C15/04;G06T7/00;G11C15/00;(IPC1-7):G11C15/00 主分类号 G11C15/04
代理机构 代理人
主权项
地址