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

Jay J. Thomas

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

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

Systems, architecture and hardware · 1 · 1 first-author

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
Processor architecture and microarchitecture · 33% Integrated circuit design · 33% Parallel and multicore computing · 33%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › arithmetic unit
arithmetic unit design
0.011987
Implementing Exact Calculations in Hardware · IEEE Trans. Computers 1987
Parallel and multicore computing
array processor
0.011987
Implementing Exact Calculations in Hardware · IEEE Trans. Computers 1987
Integrated circuit design › digital circuit design › arithmetic circuit design
modular arithmetic
0.011987
Implementing Exact Calculations in Hardware · IEEE Trans. Computers 1987

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

single-modulus p arithmetic · 0.0
YearPublicationVenuePosition
1987 Implementing Exact Calculations in Hardware
abstract
A technique for performing exact calculations it discussed. The technique uses single-modulus P arithmetic to perform calculations over the finite field of integers and the finite ring of integers. It is shown that the arithmetic operations modulo P (which obviously can be impleinented in microprocessor configurations, VLSI, and/or software) can easily be extended from the range of values of the finite field of integers, modulo P, to the finite ring of integers, modulo pN where N is afny positive integer. This technique can be used for exact calculations over the rational numbers as well as complex numbers. Examples, block diagrams, And processor arrays are presented illustrating the simplicity of these operations.
Jay J. Thomas, Sydney R. Parker
IEEE Trans. Computers1