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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Sylvanus Kla

dblp:90/4743 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 3Theory of computation · 2

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
2 papers
Processor architecture and microarchitecture · 56% Integrated circuit design · 44%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
arithmetic unit		 0.011994
BKM: A New Hardware Algorithm for Complex Elementary Functions · IEEE Trans. Computers 1994
Integrated circuit design › digital arithmetic circuits
shift-and-add arithmetic		 0.011994
BKM: A New Hardware Algorithm for Complex Elementary Functions · IEEE Trans. Computers 1994
Mathematical optimization › numerical computation
elementary function evaluation		 0.011994
BKM: A New Hardware Algorithm for Complex Elementary Functions · IEEE Trans. Computers 1994
Mathematical optimization
numerical computation		 0.011994
BKM: A New Hardware Algorithm for Complex Elementary Functions · IEEE Trans. Computers 1994
Processor architecture and microarchitecture › computer arithmetic
complex number representation		 0.011993
New Redundant Representations of Complex Numbers and Vectors · IEEE Trans. Computers 1993
Processor architecture and microarchitecture
computer arithmetic		 0.011993
New Redundant Representations of Complex Numbers and Vectors · IEEE Trans. Computers 1993
Integrated circuit design
redundant number representation		 0.011993
New Redundant Representations of Complex Numbers and Vectors · IEEE Trans. Computers 1993
Integrated circuit design › digital arithmetic circuits
carry-free addition		 0.011993
New Redundant Representations of Complex Numbers and Vectors · IEEE Trans. Computers 1993

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

shift-and-add · 0.0CORDIC · 0.0redundant number systems · 0.0redundant number system · 0.0signed-digit arithmetic · 0.0
YearPublicationVenuePosition
1994 Some Operators for On-Line Radix-2 Computations
Jean-Claude Bajard, Jean Duprat, Sylvanus Kla, Jean-Michel Muller
 J. Parallel Distributed Comput.3
1994 BKM: A New Hardware Algorithm for Complex Elementary Functions
abstract
A new algorithm for computing the complex logarithm and exponential functions is proposed. This algorithm is based on shift-and-add elementary steps, and it generalizes some algorithms by Briggs and De Lugish (1970), as well as the CORDIC algorithm. It can easily be used to compute the classical real elementary functions (sin, cos, arctan, ln, exp). This algorithm is more suitable for computations in a redundant number system than the CORDIC algorithm, since there is no scaling factor when computing trigonometric functions.>
Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller
 IEEE Trans. Computers2
1993 BKM: A new hardware algorithm for complex elementary functions
abstract
An algorithm for computing complex logarithms and exponentials is proposed. The algorithm is based on shift-and-add elementary steps, and it generalizes the Cordic algorithm. It can compute the usual real elementary functions. This algorithm is more suitable for computations in a redundant number system than Cordic, since there is no scaling factor for computation of trigonometric functions.>
Jean-Claude Bajard, Sylvanus Kla, Jean-Michel Muller
 IEEE Symposium on Computer Arithmetic2
1993 New Redundant Representations of Complex Numbers and Vectors
abstract
The authors present a redundant representation for complex numbers called polygonal representation. This representation enables fast carry-free addition, in a way quite similar to the carry-free addition in signed-digit number systems and is convenient for multiplication. The technique is generalized in order to handle n-dimensional vectors.>
Jean Duprat, Yvan Herreros, Sylvanus Kla
 IEEE Trans. Computers3
1991 New redundant representations of complex numbers and vectors
abstract
A new redundant representation for complex numbers, called polygonal representation, is presented. This representation enables fast carry-free addition (in a way quite similar to the carry-free addition in signed-digits number systems), and is convenient for multiplication. In addition, the technique is extended to handle n-dimensional vectors.>
Jean Duprat, Yvan Herreros, Sylvanus Kla
 IEEE Symposium on Computer Arithmetic3