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

D. Marino

dblp:46/8089 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1972
—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
Integrated circuit design · 100%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital circuit design
0.011972
New Algorithms for the Approximate Evaluation in Hardware of Binary Logarithms and Elementary Functions · IEEE Trans. Computers 1972
Integrated circuit design › digital arithmetic circuits
special function unit
0.011972
New Algorithms for the Approximate Evaluation in Hardware of Binary Logarithms and Elementary Functions · IEEE Trans. Computers 1972

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

piecewise linear approximation · 0.0parabolic fit · 0.0
YearPublicationVenuePosition
1972 New Algorithms for the Approximate Evaluation in Hardware of Binary Logarithms and Elementary Functions
abstract
After an analysis of the errors introduced in the approximate computation of the x2function (O ≤ x ≤ 1) and its distributions, we find that a parabolic rather than linear fit to log2 (1 + x), (O ≤ x ≤ 1) can be performed in hardware without increasing the number of necessary sums. An improvement, by a factor of about 2.5, in the absolute maximum error can be expected. Full simulation on a digital computer confirms the theoretical analysis. We used partitioning of the range in only two subranges; the resulting hardware is not harder than in piecewise linear approximation. Examples are also included to show the effectiveness of the method for approximation of different functions.
D. Marino
IEEE Trans. Computers1