Janusz Piotr Paplinski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Janusz Piotr Paplinski has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Aleksandr Cariow
Faculty of Computer Science and Information Technology, West Pomeranian University of Technology in Szczecin, Żołnierska 49, 71-210 Szczecin, Poland
11 shared publications Adam Zuchowski
Department of Control and Measurement, West Pomeranian University of Technology, 26 Kwietnia 10, 71-126 Szczecin, Poland
3 shared publications- Marina Polyakova
Institute of Computer Systems, Odesa Polytechnic National University, Shevchenko ave., 1, 65044 Odesa, Ukraine
2 shared publications - Marta Makowska
Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Żołnierska 49, 71-210 Szczecin, Poland
2 shared publications Aleksandr Cariow
Faculty of Computer Science and Information Technology, West Pomeranian University of Technology in Szczecin
1 shared publication- Dorota Majorkowska-Mech
Faculty of Computer Science and Information Technology, West Pomeranian University of Technology in Szczecin, Zolnierska 49, 71-210 Szczecin, Poland
1 shared publication
Latest Publications
- 9 September 2026
- Published by PIAP - Industrial Research Institute for Automation and Measurements in Pomiary Automatyka Robotyka
- Vol. 30 (3) , 109-116
A Fast Algorithm for Quaternion Multiplication
Quaternion algebra is used in many fields, including electrical engineering, robotics, computer graphics, navigation systems, and image and signal processing. In these applications, reducing computational complexity is particularly important, especially by limiting the number of real multiplications required to compute quaternion products. This paper proposes fast quaternion multiplication algorithms that reduce the number of real multiplications compared with the classical direct method while preserving computational correctness.
- 9 September 2026
- Published by PIAP - Industrial Research Institute for Automation and Measurements in Pomiary Automatyka Robotyka
- Vol. 30 (3) , 109-116
A Fast Algorithm for Quaternion Multiplication
Quaternion algebra is used in many fields, including electrical engineering, robotics, computer graphics, navigation systems, and image and signal processing. In these applications, reducing computational complexity is particularly important, especially by limiting the number of real multiplications required to compute quaternion products. This paper proposes fast quaternion multiplication algorithms that reduce the number of real multiplications compared with the classical direct method while preserving computational correctness.
- Open Access
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (1) , 91-112
Algorithms for a small–sized Type II discrete Fourier transform
The paper is devoted to the development of algorithms for the odd-time discrete Fourier transform (type II DFT, or simply DFT-II). It presents efficient computational solutions related to the implementation of a small-sized DFT-II for input sequences of lengths 3, 4, 5, 6, 7, and 8. The derivation of each algorithm is described in detail, and computational complexity estimates are provided. The developed algorithms are implemented on field-programmable gate array (FPGA) platforms such as Spartan 3 and Spartan 6, demonstrating the advantages of their implementation in hardware environments where performance and resource utilization are critical. Key performance indicators such as the number of multiplications and additions as well as FPGA resource utilization are evaluated. The values of the maximum operating frequencies achieved are given. The results show a significant improvement in computational performance compared to the direct matrix-vector product, which proves the effectiveness of the obtained solutions.
- 1 January 2026
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 36 (1) , 91-112
Open AccessAlgorithms for a small–sized Type II discrete Fourier transform
The paper is devoted to the development of algorithms for the odd-time discrete Fourier transform (type II DFT, or simply DFT-II). It presents efficient computational solutions related to the implementation of a small-sized DFT-II for input sequences of lengths 3, 4, 5, 6, 7, and 8. The derivation of each algorithm is described in detail, and computational complexity estimates are provided. The developed algorithms are implemented on field-programmable gate array (FPGA) platforms such as Spartan 3 and Spartan 6, demonstrating the advantages of their implementation in hardware environments where performance and resource utilization are critical. Key performance indicators such as the number of multiplications and additions as well as FPGA resource utilization are evaluated. The values of the maximum operating frequencies achieved are given. The results show a significant improvement in computational performance compared to the direct matrix-vector product, which proves the effectiveness of the obtained solutions.
- Open Access
- 8 October 2025
- Published by MDPI AG in Electronics
- Vol. 14 (19) , 3958
Fast Discrete Krawtchouk Transform Algorithms for Short-Length Input Sequences
This paper presents new fast discrete Krawtchouk transform (DKT) algorithms for input sequences of length 3 to 8. Small-sized DKT algorithms can be utilized in image processing applications to extract local image features formed by a sliding spatial window, and they can also serve as building blocks for developing larger-sized algorithms. Existing strategies to reduce the computational complexity of DKT mainly focus on modifying the recurrence relations for Krawtchouk polynomials, dividing the input signals into blocks or layers, or using different methods to approximate the coefficient values. Algorithms developed using the first two strategies are computationally intensive, which introduces a significant time delay in the computation process. Algorithms based on the approximation of polynomial coefficient values reduce computation time but at the expense of reduced accuracy. We use a different approach based on reducing the block structure of the matrix to one of the previously developed block-structural patterns, which allows us to factorize the resulting matrix in such a way that it leads to a reduction in the computational complexity of the synthesized algorithm. We describe the algorithmic solutions we have obtained through data flow graphs. The proposed DKT algorithms reduce the number of multiplications, additions, and shifts by an average of 58%, 27%, and 68%, respectively, compared to the direct computation of DKT via matrix-vector product. These characteristics were averaged across the considered input sizes (from 3 to 8).
- 8 October 2025
- Published by MDPI AG in Electronics
- Vol. 14 (19) , 3958
Open AccessFast Discrete Krawtchouk Transform Algorithms for Short-Length Input Sequences
This paper presents new fast discrete Krawtchouk transform (DKT) algorithms for input sequences of length 3 to 8. Small-sized DKT algorithms can be utilized in image processing applications to extract local image features formed by a sliding spatial window, and they can also serve as building blocks for developing larger-sized algorithms. Existing strategies to reduce the computational complexity of DKT mainly focus on modifying the recurrence relations for Krawtchouk polynomials, dividing the input signals into blocks or layers, or using different methods to approximate the coefficient values. Algorithms developed using the first two strategies are computationally intensive, which introduces a significant time delay in the computation process. Algorithms based on the approximation of polynomial coefficient values reduce computation time but at the expense of reduced accuracy. We use a different approach based on reducing the block structure of the matrix to one of the previously developed block-structural patterns, which allows us to factorize the resulting matrix in such a way that it leads to a reduction in the computational complexity of the synthesized algorithm. We describe the algorithmic solutions we have obtained through data flow graphs. The proposed DKT algorithms reduce the number of multiplications, additions, and shifts by an average of 58%, 27%, and 68%, respectively, compared to the direct computation of DKT via matrix-vector product. These characteristics were averaged across the considered input sizes (from 3 to 8).
- Open Access
Digital Signal Processing (DSP)-Oriented Reduced-Complexity Algorithms for Calculating Matrix–Vector Products with Small-Order Toeplitz Matrices
Toeplitz matrix–vector products are used in many digital signal processing applications. Direct methods for calculating such products require multiplications and additions, where N denotes the order of the Toeplitz matrix. In the case of large matrices, this operation becomes especially time intensive. However, matrix–vector products with small-order Toeplitz matrices are of particular interest because small matrices often serve as kernels in modern digital signal processing algorithms. Perhaps reducing the number of arithmetic operations when calculating matrix–vector products in the case of small Toeplitz matrices gives less effect than of large ones, but this problem exists, and it needs to be solved. The traditional way to calculate such products is to use the fast Fourier transform algorithm. However, in the case of small-order matrices, it is advisable to use direct factorization of Toeplitz matrices, which leads to a reduction in arithmetic complexity. In this paper, we propose a set of reduced-complexity algorithms for calculating matrix–vector products with Toeplitz matrices of order . The main emphasis will be on reducing multiplicative complexity since multiplication in most cases is more time-consuming than addition. This paper also provides assessments of the implementation of the developed algorithms on FPGAs.Open AccessDigital Signal Processing (DSP)-Oriented Reduced-Complexity Algorithms for Calculating Matrix–Vector Products with Small-Order Toeplitz Matrices
Toeplitz matrix–vector products are used in many digital signal processing applications. Direct methods for calculating such products require multiplications and additions, where N denotes the order of the Toeplitz matrix. In the case of large matrices, this operation becomes especially time intensive. However, matrix–vector products with small-order Toeplitz matrices are of particular interest because small matrices often serve as kernels in modern digital signal processing algorithms. Perhaps reducing the number of arithmetic operations when calculating matrix–vector products in the case of small Toeplitz matrices gives less effect than of large ones, but this problem exists, and it needs to be solved. The traditional way to calculate such products is to use the fast Fourier transform algorithm. However, in the case of small-order matrices, it is advisable to use direct factorization of Toeplitz matrices, which leads to a reduction in arithmetic complexity. In this paper, we propose a set of reduced-complexity algorithms for calculating matrix–vector products with Toeplitz matrices of order . The main emphasis will be on reducing multiplicative complexity since multiplication in most cases is more time-consuming than addition. This paper also provides assessments of the implementation of the developed algorithms on FPGAs. - 26 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 28-32
Algorithm and Processor Architecture for the Implementation of the Minimum Filtering Technique in Complex-Valued CNNs
In this paper, we present a resource-efficient algorithmic solution regarding the fully parallel hardware implementation of the basic filtering operation performed in the complex-valued convolutional neural networks (CNNs). In fact, this basic operation computes the inner products of adjacent complex-valued vectors formed by a sliding time window from the current data stream with the impulse response vector of a 3-tap finite impulse response (FIR) filter. We adapt Winograd's minimal filtering algorithm for a case of the complex-valued data and applied it to develop a fully parallel hardware-oriented algorithm for implementing basic filtering operations in complex-valued CNNs. We also additionally apply the well-known Gauss's trick for multiplying complex numbers, which replaces 4 multiplications and 2 real additions with real 3 multiplications and 3 real additions. A general view of the architecture of the processor unit for the implementation of this operation is also given. A fully parallel hardware implementation of the proposed processor unit provides 50% savings in the number of embedded multipliers compared to a fully parallel hardware implementation of the naive calculation method.
- 26 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 28-32
Algorithm and Processor Architecture for the Implementation of the Minimum Filtering Technique in Complex-Valued CNNs
In this paper, we present a resource-efficient algorithmic solution regarding the fully parallel hardware implementation of the basic filtering operation performed in the complex-valued convolutional neural networks (CNNs). In fact, this basic operation computes the inner products of adjacent complex-valued vectors formed by a sliding time window from the current data stream with the impulse response vector of a 3-tap finite impulse response (FIR) filter. We adapt Winograd's minimal filtering algorithm for a case of the complex-valued data and applied it to develop a fully parallel hardware-oriented algorithm for implementing basic filtering operations in complex-valued CNNs. We also additionally apply the well-known Gauss's trick for multiplying complex numbers, which replaces 4 multiplications and 2 real additions with real 3 multiplications and 3 real additions. A general view of the architecture of the processor unit for the implementation of this operation is also given. A fully parallel hardware implementation of the proposed processor unit provides 50% savings in the number of embedded multipliers compared to a fully parallel hardware implementation of the naive calculation method.
- Open Access
- 6 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (15) , 9004
VLSI-Friendly Filtering Algorithms for Deep Neural Networks
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 M inner products between neighbouring vectors generated by a sliding time window from the input data stream and an M-tap finite impulse response filter. By leveraging the factorisation of the Hankel matrix, we have successfully reduced the multiplicative complexity of the matrix-vector product calculation. This approach has been applied to develop fully parallel and resource-efficient algorithms for M values of 3, 5, 7, and 9. The fully parallel hardware implementation of our proposed algorithms achieves approximately a 30% reduction in embedded multipliers compared to the naive calculation methods.
- 6 August 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (15) , 9004
Open AccessVLSI-Friendly Filtering Algorithms for Deep Neural Networks
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 M inner products between neighbouring vectors generated by a sliding time window from the input data stream and an M-tap finite impulse response filter. By leveraging the factorisation of the Hankel matrix, we have successfully reduced the multiplicative complexity of the matrix-vector product calculation. This approach has been applied to develop fully parallel and resource-efficient algorithms for M values of 3, 5, 7, and 9. The fully parallel hardware implementation of our proposed algorithms achieves approximately a 30% reduction in embedded multipliers compared to the naive calculation methods.
- Open Access
- 15 November 2021
- Published by MDPI AG in Electronics
- Vol. 10 (22) , 2800
Algorithmic Structures for Realizing Short-Length Circular Convolutions with Reduced Complexity
A set of efficient algorithmic solutions suitable to the fully parallel hardware implementation of the short-length circular convolution cores is proposed. The advantage of the presented algorithms is that they require significantly fewer multiplications as compared to the naive method of implementing this operation. During the synthesis of the presented algorithms, the matrix notation of the cyclic convolution operation was used, which made it possible to represent this operation using the matrix–vector product. The fact that the matrix multiplicand is a circulant matrix allows its successful factorization, which leads to a decrease in the number of multiplications when calculating such a product. The proposed algorithms are oriented towards a completely parallel hardware implementation, but in comparison with a naive approach to a completely parallel hardware implementation, they require a significantly smaller number of hardwired multipliers. Since the wired multiplier occupies a much larger area on the VLSI and consumes more power than the wired adder, the proposed solutions are resource efficient and energy efficient in terms of their hardware implementation. We considered circular convolutions for sequences of lengths 2, 3, 4, 5, 6, 7, 8, and 9.- 15 November 2021
- Published by MDPI AG in Electronics
- Vol. 10 (22) , 2800
Open AccessAlgorithmic Structures for Realizing Short-Length Circular Convolutions with Reduced Complexity
A set of efficient algorithmic solutions suitable to the fully parallel hardware implementation of the short-length circular convolution cores is proposed. The advantage of the presented algorithms is that they require significantly fewer multiplications as compared to the naive method of implementing this operation. During the synthesis of the presented algorithms, the matrix notation of the cyclic convolution operation was used, which made it possible to represent this operation using the matrix–vector product. The fact that the matrix multiplicand is a circulant matrix allows its successful factorization, which leads to a decrease in the number of multiplications when calculating such a product. The proposed algorithms are oriented towards a completely parallel hardware implementation, but in comparison with a naive approach to a completely parallel hardware implementation, they require a significantly smaller number of hardwired multipliers. Since the wired multiplier occupies a much larger area on the VLSI and consumes more power than the wired adder, the proposed solutions are resource efficient and energy efficient in terms of their hardware implementation. We considered circular convolutions for sequences of lengths 2, 3, 4, 5, 6, 7, 8, and 9. - Open Access
- 24 October 2021
- Published by MDPI AG in Algorithms
- Vol. 14 (11) , 309
A Parallel Algorithm for Dividing Octonions
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 implementing this operation. In the synthesis of the discussed algorithm, the matrix representation of this operation was used, which allows us to present the division of octonions by means of a vector–matrix product. Taking into account a specific structure of the matrix multiplicand allows for reducing the number of real multiplications necessary for the execution of the octonion division procedure.
- 24 October 2021
- Published by MDPI AG in Algorithms
- Vol. 14 (11) , 309
Open AccessA Parallel Algorithm for Dividing Octonions
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 implementing this operation. In the synthesis of the discussed algorithm, the matrix representation of this operation was used, which allows us to present the division of octonions by means of a vector–matrix product. Taking into account a specific structure of the matrix multiplicand allows for reducing the number of real multiplications necessary for the execution of the octonion division procedure.
- Open Access
- 3 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (17) , 8203
An Algorithm for Fast Multiplication of Kaluza Numbers
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 result with only 512 real multiplications and 576 real additions. More effective solutions have not yet been proposed. Nevertheless, it turned out that an even more interesting solution could be found that would further reduce the computational complexity of this operation. In this article, we propose a new algorithm that allows one to calculate the product of two Kaluza numbers using only 192 multiplications and 384 additions of real numbers.
- 3 September 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (17) , 8203
Open AccessAn Algorithm for Fast Multiplication of Kaluza Numbers
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 result with only 512 real multiplications and 576 real additions. More effective solutions have not yet been proposed. Nevertheless, it turned out that an even more interesting solution could be found that would further reduce the computational complexity of this operation. In this article, we propose a new algorithm that allows one to calculate the product of two Kaluza numbers using only 192 multiplications and 384 additions of real numbers.
- Open Access
- 29 July 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (15) , 7007
Fast 10-Point DFT Algorithm for Power System Harmonic Analysis
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-point DFT for harmonic power system analysis can improve accuracy and reduce errors caused by spectral leakage. This paper compares the computational complexity for an -point DFT with a -point DFT.- 29 July 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (15) , 7007
Open AccessFast 10-Point DFT Algorithm for Power System Harmonic Analysis
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-point DFT for harmonic power system analysis can improve accuracy and reduce errors caused by spectral leakage. This paper compares the computational complexity for an -point DFT with a -point DFT.