Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John L. Wright

dblp:177/1210 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1973
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 70% Processor architecture and microarchitecture · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Integrated circuit design › residue number system arithmetic
base extension
0.011973
Remarks on Base Extension for Modular Arithmetic · IEEE Trans. Computers 1973
Processor architecture and microarchitecture
computer arithmetic
0.011973
Remarks on Base Extension for Modular Arithmetic · IEEE Trans. Computers 1973
Integrated circuit design
residue number system arithmetic
0.011973
Remarks on Base Extension for Modular Arithmetic · IEEE Trans. Computers 1973
Integrated circuit design › digital arithmetic circuits
sign detection
0.011973
Remarks on Base Extension for Modular Arithmetic · IEEE Trans. Computers 1973

Methods — techniques the papers use, named apart from their topics

scaling · 0.0modular arithmetic · 0.0base extension · 0.0
YearPublicationVenuePosition
1973 Remarks on Base Extension for Modular Arithmetic
abstract
It is shown that in a residue system with only the two moduli m-1 and m+1, base extension to modulus m is possible with savings in time and sometimes in hardware over conventional techniques. It is also shown that the underlying theory generalizes to provide comparable savings when extending any system with two moduli nm-1 and nm+1 (where n may be any integer) to include the third modulus m. For systems with more than two moduli, the savings are obtained in sign detection and partial base-extension operations. Savings are also possible during other residue operations (e.g., scaling, magnitude comparison, and overflow determination) in which sign detection and base extension are used.
Kenneth H. O'Keefe, John L. Wright
IEEE Trans. Computers2