Next Article in Journal
Face Desensitization for Autonomous Driving Based on Identity De-Identification of Generative Adversarial Networks
Previous Article in Journal
Research on Energy Storage-Based DSTATCOM for Integrated Power Quality Enhancement and Active Voltage Support
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Fast Algorithms for the Small-Size Type IV Discrete Hartley Transform

by
Vitalii Natalevych
1,
Marina Polyakova
2,* and
Aleksandr Cariow
1,*
1
Faculty of Computer Science and Information Technology, West Pomeranian University of Technology, Szczecin, Żołnierska 49, 71-210 Szczecin, Poland
2
Institute of Computer Systems, Odesa Polytechnic National University, Shevchenko Ave., 1, 65044 Odesa, Ukraine
*
Authors to whom correspondence should be addressed.
Electronics 2025, 14(14), 2841; https://doi.org/10.3390/electronics14142841
Submission received: 3 June 2025 / Revised: 9 July 2025 / Accepted: 14 July 2025 / Published: 15 July 2025
(This article belongs to the Section Circuit and Signal Processing)

Abstract

This paper presents new fast algorithms for the fourth type discrete Hartley transform (DHT-IV) for input data sequences of lengths from 3 to 8. Fast algorithms for small-sized trigonometric transforms can be used as building blocks for synthesizing algorithms for large-sized transforms. Additionally, they can be utilized to process small data blocks in various digital signal processing applications, thereby reducing overall system latency and computational complexity. The existing polynomial algebraic approach and the approach based on decomposing the transform matrix into cyclic convolution submatrices involve rather complicated housekeeping and a large number of additions. To avoid the noted drawback, this paper uses a structural approach to synthesize new algorithms. The starting point for constructing fast algorithms was to represent DHT-IV as a matrix–vector product. The next step was to bring the block structure of the DHT-IV matrix to one of the matrix patterns following the structural approach. In this case, if the block structure of the DHT-IV matrix did not match one of the existing patterns, its rows and columns were reordered, and, if necessary, the signs of some entries were changed. If this did not help, the DHT-IV matrix was represented as the sum of two or more matrices, and then each matrix was analyzed separately, if necessary, subjecting the matrices obtained by decomposition to the above transformations. As a result, the factorizations of matrix components were obtained, which led to a reduction in the arithmetic complexity of the developed algorithms. To illustrate the space–time structures of computational processes described by the developed algorithms, their data flow graphs are presented, which, if necessary, can be directly mapped onto the VLSI structure. The obtained DHT-IV algorithms can reduce the number of multiplications by an average of 75% compared with the direct calculation of matrix–vector products. However, the number of additions has increased by an average of 4%.
Keywords: discrete Hartley transform; fast algorithms; complexity theory; signal processing; matrix factorization discrete Hartley transform; fast algorithms; complexity theory; signal processing; matrix factorization

Share and Cite

MDPI and ACS Style

Natalevych, V.; Polyakova, M.; Cariow, A. Fast Algorithms for the Small-Size Type IV Discrete Hartley Transform. Electronics 2025, 14, 2841. https://doi.org/10.3390/electronics14142841

AMA Style

Natalevych V, Polyakova M, Cariow A. Fast Algorithms for the Small-Size Type IV Discrete Hartley Transform. Electronics. 2025; 14(14):2841. https://doi.org/10.3390/electronics14142841

Chicago/Turabian Style

Natalevych, Vitalii, Marina Polyakova, and Aleksandr Cariow. 2025. "Fast Algorithms for the Small-Size Type IV Discrete Hartley Transform" Electronics 14, no. 14: 2841. https://doi.org/10.3390/electronics14142841

APA Style

Natalevych, V., Polyakova, M., & Cariow, A. (2025). Fast Algorithms for the Small-Size Type IV Discrete Hartley Transform. Electronics, 14(14), 2841. https://doi.org/10.3390/electronics14142841

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop