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

Antonin Hermanek

dblp:89/4578 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 8 · 3 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
Integrated circuit design · 67% Processor architecture and microarchitecture · 33%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital arithmetic circuits
0.112008
The European Logarithmic Microprocesor · IEEE Trans. Computers 2008
Integrated circuit design › digital circuit design › arithmetic circuit design
logarithmic number system
0.112008
The European Logarithmic Microprocesor · IEEE Trans. Computers 2008
Processor architecture and microarchitecture
microprocessor design
0.112008
The European Logarithmic Microprocesor · IEEE Trans. Computers 2008

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

superscalar pipelining · 0.1
YearPublicationVenuePosition
2011 Heterogeneous Platform for Stream Based Applications on FPGAs
abstract
The complexity of embedded systems is ever increasing, to support wide range of application domains. Dedicated hardware provides improved performance but with limited resources reusability and application scalability. Using higher abstraction methods for hardware development shortens the time to market. The concept of hardware objects (HWO) allows for more efficient hardware resource reuse and scalability of the target application. A single task of the application can be mapped on an appropriate type of hardware structure. A single hardware structure can be shared in time by several application tasks, multiple instances of the same HW structure can be used for concurrent computation. Uniform hardware object structure shortens design time and simplifies design of target system independently on application domain. The system could contain a heterogeneous set of HWO instances to satisfy all application domains.
Jan Kloub, Tomas Mazanec, Antonin Hermanek
FPL3
2010 Blind image deconvolution algorithm on NVIDIA CUDA platform
abstract
Advanced image processing algorithms usually require high computing performance. Today's personal computers (PCs) offer satisfying resources for implementation of image processing tasks. However, as the image processing techniques are becoming more and more complex other implementation possibilities have to be searched. Since image processing algorithms usually comply with the Single Instruction Multiple Data (SIMD) model, implementation efforts using such hardware resources are suitable. An example of the SIMD hardware component available nowadays is the graphics processor (GPU) embedded in modern graphics cards manufactured for PCs. In this paper, the implementation of a blind image deconvolution algorithm using graphics processor as the SIMD computing resource is presented. The resulting performance is compared to the performance achieved on a common general-purpose processor (CPU).
Tomas Mazanec, Antonin Hermanek, Jan Kamenický
DDECS2
2010 Reducing Power Consumption of an Embedded DSP Platform through the Clock-Gating Technique
abstract
The paper describes application of the clock-gating techniques, often used in ASIC designs, to the field of FPGA-based systems. The clock-gating techniques are used to reduce the total power of the system. To achieve this, we reduce clock power consumption of the system by switching-off the clock signal for the parts of system that are not used. The system presented in this paper is based on the main processor, extended with several reconfigurable accelerators. These accelerators extend the processor capabilities by several vector operations and can be reprogrammed in run-time. Clock gating, in our design, is used to switch the accelerators off when not used. As the accelerators can represent a major part of the system size, switching them off can significantly reduce the power consumption. We also propose the method for estimation of the reduction of power consumption that can be achieved using the clock-gating technique.
Antonin Hermanek, Michal Kunes, Milan Tichý
FPL1
2008 The European Logarithmic Microprocesor
abstract
In 2000 we described a proposal for a logarithmic arithmetic unit, which we suggested would offer a faster, more accurate alternative to floating-point procedures. Would it in fact do so, and could it feasibly be integrated into a microprocessor so that the intended benefits might be realized? Here, we describe the European logarithmic microprocessor, a device designed around that unit, and compare its performance with that of a commercial superscalar pipelined floating-point processor. We conclude that the experiment has been successful, and that for 32-bit work, logarithmic arithmetic may now be the technique of choice.
John N. Coleman, Christopher I. Softley, Jirí Kadlec, Rudolf Matousek, Milan Tichý, Zdenek Pohl, Antonin Hermanek, Nico F. Benschop
IEEE Trans. Computers7
2006 Using Reconfigurable HW for High Dimensional CAF Computation
abstract
In modern radio location systems based on passive coherent location (PCL), one of the key problems is an efficient and accurate computation of the cross ambiguity function (CAF). This function is related to the direct signal and signals reflected from localized targets. CAF represent power spectral density distribution of the cross-correlation between direct and reflected signals. In this paper we present an attempt to implement (numerically effective and sufficiently accurate) the CAF computation accelerator on FPGA. The results show that this accelerator could be used to compute CAF in real-time in the future PCL systems. The presented design has been implemented in PC accelerator cards based both on Xilinx Virtex IV and Altera Stratix II devices. The presented contribution gives overall information about the algorithms, accelerator architecture design and achieved performance. The possibilities of the future enhancements are discussed.
Antonin Hermanek, Michal Kunes, Michal Kvasnicka
FPL1
2004 Using Logarithmic Arithmetic to Implement the Recursive Least Squares (QR) Algorithm in FPGA
Jan Schier, Antonin Hermanek
FPL2
2003 FPGA Implementation of the Adpaptive Lattice Filter
Antonin Hermanek, Zdenek Pohl, Jirí Kadlec
FPL1
2001 Implementation of (Normalised) RLS Lattice on Virtex
Felix Albu, Jirí Kadlec, Christopher I. Softley, Rudolf Matousek, Antonin Hermanek, Nick Coleman, Anthony D. Fagan
FPL5