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.

Ingo Schäfer

dblp:18/1455 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2001
0000-0001-9264-6607ORCID · corroborated

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

Systems, architecture and hardware · 7 · 1 first-authorArtificial intelligence and machine learning · 3

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
Electronic design automation · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.021993
Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › logic synthesis
multilevel logic synthesis
0.011993
Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Electronic design automation › logic synthesis
boolean function manipulation
0.011992
Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › logic synthesis
boolean function representation
0.011992
Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › logic synthesis › technology mapping
FPGA technology mapping
0.011993
Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1993
Algorithms and data structures › numerical algorithms
transform computation
0.011992
Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992

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

spectral methods · 0.0fast walsh transform · 0.0local transform · 0.0boolean methods · 0.0
YearPublicationVenuePosition
2001 On a New Generation of Torque Controlled Light-Weight Robots
abstract
The paper describes the recent design and development efforts in DLR Robotics Lab towards the second generation of light-weight robots. The design of the light weight mechanics, integrated sensors and electronics is outlined. The fully sensory joint, with motor and link position sensors as well as joint torque sensors enables the implementation of effective vibration damping and advanced control strategies for compliant manipulation. The mechatronic approach incorporates a tight collaboration between mechanics, electronics and controller design. The authors hope that important steps towards a new generation of service and personal robots have been achieved.
Gerd Hirzinger, Alin Albu-Schäffer, Matthias Hähnle, Ingo Schäfer, Norbert Sporer
ICRA4
2001 Off-the-shelf vision for a robotic ball catcher
abstract
We present a system for catching a flying ball with a robot arm using off-the-shelf components (PC based system) for visual tracking. The ball is observed by a large baseline stereo camera, comparing each image to a slowly adapting reference image. We track and predict the target position using an extended Kalman filter, also taking into account the air drag. The calibration is achieved by simply performing a few throws and observing their trajectories, as well as moving the robot to some predefined positions.
Udo Frese, Berthold Bäuml, Steffen Haidacher, Günter Schreiber, Ingo Schäfer, Matthias Hähnle, Gerd Hirzinger
IROS5
2000 A Mechatronics Approach to the Design of Light-Weight Arms and Multifingered Hands
abstract
Describes design and development efforts in DLR's robotics lab towards a new generation of ultra-light weight robots with articulated hands. The design of fully sensorized joints with complete state feedback and the underlying mechanisms are outlined. The second light-weight arm generation is available now, as well as the second generation of a worldwide most highly integrated 4 finger-hand is available now. Thus we hope that important steps towards a new generation of service and personal robots have been achieved.
Gerd Hirzinger, Jörg Butterfaß, Max Fischer, Markus Grebenstein, Matthias Hähnle, Hong Liu 0002, Ingo Schäfer, Norbert Sporer
ICRA7
1993 An Architecture-driven Approach for the Fitting Problem in an Application-specific EPLD
Malgorzata Chrzanowska-Jeske, Steffen Goller, Ingo Schäfer
ISCAS3
1993 Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean functions with mapping to multiplexer based FPGA's
abstract
The introduction of the multiplexer-based Actel FPGA series ACT resulted in an increased interest in multiplexer circuits. This paper introduces a level-by-level top-down minimization algorithm for them. The concept of a local transform is applied for the generalization of the ratio parameter method for M(1) multiplexer synthesis having one data select input and a spectral method for M(2) multiplexer synthesis to determine redundant multiplexer inputs for M(k) multiplexer circuits. The algorithm developed for multilevel synthesis of M(k) multiplexer circuits for incompletely specified multioutput Boolean functions takes advantage of the combination of spectral and Boolean methods. The obtained multiplexer circuit can be directly realized with FPGA's like the Actel ACT series or the CLi 6000 series from Concurrent Logic. A simple heuristic is applied to map an M(1) multiplexer circuit to the Actel ACT1 family.>
Ingo Schäfer, Marek A. Perkowski
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1992 Fast Minimization of Mixed-Polarity AND/XOR Canonical Networks
abstract
A quasi-minimal algorithm for canonical restricted mixed polarity (CRMP) AND/XOR forms is presented. These forms, which include the consistent and inconsistent generalized Reed-Muller (GRM) forms, are both very easily testable and, on average, have smaller numbers of terms than sum-of-product (SOP) expressions. The set of test vectors for detecting stuck-at and bridging faults of a function realized in CRMP forms, like that of consistent (GRM) forms, is independent of the function. This test can be of order (n+4)r, where n is the number of variables in the function and r is the number of component consistent GRMs in the CRMP. The experimental results confirm the compactness of CRMPs as compared to SOP expressions.>
Marek A. Perkowski, Laszlo Csanky, Andisheh Sarabi, Ingo Schäfer
ICCD4
1992 Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions
abstract
A theory has been developed to calculate the Rademacher-Walsh transform from a cube array specification of incompletely specified Boolean functions. The importance of representing Boolean functions as arrays of disjoint ON- and DC-cubes has been pointed out, and an efficient new algorithm to generate disjoint cubes from nondisjoint ones has been designed. The transform algorithm makes use of the properties of an array of disjoint cubes and allows the determination of the spectral coefficients in an independent way. The programs for both algorithms use advantages of C language to speed up the execution. The comparison of different versions of the algorithm has been carried out. The algorithm and its implementation provide the fastest and most comprehensive program (having many options) known to the authors for the calculation of the Rademacher-Walsh transform. It successfully overcomes all drawbacks in the calculation of the transform from the design automation system based on spectral method-the SPECSYS system from Drexel University, which uses fast Walsh transform.>
Bogdan J. Falkowski, Ingo Schäfer, Marek A. Perkowski
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2