Autor: Antoniou, G. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Fornasini-Marchesini 2-D State Space Models: Transfer Function Computation Via the Dft
Autorzy:: Antoniou, G.
Emmons, K.
Powiązania:: https://bibliotekanauki.pl/articles/911185.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: teoria systemów
transformata Fouriera
two dimensions system theory
Fourier transform
DFT algorithm
Fornasini-Marchesini's model
Opis:: A new algorithm is presented for the computation of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given two-dimensional (2-D) state space model of Fornasini-Marchesini type. The algorithm has been implemented in Matlab and uses the discrete Fourier transform (DFT). The simplicity and efficiency of the technique are illustrated by two examples.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 321-331
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: www-Based Boolean Function Minimization
Autorzy:: Tomaszewski, S. P.
Celik, I. U.
Antoniou, G. E.
Powiązania:: https://bibliotekanauki.pl/articles/908086.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: informatyka
digital logic
logic design
Boolean function
Boolean minimization
Quine-McCluskey metod
Opis:: In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful aid for students and professors in the fields of electrical and computer engineering and computer science as well as a valuable tool for digital designers.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 577-583
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On the realization theory of polynomial matrices and the algebraic structure of pure generalized state space systems
Autorzy:: Vardulakis, A. I. G.
Karampetakis, N. P.
Antoniou, E. N.
Tictopoulou, E.
Powiązania:: https://bibliotekanauki.pl/articles/907853.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: macierz wielomianowa
nierozkładalność
przestrzeń stanu
polynomial matrices
realization theory
minimality
irreducibility
generalized state space
infinite decoupling zeros
Opis:: We review the realization theory of polynomial (transfer function) matrices via 'pure' generalized state space system models. The concept of an irreducible-at-infinity generalized state space realization of a polynomial matrix is defined and the mechanism of the 'cancellations' of 'decoupling zeros at infinity' is closely examined. The difference between the concepts of irreducibility and minimality of generalized state space realizations of polynomial (transfer function) matrices is pointed out and the associated concepts of dynamic and non-dynamic variables appearing in generalized state space realizations are also examined.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2009, 19, 1; 77-88
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja