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

Jerry J. Cupal

dblp:16/3581 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

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

Systems, architecture and hardware · 1Theory of computation · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › digital circuit design
arithmetic circuit design
0.011990
Redundant Logarithmic Arithmetic · IEEE Trans. Computers 1990
Integrated circuit design › digital circuit design › arithmetic circuit design
logarithmic number system
0.011990
Redundant Logarithmic Arithmetic · IEEE Trans. Computers 1990
Integrated circuit design
redundant number representation
0.011990
Redundant Logarithmic Arithmetic · IEEE Trans. Computers 1990
Integrated circuit design › digital arithmetic circuits
online arithmetic
0.011990
Redundant Logarithmic Arithmetic · IEEE Trans. Computers 1990

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

table lookup · 0.0
YearPublicationVenuePosition
1990 Redundant Logarithmic Arithmetic
abstract
A number system that offers advantages in some situations over conventional floating point and sign/logarithmic number systems is described. Redundant logarithmic arithmetic, like conventional logarithmic arithmetic, relies on table lookups to make the arithmetic unit simpler than an equivalent floating point unit. The cost of 32 bit subtraction in a redundant logarithmic number system is lower than previously published logarithmic subtraction methods. The total memory requirement for a 29-bit redundant logarithmic unit is 16 K words compared to 22 K words by the best previously published conventional sign logarithm unit, assuming similar addition techniques are employed. A redundant logarithmic number system can be implemented with online arithmetic, which would be impractical for a conventional sign logarithm number system. The disadvantages of redundant arithmetic are typical of redundant number systems. First, the redundancy doubles the storage requirements for data values. Second, the representation can become ill-conditioned, especially as a result of iterated multiplications. Third, division and square root operations are more difficult to implement in redundant logarithmic arithmetic.>
Mark G. Arnold, Thomas A. Bailey, John R. Cowles, Jerry J. Cupal
IEEE Trans. Computers4
1989 Redundant logarithmic number systems
abstract
A new number system that offers advantages over conventional floating-point and sign/logarithm number systems is described. Called redundant logarithmic arithmetic, it relies, like conventional logarithmic arithmetic, on table lookups to make the arithmetic unit simpler than an equivalent floating-point unit. The cost of 32-b subtraction in a redundant logarithmic number system is lower than that of previously published logarithmic subtraction methods. Another advantage of a redundant logarithmic number system is that a single arithmetic unit can use the same hardware to add, subtract, or multiply in similar times.>
Mark G. Arnold, Thomas A. Bailey, John R. Cowles, Jerry J. Cupal
IEEE Symposium on Computer Arithmetic4