.png){kind=icon}
Return
Split-Radix Algorithm for the Discrete Hirschman Transform
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2021.3132577.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With the best basis function that compactly describes a discrete-time signal, the Discrete Hirschman Transform (DHT) has been proved to perform better than the Discrete Fourier Transform (DFT) in terms of high resolution and computational complexity. It is reasonable to develop fast algorithms for the DHT computation since the DHT has applied to multiple signal processing applications. In this letter, we propose a split-radix DHT (SRDHT) including mathematical decomposition and comparison of computation complexity. The SRDHT is computationally superior to the DFT and performs more efficiently than our previously developed radix-2/-4 DHTs, with further reduced arithmetic operations. We regard this proposed SRDHT as a more attractive candidate to compute the DHT for those existing and future Hirschman-based applications.
Keywords:
Signal processing algorithms
Discrete Fourier transforms
Shape
Arithmetic
Hardware
Convolution
Computational complexity
DHT
HOT
Hirschman
split-radix
FFT
algorithm
complexity
signal processing
convolution
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
ShareSaveShareSaveShareSave
ShareSaveReal-time implementation of the split-radix FFT - An algorithm to efficiently construct local butterfly modules.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
ShareSaveShareSaveShareSave
View more