.png){kind=icon}
返回
Split-Radix Algorithm for the Discrete Hirschman Transform
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2021.3132577.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Signal processing algorithms
Discrete Fourier transforms
Shape
Arithmetic
Hardware
Convolution
Computational complexity
DHT
HOT
Hirschman
split-radix
FFT
algorithm
complexity
signal processing
convolution
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
分享收藏分享收藏
Co-learning analysis of two perceptual learning tasks with identical input stimuli supports the reweighting hypothesis基于相同输入刺激的两个知觉学习任务的协同学习分析支持了权重调整假说。
OAAI
OAAI分享收藏Real-time implementation of the split-radix FFT - An algorithm to efficiently construct local butterfly modules.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏分享收藏
查看更多内容