arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.4463cs.AR
收藏

一种基于稀疏网络的低功耗内容寻址存储器

A Low-Power Content-Addressable-Memory Based on Clustered-Sparse-Networks

Hooman Jarollahi, Vincent Gripon, Naoya Onizawa, Warren J. Gross

摘要:

介绍了一种低功耗的内容可寻址存储器(CAM),它采用了一种新的机制来实现输入标签和输出数据的对应地址之间的关联。建议的架构是基于最近开发的集群稀疏网络使用二进制加权连接,平均将消除大部分的并行比较过程中进行搜索。因此,所提出的设计的动态能量消耗是显着低于传统的低功耗CAM设计。给定一个输入标签,所提出的架构计算匹配标签的位置的几种可能性,并对它们进行比较,以定位单个有效匹配。一个0.13微米的CMOS工艺用于模拟目的。该设计的能量消耗和搜索延迟分别为传统NAND结构的9.5%和30.4%,晶体管数量增加了3.4%。

英文摘要:

A low-power Content-Addressable-Memory (CAM) is introduced employing a new mechanism for associativity between the input tags and the corresponding address of the output data. The proposed architecture is based on a recently developed clustered-sparse-network using binary-weighted connections that on-average will eliminate most of the parallel comparisons performed during a search. Therefore, the dynamic energy consumption of the proposed design is significantly lower compared to that of a conventional low-power CAM design. Given an input tag, the proposed architecture computes a few possibilities for the location of the matched tag and performs the comparisons on them to locate a single valid match. A 0.13 um CMOS technology was used for simulation purposes. The energy consumption and the search delay of the proposed design are 9.5%, and 30.4% of that of the conventional NAND architecture respectively with a 3.4% higher number of transistors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑