Fast Type-II Hartley Transform Algorithms for Short-Length Input Sequences
This paper presents the type-II fast discrete Hartley transform (DHT-II) algorithms for input data sequences of lengths from 2 to 8. The starting point for developing the eight algorithms is the representation of DHT-II as a matrix–vector product. The underlying matrices usually have a good block st...
Saved in:
| Main Authors: | Marina Polyakova, Aleksandr Cariow |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/14/22/10719 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Fast Discrete Tchebichef Transform Algorithms for Short-Length Input Sequences
by: Aleksandr Cariow, et al.
Published: (2025-05-01) -
Fractional Hartley Transform and its Inverse
by: Vasant Gaikwad
Published: (2023-03-01) -
Small-Size Algorithms for Quaternion Discrete Fourier Transform
by: Aleksandr Cariow, et al.
Published: (2024-11-01) -
Secure OFDM Transmission Precoded by Chaotic Discrete Hartley Transform
by: Adnan A.E. Hajomer, et al.
Published: (2018-01-01) -
Słońce i cień. Dramaturgia Posłańca: Hartley / Pinter / Losey
by: Olga Katafiasz
Published: (2015-01-01)