内容可寻址存储器(CAM)的高效ASIC设计

P. Mukherjee
{"title":"内容可寻址存储器(CAM)的高效ASIC设计","authors":"P. Mukherjee","doi":"10.1109/ASIC.1990.186107","DOIUrl":null,"url":null,"abstract":"The design of an efficient content-addressable memory (CAM) where the search operation can be based on any one of the following functions: equality, greater than, less than, greater than or equal to, and less than or equal to, is discussed. This design gives the user the flexibility to choose any one function, or multiple functions with minimum increase in gate complexity, thus making it suitable for use in an ASIC environment.<<ETX>>","PeriodicalId":126693,"journal":{"name":"Third Annual IEEE Proceedings on ASIC Seminar and Exhibit","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient ASIC design of a content-addressable memory (CAM)\",\"authors\":\"P. Mukherjee\",\"doi\":\"10.1109/ASIC.1990.186107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of an efficient content-addressable memory (CAM) where the search operation can be based on any one of the following functions: equality, greater than, less than, greater than or equal to, and less than or equal to, is discussed. This design gives the user the flexibility to choose any one function, or multiple functions with minimum increase in gate complexity, thus making it suitable for use in an ASIC environment.<<ETX>>\",\"PeriodicalId\":126693,\"journal\":{\"name\":\"Third Annual IEEE Proceedings on ASIC Seminar and Exhibit\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third Annual IEEE Proceedings on ASIC Seminar and Exhibit\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASIC.1990.186107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third Annual IEEE Proceedings on ASIC Seminar and Exhibit","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASIC.1990.186107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

讨论了高效内容可寻址存储器(CAM)的设计,其中搜索操作可以基于以下任何一个函数:相等、大于、小于、大于或等于和小于或等于。这种设计使用户可以灵活地选择任何一种功能,或多种功能,而栅极复杂性的增加最小,因此适合在ASIC环境中使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An efficient ASIC design of a content-addressable memory (CAM)
The design of an efficient content-addressable memory (CAM) where the search operation can be based on any one of the following functions: equality, greater than, less than, greater than or equal to, and less than or equal to, is discussed. This design gives the user the flexibility to choose any one function, or multiple functions with minimum increase in gate complexity, thus making it suitable for use in an ASIC environment.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A development system for an SRAM-based user-reprogrammable gate array Automated CAE tools for full custom design of bipolar analog ASICs A 200 MHz 100 K ECL output buffer for CMOS ASICs Multi circular buffer controller chip for advanced ESM system Rapid prototyping, is there an educational dilemma? (ASIC design)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1