Efficient Computation for Discrete Fractional Hadamard Transform

This paper introduces a new fast algorithm for the discrete fractional Hadamard transform (FHT). The proposed algorithm demonstrates superior computational efficiency. For data lengths ranging from <inline-formula> <tex-math notation="LaTeX">2 \leq N \leq 1024 </tex-math>...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on circuits and systems. I, Regular papers Ročník 71; číslo 10; s. 4698 - 4706
Hlavní autoři: Fan, Zi-Chen, Li, Di, Rahardja, Susanto
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Computational complexity
Computational efficiency
Computing time
Discrete fractional Hadamard transform
Eigenvalues and eigenfunctions
Fans
fast algorithms
matrix factorization
multiplication reduction
Signal processing algorithms
Symmetric matrices
Transforms
ISSN:1549-8328, 1558-0806
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper introduces a new fast algorithm for the discrete fractional Hadamard transform (FHT). The proposed algorithm demonstrates superior computational efficiency. For data lengths ranging from <inline-formula> <tex-math notation="LaTeX">2 \leq N \leq 1024 </tex-math></inline-formula>, our algorithm achieves a reduction in the number of multiplications by up to 96.53%, 81.82%, 33.33%, and 90% compared to four existing fast algorithms for the FHT. Additionally, we compare the execution times with those of existing fast algorithms, and the results show that the proposed algorithm has better performance. The reduced computational complexity makes the proposed algorithm a potential candidate for calculating the FHT.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1549-8328
1558-0806
DOI:10.1109/TCSI.2024.3441834