首页> 外文期刊>Japanese Journal of Applied Physics. Part 1, Regular Papers, Brief Communications & Review Papers >Mixed Digital-Analog Associative Memory Enabling Fully-Parallel Nearest Euclidean Distance Search
【24h】

Mixed Digital-Analog Associative Memory Enabling Fully-Parallel Nearest Euclidean Distance Search

机译:混合数模关联存储器,可实现全并行最近欧氏距离搜索

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, an associative memory architecture with mixed digital-analog search circuitry is proposed, which enables a fully-parallel nearest match-data search based on the Euclidean distance between input pattern and stored reference patterns. A test chip, implementing the proposed architecture, was designed in 0.35 urn complementary metal-oxide-semiconductor (CMOS) technology with two-poly and three-metal layers. The nearest-match unit consumes only 0.64 mm~2 (12.5% of the total design area), while the whole chip area is 5.12 mm~2. The layout-based simulated winner-search time, the time to determine the best-matching reference-data word for an input-data word among a database of 64 reference patterns (5-bit, 16 units), is lower than 160 ns. This corresponds to a performance requirement of 27 giga operations per second (GOPS)/mm~2, if a general purpose computer with the same chip area would have to run the same workload. Furthermore, the power dissipation of the designed test chip is only about 38 mW/mm2 at this high processing performance.
机译:在本文中,提出了一种具有混合数模搜索电路的关联存储架构,该架构可基于输入模式和存储的参考模式之间的欧几里德距离进行完全并行的最近匹配数据搜索。测试芯片采用0.35 um互补金属氧化物半导体(CMOS)技术设计,该芯片实现了所提出的架构,该技术具有两层和三层金属层。最接近匹配单元仅消耗0.64 mm〜2(占设计总面积的12.5%),而整个芯片面积为5.12 mm〜2。基于布局的模拟获胜者搜索时间,即从64个参考模式(5位,16个单位)的数据库中确定输入数据词的最佳匹配参考数据词的时间,低于160 ns。如果具有相同芯片面积的通用计算机必须运行相同的工作负载,则这对应于每秒27千兆次操作(GOPS)/ mm〜2的性能要求。此外,在如此高的处理性能下,设计的测试芯片的功耗仅为38 mW / mm2。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号