Fast Type-II Hartley Transform Algorithms for Short-Length Input Sequences

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...

Full description

Bibliographic Details
Main Authors: Marina Polyakova, Aleksandr Cariow
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Applied Sciences
Subjects:
complexity theory
digital signal processing
discrete Hartley transform
matrix factorization
signal processing algorithms
Online Access:https://www.mdpi.com/2076-3417/14/22/10719

Internet

https://www.mdpi.com/2076-3417/14/22/10719

Similar Items