|
| |
|
|
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.
|
|
| |
|
|
Real-time simulation and visualization of high-level model-based control of redundant parallel robots
Belda, Květoslav
The paper briefly introduces examples of high-level model-based control (Sliding Mode Control and Generalized Predictive Control) applied to the redundant parallel robots. The objective is a presentation of using MATLAB˙SIMULINK environment for real-time simulation and visualization of control of these robots. Implementation is accomplished by combination of C MEX S-Functions and ordinary C MEX-Files within SIMULINK scheme under support of Real-Time Windows Target (2.1) and Virtual Reality Toolbox (2.0).
|
|
|
Modular shift of a polynomial matrix using Matlab
Hurák, Zdeněk ; Šebek, Michael
Efficient algorithm for modular shift of a polynomial matrix is proposed in this note.The algorithm avoids any iteration that is inherent in standard Euclidean algorithm for division of polynomial matrices.It assumes that the denominator polynomial matrix is row-reduced.If it is not,it can always be transformed into row-reduced form accepting some additional computational cost. Numerical experiments with an implementation of the proposed algorithm in Matlab are reported.
|
host ::
RSS.