The DOI matches its Crossref record.
A Suggestion for a Fast Multiplier
Abstract
It is suggested that the economics of present large-scale scientific computers could benefit from a greater investment in hardware to mechanize multiplication and division than is now common. As a move in this direction, a design is developed for a multiplier which generates the product of two numbers using purely combinational logic, i.e., in one gating step. Using straightforward diode-transistor logic, it appears presently possible to obtain products in under 1, μsec, and quotients in 3 μsec. A rapid square-root process is also outlined. Approximate component counts are given for the proposed design, and it is found that the cost of the unit would be about 10 per cent of the cost of a modern large-scale computer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Very high-speed computing systems
Flynn, M. J. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5273 · Cited by 959
Approximate Multipliers Based on New Approximate Compressors
Esposito, D., Strollo, A. G. M., Napoli, E., De Caro, D., & Petra, N. (2018) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2018.2839266 · Cited by 308
A 12-GS/s 81-mW 5-bit Time-Interleaved Flash ADC With Background Timing Skew Calibration
El-Chammas, M., & Murmann, B. (2011) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2011.2108125 · Cited by 264
Meng, Z., Qian, W., Zhao, Y., Sun, Y., Yang, R., & Jiang, L. (2021) · 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE) · doi:10.23919/date51398.2021.9474179 · Cited by 10
Metadata
- Authors
- Wallace, C. S.
- Venue
- IEEE Transactions on Electronic Computers
- Published
- 1964-02
- Volume
- EC-13
- Issue
- 1
- Pages
- 14-17
- ISSN
- 0367-7508 (ISSN-L)
- OpenAlex
- W1983849809
- Cited by
- 1,808
- References
- 0
- FWCI
- 3.36
- 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 Suggestion for a Fast Multiplier. https://app.cochat.ai/papers/10.1109/pgec.1964.263830
- The paper
- Wallace, C. S. (1964). A Suggestion for a Fast Multiplier. IEEE Transactions on Electronic Computers. https://doi.org/10.1109/pgec.1964.263830
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.
