LAUSR

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.