Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Janusz P. Paplinski"'
Publikováno v:
Signals, Vol 5, Iss 3, Pp 417-437 (2024)
Toeplitz matrix–vector products are used in many digital signal processing applications. Direct methods for calculating such products require N2 multiplications and N(N−1) additions, where N denotes the order of the Toeplitz matrix. In the case o
Externí odkaz:
https://doaj.org/article/29f6a1612bf74fae9d3794a76f0dc947
Publikováno v:
Applied Sciences, Vol 13, Iss 15, p 9004 (2023)
The paper introduces a range of efficient algorithmic solutions for implementing the fundamental filtering operation in convolutional layers of convolutional neural networks on fully parallel hardware. Specifically, these operations involve computing
Externí odkaz:
https://doaj.org/article/bb63e44472af4dce9128f68395764dd2
Autor:
Aleksandr Cariow, Janusz P. Paplinski
Publikováno v:
Algorithms, Vol 14, Iss 11, p 309 (2021)
The article presents a parallel hardware-oriented algorithm designed to speed up the division of two octonions. The advantage of the proposed algorithm is that the number of real multiplications is halved as compared to the naive method for implement
Externí odkaz:
https://doaj.org/article/9eacef866ff6441c989a4f9d84f90002
Publikováno v:
Applied Sciences, Vol 11, Iss 17, p 8203 (2021)
This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same re
Externí odkaz:
https://doaj.org/article/32c7f8097e5247689d28845026ea141b
Autor:
Janusz P. Paplinski, Aleksandr Cariow
Publikováno v:
Applied Sciences, Vol 11, Iss 15, p 7007 (2021)
This article presents an efficient algorithm for computing a 10-point DFT. The proposed algorithm reduces the number of multiplications at the cost of a slight increase in the number of additions in comparison with the known algorithms. Using a 10-po
Externí odkaz:
https://doaj.org/article/69218619fe95470abdc677aec05a2d73
Autor:
Janusz Piotr Paplinski
Publikováno v:
Complexity, Vol 2018 (2018)
The main problem with the soft-computing algorithms is a determination of their parameters. The tuning rules are very general and need experiments during a trial and error method. The equations describing the bat algorithm have the form of difference
Externí odkaz:
https://doaj.org/article/56c0285edc4c4459aee7ec69ed2ae031
Publikováno v:
Applied Sciences
Volume 11
Issue 17
Applied Sciences, Vol 11, Iss 8203, p 8203 (2021)
Volume 11
Issue 17
Applied Sciences, Vol 11, Iss 8203, p 8203 (2021)
This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62c996491f0df550542a3c94a2101c56
Autor:
Aleksandr Cariow, Janusz P. Paplinski
Publikováno v:
Applied Sciences, Vol 11, Iss 7007, p 7007 (2021)
Applied Sciences
Volume 11
Issue 15
Applied Sciences
Volume 11
Issue 15
This article presents an efficient algorithm for computing a 10-point DFT. The proposed algorithm reduces the number of multiplications at the cost of a slight increase in the number of additions in comparison with the known algorithms. Using a 10-po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40ad3fbc9486739e55bb45ac869bdc22
https://www.mdpi.com/2076-3417/11/15/7007
https://www.mdpi.com/2076-3417/11/15/7007
Autor:
Janusz P. Paplinski
Publikováno v:
Automation and Robotics
There are systems which have inherent time delay. If the time delay used for controller design does not coincide with the real process time delay, than a close-loop system can be unstable, or may cause efficiency lost (Bjorklund & Ljung, 2003; Boukas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0edb63debbc48afb63b81b18bf5a045f
http://www.intechopen.com/articles/show/title/identification_of_continuous-time_systems_with__time_delays_by_global_optimization_algorithms_and_an
http://www.intechopen.com/articles/show/title/identification_of_continuous-time_systems_with__time_delays_by_global_optimization_algorithms_and_an
Autor:
Janusz P. Paplinski, Aleksandr Cariow
Publikováno v:
Electronics
Volume 9
Issue 12
Electronics, Vol 9, Iss 2115, p 2115 (2020)
Volume 9
Issue 12
Electronics, Vol 9, Iss 2115, p 2115 (2020)
In this article, we propose a set of efficient algorithmic solutions for computing short linear convolutions focused on hardware implementation in VLSI. We consider convolutions for sequences of length N= 2, 3, 4, 5, 6, 7, and 8. Hardwired units that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8363b2d83052a0b35becd5f0fc36ddb