Demo Data from EDBT 2026 / reviewers in the wild / expert
S. Naganathan
dblp:75/6718
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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 |
Processor architecture and microarchitecture · 50% Integrated circuit design · 50% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture
arithmetic unit |
0.0 | 1 | 1993 | An Angle Recoding Method for CORDIC Algorithm Implementation · IEEE Trans. Computers 1993 |
Integrated circuit design › digital arithmetic circuits
CORDIC |
0.0 | 1 | 1993 | An Angle Recoding Method for CORDIC Algorithm Implementation · IEEE Trans. Computers 1993 |
Mathematical optimization › combinatorial optimization
greedy algorithm |
0.0 | 1 | 1993 | An Angle Recoding Method for CORDIC Algorithm Implementation · IEEE Trans. Computers 1993 |
Methods — techniques the papers use, named apart from their topics
greedy algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | An Angle Recoding Method for CORDIC Algorithm ImplementationabstractThe coordinate rotation digital computer (CORDIC), an iterative arithmetic algorithm for computing generalized vector rotations without performing multiplications, is discussed. For applications where the angle of rotation is known in advance, a method to speed up the execution of the CORDIC algorithm by reducing the total number of iterations is presented. This is accomplished by using a technique called angle recoding, which encodes the desired rotation angle as a linear combination of very few elementary rotation angles. Each of these elementary rotation angles takes one CORDIC iteration to compute. The fewer the number of elementary rotation angles, the fewer the number of iterations are required. A greedy algorithm which takes only O(n/sup 2/) operations is developed to perform CORDIC angle recoding. It is proven that this algorithm is able to reduce the total number of required elementary rotation angles by at least 50% without affecting the computational accuracy.> Yu Hen Hu, S. Naganathan |
IEEE Trans. Computers | 2 |