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

Karl Papadantonakis

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

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

Systems, architecture and hardware · 2 · 2 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
Hardware accelerators and domain-specific architectures · 50% Reconfigurable computing and FPGAs · 50%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA arithmetic
0.112009
Pipelining Saturated Accumulation · IEEE Trans. Computers 2009
Hardware accelerators and domain-specific architectures
signal processing accelerator
0.112009
Pipelining Saturated Accumulation · IEEE Trans. Computers 2009

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

pipelining · 0.1parallel prefix computation · 0.1
YearPublicationVenuePosition
2009 Pipelining Saturated Accumulation
abstract
Aggressive pipelining and spatial parallelism allow integrated circuits (e.g., custom VLSI, ASICs, and FPGAs) to achieve high throughput on many digital signal processing applications. However, cyclic data dependencies in the computation can limit parallelism and reduce the efficiency and speed of an implementation. Saturated accumulation is an important example where such a cycle limits the throughput of signal processing applications. We show how to reformulate saturated addition as an associative operation so that we can use a parallel-prefix calculation to perform saturated accumulation at any data rate supported by the device. This allows us, for example, to design a 16-bit saturated accumulator which can operate at 280 MHz on a Xilinx Spartan-3(XC3S-5000-4) FPGA, the maximum frequency supported by the component's DCM.
Karl Papadantonakis, Nachiket Kapre, André DeHon
IEEE Trans. Computers1
2005 Pipelining Saturated Accumulation
Karl Papadantonakis, Nachiket Kapre, André DeHon
FPT1