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

Helmut Steckenbiller

dblp:14/3990 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 4 · 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
Reconfigurable computing and FPGAs · 67% Embedded and real-time systems · 33%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
dynamic reconfiguration
0.012004
Buffer schemes for runtime reconfiguration of function variants in communication systems · FPGA 2004
Embedded and real-time systems
real-time signal processing
0.012004
Buffer schemes for runtime reconfiguration of function variants in communication systems · FPGA 2004
Reconfigurable computing and FPGAs › dynamic reconfiguration
reconfiguration latency hiding
0.012004
Buffer schemes for runtime reconfiguration of function variants in communication systems · FPGA 2004

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

simulation · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
2004 Buffer Schemes for Runtime Reconfiguration of Function Variants in Communication Systems
abstract
This contribution is an extension of our work, which introduced distributed buffer schemes for runtime reconfiguration in adaptive processing architectures, e.g., for streaming media applications. We propose a reconfiguration control protocol and depict results for a reference system implementation. With dynamic reconfiguration, area-cost of field-programmable logic (FPL) can be reduced by reuse, and potential for adaptive signal processing techniques can be enabled. The challenge with runtime reconfiguration is the reconfiguration latency. Given the limitation regarding reconfiguration latency with traditional approaches, we proposed distributed buffer schemes. The simulation results show that our approach enables potential for runtime reconfiguration for adaptive signal processing under real-time constraints. The proposed control protocol enables regular structures for modular based dynamic reconfiguration handling. Finally, we present implementation details and results of an architectural system implementation.
Dirk Eilers, Helmut Steckenbiller, Andreas Herkersdorf
FCCM2
2004 Buffer schemes for runtime reconfiguration of function variants in communication systems
abstract
This contribution introduces distributed buffering schemes for runtime reconfiguration in adaptive processing systems, e.g., real-time streaming media applications. With dynamic reconfiguration, the area-cost of field-programmable logic can be reduced by reuse of area resources, and potential for adaptive signal processing techniques can be enabled. The challenge with runtime reconfiguration is the reconfiguration latency. Given the limitations regarding reconfiguration latency with traditional approaches, we propose distributed buffering schemes, to hide latency for fast adaptive systems. To verify our approach, we do analytic and simulative modeling. The results show that our approach can guarantee zero loss-rates and reduce the additional delay (reduction of delay over 65% with estimated application profiles) in cases, where the traditional approach would not reach a desired Quality of Service. Dependent on the worst case application profile, it enables potential for runtime reconfiguration of adaptive signal processing under real-time constraints. Finally, we derive an architecture template with implementation details.
Helmut Steckenbiller, Rudi Knorr
FPGA1
2003 Architecture template with dynamic buffering for runtime reconfiguration of adaptive embedded communication systems
abstract
This contribution introduces a distributed dynamic buffering scheme for runtime reconfiguration in adaptive processing architectures, e.g., for streaming media applications. With dynamic reconfiguration, area-cost of field-programmable logic (FPL) can be reduced by reuse and potential for adaptive signal processing techniques can be enabled. The challenge with runtime reconfiguration is the reconfiguration latency. Given the limitations with traditional approaches, we propose a distributed dynamic buffering scheme to hide latency. The simulation results show that our approach enables potential for runtime reconfiguration for adaptive signal processing under real-time constraints. Finally, we derive an architecture template with implementation details of the dynamic buffer scheme.
Dirk Eilers, Helmut Steckenbiller, Rudi Knorr
FPT2
1992 A low cost solution for HDTV data reduction
Helmut Steckenbiller, Herbert Plansky
Microprocess. Microprogramming1