The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Extending the road beyond CMOS
Abstract
The accelerating pace of CMOS scaling is rapidly approaching the fundamental limits of MOSFET performance, even as the projected size of a high-performance and manufacturable MOSFET technology is currently being extended with growing confidence to the 22-nm node (featuring a 9-nm physical gate length). The new 2001 International Technology Roadmap for Semiconductors currently projects the industry to reach this node in 2016. However, this forecast assumes the traditional industry node-cycle cadence of a quadrupling of the number of transistors every three years for DRAMS and a return to the three-year cycle in 2004 for MPUs and ASICs. During the past several years the node cycles for MPUs have been accelerated to occur within two-year periods. This pace will bring the microelectronics industry to the end of silicon CMOS technology scaling sometime not later than 2016, and maybe as soon as 2010. The new Emerging Technologies section of the 2001 ITRS offers guidance on both sides of this problem: nanoelectronics for memory, logic, and information-processing architectures could possibly extend the time frame of the ITRS beyond CMOS.
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Cited by
Shenderova, O. A., Zhirnov, V. V., & Brenner, D. W. (2002) · Critical Reviews in Solid State and Materials Sciences · doi:10.1080/10408430208500497 · Cited by 797
Self-citationIntroduction to spin wave computing
Mahmoud, A., Ciubotaru, F., Vanderveken, F., Chumak, A. V., Hamdioui, S., Adelmann, C., & Cotofana, S. (2020) · Journal of Applied Physics · doi:10.1063/5.0019328 · Cited by 354
Optically Stimulated Artificial Synapse Based on Layered Black Phosphorus
Ahmed, T., Kuriakose, S., Mayes, E. L. H., Ramanathan, R., Bansal, V., Bhaskaran, M., Sriram, S., & Walia, S. (2019) · Small · doi:10.1002/smll.201900966 · Cited by 335
Ng, S., John, R. A., Yang, J.-T., & Mathews, N. (2020) · ACS Applied Electronic Materials · doi:10.1021/acsaelm.0c00002 · Cited by 18
Metadata
- Authors
- Hutchby, J. A., Bourianoff, G. I., Zhirnov, V. V., & Brewer, J. E.
- Venue
- IEEE Circuits and Devices Magazine
- Published
- 2002-03
- Volume
- 18
- Issue
- 2
- Pages
- 28-41
- ISSN
- 1558-1888 (ISSN-L)
- 8755-3996
- OpenAlex
- W2100507967
- Cited by
- 186
- References
- 3
- FWCI
- 15.07
- 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.