The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Placement and average interconnection lengths of computer logic
Abstract
The length of the interconnections for a placement of logic gates is an important variable in the estimation of wiring space requirements, delay values, and power dissipation. A formula for an upper bound on expected average interconnection length, based on partitioning results, is given for linear and square arrays of gates. This upper bound gives significantly lower interconnection length than the bound based upon random placement. Actual placements give average interconnection lengths of about half the upper bound given by theory.
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
The Pareto-Levy Law and the Distribution of Income
Mandelbrot, B. (1960) · International Economic Review · doi:10.2307/2525289 · Cited by 740
On a Pin Versus Block Relationship For Partitions of Logic Graphs
Landman, B. S., & Russo, R. L. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223159 · Cited by 714
Design automation of digital systems
Breuer, M. A. (1972) · CERN Document Server (European Organization for Nuclear Research) · Cited by 175
Gilbert, E. N. (1965) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0113021 · Cited by 46
Equivalence of Memory to “Random Logic”
Donath, W. E. (1974) · IBM Journal of Research and Development · doi:10.1147/rd.185.0401 · Cited by 45
Self-citation
Cited by
Bassett, D. S., Greenfield, D. L., Meyer-Lindenberg, A., Weinberger, D. R., Moore, S. W., & Bullmore, E. T. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000748 · Cited by 407
A stochastic wire-length distribution for gigascale integration (GSI). I. Derivation and validation
Davis, J. A., De, V. K., & Meindl, J. D. (1998) · IEEE Transactions on Electron Devices · doi:10.1109/16.661219 · Cited by 329
Low power microelectronics: retrospect and prospect
Meindl, J. D. (1995) · Proceedings of the IEEE · doi:10.1109/5.371970 · Cited by 316
The interpretation and application of Rent's rule
Christie, P., & Stroobandt, D. (2000) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.902258 · Cited by 256
Lanzerotti, M. Y., Fiorenza, G., & Rand, R. A. (2005) · IBM Journal of Research and Development · doi:10.1147/rd.494.0777 · Cited by 47
Metadata
- Authors
- Donath, W.
- Venue
- IEEE Transactions on Circuits and Systems
- Published
- 1979-04
- Volume
- 26
- Issue
- 4
- Pages
- 272-277
- ISSN
- 0098-4094 (ISSN-L)
- OpenAlex
- W2015540924
- Cited by
- 435
- References
- 5
- FWCI
- 12.30
- 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.