|
|
Problém řízení H_2 pro deskriptorové systémy
Kučera, Vladimír
A solution of the H_2 control problem is presented for linear descriptor systems. The solution proceeds in two steps. Firstly, the set of all controllers that stabilize the control system is parametrized. The mathematical tool applied are doubly coprime, proper stable factorizations of rational matrices. The factors are expressed in terms of stabilizing descriptor feedback and output injection gains, which represent degrees of freedom that can be used in the subsequent optimization.
|
|
|
Dynamic reconfiguration of FPGAs: a case study
Matoušek, Rudolf
This paper discusses dynamic reconfiguration achievable using current FPGA methodology. An analysis of implementation issues has been presented and desirable features of future generation of CAD tools have been discussed. Several practical examples have been presented together with their implementation data.
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Utilization of the HSLA toolbox for the FPGA prototyping
Pohl, Zdeněk ; Líčko, M.
An innovative design-flow for DSP algorithms usign high-speed logarithmic arithmetic (HSLA) toolbox is introduced on a demo RLS lattice application. Utilization of toolbox provides effective design time shortening and it makes designer work easier. Firstly, scripts in Matlab are written and checked. From working scripts, design is decomposed in Simulink to cycle-exact simulation and rewritten in Celoxica DK1 tool. Finally, hardware is targeted from DK1 and results are compared with simulations.
|
|
|
Extension for Xilinx System Generator - logarithmic arithmetic blockset
Líčko, Miroslav ; Métais, B. ; Tichý, Milan ; Matoušek, Rudolf
The paper introduces support of floating point(FP) data format for the Xilinx System Generator (XSG) using logarithmic arithmetic. This type of arithmetic seems to be one of the promising ways to solve FP sort of DSP problems in practice. Our 32-bit high-speed logarithmic arithmetic (HSLA) keeps the accuracy according to IEEE 754 and speed up some kinds of FP algorithms. Promising is 19-bit equivalent utilised int this paper. It offers reasonable precision for the practical use and has min.HW requirements.
|
|
| |
guest ::
