A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme
The DOI matches its Crossref record.
Abstract
This paper presents two techniques to reduce power consumption in content-addressable memories (CAMs). The first technique is to pipeline the search operation by breaking the match-lines into several segments. Since most stored words fail to match in their first segments, the search operation is discontinued for subsequent segments, hence reducing power. The second technique is to broadcast small-swing search data on less capacitive global search-lines, and only amplify this signal to full swing on a shorter local search-line. As few match-line segments are active, few local search-lines will be enabled, again saving power. We have employed the proposed schemes in a 1024/spl times/144-bit ternary CAM in 1.8-V 0.18-/spl mu/m CMOS, illustrating an overall power reduction of 60% compared to a nonpipelined, nonhierarchical architecture. The ternary CAM achieves a 7-ns search cycle time at 2.89fJ/bit/search.
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
Cited by
Content-Addressable Memory (CAM) Circuits and Architectures: A Tutorial and Survey
Pagiamtzis, K., & Sheikholeslami, A. (2006) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2005.864128 · Cited by 1,228
Self-citationChen, 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
“For dynamic power consumption, hierarchical ML is a very popular architecture to reduce high ML power consumption, such as pipelined-structure TCAM proposed in [19] and pulse NAND-NOR CAM (PNN-CAM) proposed in [20].”
Method
Metadata
- Authors
- Pagiamtzis, K., & Sheikholeslami, A.
- Venue
- IEEE Journal of Solid-State Circuits
- Published
- 2004-09
- Volume
- 39
- Issue
- 9
- Pages
- 1512-1519
- ISSN
- 0018-9200 (ISSN-L)
- OpenAlex
- W2043493229
- Cited by
- 161
- References
- 0
- FWCI
- 16.88
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme. https://app.cochat.ai/papers/10.1109/jssc.2004.831433
- The paper
- Pagiamtzis, K., & Sheikholeslami, A. (2004). A low-power content-addressable memory (CAM) using pipelined hierarchical search scheme. IEEE Journal of Solid-State Circuits. https://doi.org/10.1109/jssc.2004.831433
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.