专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明专利

JP2007080375A Associative memory device for retrieving minimum euclidean distance 有权
标题翻译：用于检索最小的离子距离的相关记忆装置
公开(公告)号：JP2007080375A
公开(公告)日：2007-03-29
申请号：JP2005266250
申请日：2005-09-14
申请人： Hiroshima Univ , 国立大学法人広島大学
发明人： MATTHEW HANSJUERGEN , KOIDE TETSUSHI , ABEDIN M ANWARUL
IPC分类号： G11C15/04
摘要： PROBLEM TO BE SOLVED: To provide an effective architecture for obtaining a memory for retrieving fully parallel minimum Euclidean distance by hardware. SOLUTION: All outputs of circuits for calculating absolute values of W pieces of differences are input to a weight comparator circuit WC to calculate square of absolute values of the differences in the weight comparator circuit WC. By this procedure, the calculation of square of Euclidean distances of retrieval data and reference data is achieved. The reference data of minimum distance are retrieved from a calculation result of square of this Euclidean distance. Thus, since square of Euclidean distance is used for retrieving pattern data having nearest Euclidean distance, a calculation of square root is not required, and a Euclidean distance calculating circuit is obtained by a small area, and the associative memory device is also obtainable by low power consumption and small area. COPYRIGHT: (C)2007,JPO&INPIT
摘要翻译：要解决的问题：提供一种用于获得用于通过硬件检索完全并行的最小欧几里德距离的存储器的有效架构。
解决方案：用于计算W个差异绝对值的电路的所有输出被输入到加权比较器电路WC，以计算加权比较器电路WC中的差的绝对值的平方。通过这个过程，实现了检索数据和参考数据的欧氏距离的平方的计算。从欧几里德距离的平方的计算结果中检索最小距离的参考数据。因此，由于欧氏距离的平方根用于检索具有最近欧几里德距离的图案数据，所以不需要平方根的计算，并且通过小的面积获得欧几里德距离计算电路，并且可以通过低的可获得关联存储器件功耗小，面积小。版权所有（C）2007，JPO＆INPIT

2. 发明专利

JP2009134810A Associative memory and searching system using the same 有权
标题翻译：相关记忆和搜索系统
公开(公告)号：JP2009134810A
公开(公告)日：2009-06-18
申请号：JP2007309856
申请日：2007-11-30
申请人： Hiroshima Univ , 国立大学法人広島大学
发明人： ABEDIN M ANWARUL , KOIDE TETSUSHI , MATTHEW HANSJUERGEN , TANAKA YUKI
IPC分类号： G11C15/04
CPC分类号： G11C11/56 , G11C15/04
摘要： PROBLEM TO BE SOLVED: To provide an associative memory capable of outputting multiple reference data close to search data. SOLUTION: A memory array 10 compares each piece of the multiple reference data with the search data in parallel and generates multiple comparison current signals C 1 to C R representing the result of the comparison. A WLA circuit 20 converts the multiple comparison current signals C 1 to C R into multiple voltages V C1 to V CR . During the first cycle, the WLA circuit 20 detects a lowest voltage among the multiple voltages V C1 to V CR as Winner, and the remaining voltages as Loser. After the second cycle, based on feedback signals FB 1 to FB R , the WLA circuit 20 detects all the voltages other than the voltage detected as Winner during the last preceding cycle, and detects a lowest voltage among the detected voltages as Winner and the remaining detected voltages as Loser. The WLC circuit 20 repeats these operations k times. COPYRIGHT: (C)2009,JPO&INPIT
摘要翻译：要解决的问题：提供能够输出接近搜索数据的多个参考数据的关联存储器。存储器阵列10并行地将多个参考数据和搜索数据并行地进行比较，并且生成表示该多个参考数据的多个参考数据的多个比较电流信号C 1 至C R 比较结果。 WLA电路20将多个比较电流信号C 1 转换为C R 为多个电压V SB C1至SB SB >。在第一周期期间，WLA电路20检测作为优胜者的多个电压V SB> C1 至V SB SB的最低电压，剩余电压作为失败者检测。在第二周期之后，WLA电路20基于反馈信号FB 1 到FB R ，检测在最后一个周期内被检测为Winner的电压以外的所有电压，并检测检测到的电压中的最低电压为Winner，剩余检测电压为失败者。 WLC电路20重复这些操作k次。版权所有（C）2009，JPO＆INPIT

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式