首页> 外国专利> ASSOCIATIVE MEMORY APPARATUS FOR SEARCHING DATA IN WHICH MANHATTAN DISTANCE IS MINIMUM

ASSOCIATIVE MEMORY APPARATUS FOR SEARCHING DATA IN WHICH MANHATTAN DISTANCE IS MINIMUM

机译:关联存储器,用于在曼哈顿距离最小的情况下搜索数据

摘要

In the present invention, the associative memory circuit is one difference absolute value calculation of the addition circuit and a bit inversion circuit Because the configuration, the number of transistors compared to the prior art has focused on the fact that reduced to 2/5. Difference absolute value calculating circuit as the unit comparison circuit (UC) are designed to jeonbyeongryeol type associative memory (a fully-parallel type associative memory), all the output of the difference absolute value calculating circuits (UC ij ) - These outputs are prepared for the number of times that the comparison - the weight is shown as the comparator (WC ij ) to be performed the calculation of a Manhattan distance between the search data (SW) and the reference data (REF). According to this configuration, because a Manhattan distance calculating circuit is implemented with a smaller area and a smaller number of transistors, an associative memory may be arranged to be a lower power consumption than a small area.
机译:在本发明中,相联存储电路是加法电路和位反转电路的一个差分绝对值计算。由于该配置,与现有技术相比,晶体管的数量集中在减小到2/5的事实。作为单位比较电路(UC)的差分绝对值计算电路被设计为纯平ryeol型关联存储器(全并行型关联存储器),差分绝对值计算电路的所有输出(UC ij )-这些输出已准备好进行比较的次数-权重显示为比较器(WC ij ),以计算搜索数据(SW)与参考数据(REF)。根据该配置,因为曼哈顿距离计算电路以较小的面积和较小的晶体管数量实现,所以可以将关联存储器布置为比小面积具有更低的功耗。

著录项

  • 公开/公告号KR100549895B1

    专利类型

  • 公开/公告日2006-02-06

    原文格式PDF

  • 申请/专利权人

    申请/专利号KR20040064923

  • 申请日2004-08-18

  • 分类号G11C15/00;

  • 国家 KR

  • 入库时间 2022-08-21 21:24:23

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号