|
|
Fuzzy implications
Jirmusová, Veronika ; Zbořil, František (referee) ; Hliněná, Dana (advisor)
This thesis deals with fuzzy logical connectives, focusing in particular on fuzzy implications and their constructions. Two new classes of fuzzy implications were discovered through the construction of fuzzy implications using the -transformation. Additionally, an experiment was conducted to model fuzzy logical connectives based on empirical data, utilizing the approximation of the additive generator. A fuzzy implication was modeled using the approximated data. The experiment also inquires into how people perceived fuzzy implications in everyday language, whether they perceive them as equivalence, and whether the modeled implication resembles any known fuzzy implication.
|
|
|
Modern coding of speech signals using overcomplete models
Zapletal, Ondřej ; Průša, Zdeněk (referee) ; Rajmic, Pavel (advisor)
The theoretical contents of this thesis are studies of overcomplete models. Those are the models of signals, on which is set for their parametrization more variables, than it's necessary and consequently there's computed so-called sparse solution via iteration algorithms. A goal of this analysis is a selection just of the considerable (sparse) parameters. The theory is based on a linear algebra, vector spaces, bases and so-called frames. The task of the individual project of this thesis is a description and simulation of two speech coders: a classical coder based on linear predictive speech coding and a coder, that's making use of overcomplete stochastic ARMA processes models. A part of their realization is to simulate their decoders and a analyze their reconstruction quality. For their realization there is used MATLAB and an overcomplete models' library (toolbox frames).
|
|
|
Implementation of matrix decomposition and pseudoinversion on FPGA
Röszler, Pavel ; Rajmic, Pavel (referee) ; Smékal, David (advisor)
The purpose of this thesis is to implement algorithms of matrix eigendecomposition and pseudoinverse computation on a Field Programmable Gate Array (FPGA) platform. Firstly, there are described matrix decomposition methods that are broadly used in mentioned algorithms. Next section is focused on the basic theory and methods of computation eigenvalues and eigenvectors as well as matrix pseudoinverse. Several examples of implementation using Matlab are attached. The Vivado High-Level Synthesis tools and libraries were used for final implementation. After the brief introduction into the FPGA fundamentals the thesis continues with a description of implemented blocks. The results of each variant were compared in terms of timing and FPGA utilization. The selected block has been validated on the development board and its arithmetic precision was analyzed.
|
|
|
Implementation of matrix decomposition and pseudoinversion on FPGA
Röszler, Pavel ; Rajmic, Pavel (referee) ; Smékal, David (advisor)
The purpose of this thesis is to implement algorithms of matrix eigendecomposition and pseudoinverse computation on a Field Programmable Gate Array (FPGA) platform. Firstly, there are described matrix decomposition methods that are broadly used in mentioned algorithms. Next section is focused on the basic theory and methods of computation eigenvalues and eigenvectors as well as matrix pseudoinverse. Several examples of implementation using Matlab are attached. The Vivado High-Level Synthesis tools and libraries were used for final implementation. After the brief introduction into the FPGA fundamentals the thesis continues with a description of implemented blocks. The results of each variant were compared in terms of timing and FPGA utilization. The selected block has been validated on the development board and its arithmetic precision was analyzed.
|
|
|
Modern coding of speech signals using overcomplete models
Zapletal, Ondřej ; Průša, Zdeněk (referee) ; Rajmic, Pavel (advisor)
The theoretical contents of this thesis are studies of overcomplete models. Those are the models of signals, on which is set for their parametrization more variables, than it's necessary and consequently there's computed so-called sparse solution via iteration algorithms. A goal of this analysis is a selection just of the considerable (sparse) parameters. The theory is based on a linear algebra, vector spaces, bases and so-called frames. The task of the individual project of this thesis is a description and simulation of two speech coders: a classical coder based on linear predictive speech coding and a coder, that's making use of overcomplete stochastic ARMA processes models. A part of their realization is to simulate their decoders and a analyze their reconstruction quality. For their realization there is used MATLAB and an overcomplete models' library (toolbox frames).
|
|
| |
guest ::
