Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
We survey recent developments in the design of large-capacity content-addressable memory (CAM). A CAM is a memory that implements the lookup-table function in a single clock cycle using dedicated comparison circuitry. CAMs are especially popular in network routers for packet forwarding and packet classification, but they are also beneficial in a variety of other applications that require high-speed table lookup. The main CAM-design challenge is to reduce power consumption associated with the large amount of parallel active circuitry, without sacrificing speed or memory density. In this paper, we review CAM-design techniques at the circuit level and at the architectural level. At the circuit level, we review low-power matchline sensing techniques and searchline driving approaches. At the architectural level we review three methods for reducing power consumption.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Digital integrated circuits : a design perspective
Rabaey, J. M., Chandrakasan, A. P., & Nikolić, B. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,118
Magnetoresistive random access memory using magnetic tunnel junctions
Tehrani, S., Slaughter, J. M., Deherrera, M., Engel, B. N., Rizzo, N. D., Salter, J., Durlam, M., Dave, R. W., Janesky, J., Butcher, B., et al. (2003) · Proceedings of the IEEE · doi:10.1109/jproc.2003.811804 · Cited by 406
Kohonen, T. (1987) · Springer Series in Information Sciences · doi:10.1007/978-3-642-83056-3 · Cited by 324
Coolcams: power-efficient TCAMs for forwarding engines
Zane, F., Narlikar, G., & Basu, A. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1208657 · Cited by 256
A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme
Pagiamtzis, K., & Sheikholeslami, A. (2004) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2004.831433 · Cited by 161
Self-citationContent-addressable and associative memory: alternatives to the ubiquitous RAM
Chisvin, L., & Duckworth, R. J. (1989) · Computer · doi:10.1109/2.30732 · Cited by 161
A fast hardware data compression algorithm and some algorithmic extensions
Craft, D. J. (1998) · IBM Journal of Research and Development · doi:10.1147/rd.426.0733 · Cited by 55
A content-addressable memory architecture for image coding using vector quantization
Panchanathan, S., & Goldberg, M. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.134438 · Cited by 55
Real-time CAM-based Hough transform algorithm and its performance evaluation
Nakanishi, M., & Ogura, T. (2000) · Machine Vision and Applications · doi:10.1007/s001380050125 · Cited by 27
Cited by
Moradi, S., Qiao, N., Stefanini, F., & Indiveri, G. (2018) · IEEE Transactions on Biomedical Circuits and Systems · doi:10.1109/tbcas.2017.2759700 · Cited by 650
Software Defined Optical Networks (SDONs): A Comprehensive Survey
Thyagaturu, A. S., Mercian, A., McGarry, M. P., Reisslein, M., & Kellerer, W. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2586999 · Cited by 364
A 28 nm Configurable Memory (TCAM/BCAM/SRAM) Using Push-Rule 6T Bit Cell Enabling Logic-in-Memory
Jeloka, S., Akesh, N. B., Sylvester, D., & Blaauw, D. (2016) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2016.2515510 · Cited by 361
Computing in Memory With Spin-Transfer Torque Magnetic RAM
Jain, S., Ranjan, A., Roy, K., & Raghunathan, A. (2018) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2017.2776954 · Cited by 355
Hybrid SDN Networks: A Survey of Existing Approaches
Amin, R., Reisslein, M., & Shah, N. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2837161 · Cited by 352
Aga, S., Jeloka, S., Subramaniyan, A., Narayanasamy, S., Blaauw, D., & Das, R. (2017) · 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2017.21 · Cited by 324
A survey of quantum image representations
Yan, F., Iliyasu, A. M., & Venegas-Andraca, S. E. (2016) · Quantum Information Processing · doi:10.1007/s11128-015-1195-6 · Cited by 310
Survey on Network Virtualization Hypervisors for Software Defined Networking
Blenk, A., Basta, A., Reisslein, M., & Kellerer, W. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2489183 · Cited by 295
Chen, T.-S., Lee, D.-Y., Liu, T.-T., & Wu, A.-Y. (2016) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2016.2584658 · Cited by 30
“Recently, Ternary Content Addressable Memory (TCAM) has been applied to packet processing to forward packets rapidly [5].”
BackgroundMethodOn the Reliability of In-Memory Computing: Impact of Temperature on Ferroelectric TCAM
Thomann, S., Li, C., Zhuo, C., Prakash, O., Yin, X., Hu, X. S., & Amrouch, H. (2021) · 2021 IEEE 39th VLSI Test Symposium (VTS) · doi:10.1109/vts50974.2021.9441038 · Cited by 24
Metadata
- Authors
- Pagiamtzis, K., & Sheikholeslami, A.
- Venue
- IEEE Journal of Solid-State Circuits
- Published
- 2006-03
- Volume
- 41
- Issue
- 3
- Pages
- 712-727
- ISSN
- 0018-9200 (ISSN-L)
- OpenAlex
- W2062143991
- Cited by
- 1,228
- References
- 9
- FWCI
- 61.16
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.