In this paper, a novel split-radix algorithm for fast calculation the discrete Hartley transform of type-II (DHT-II) is intoduced. The algorithm is established through the decimation in time (DIT) approach, and implementedby splitting a length N of DHT-II into one DHT-II of length N/2 for even-indexed samples and two DHTs-II of length N/4 for odd-indexed samples. The proposed algorithm possesses the desired properties such as regularity, inplace calculation and it is represented by simple closed form decomposition sleading to considerable reductions in the arithmetic complexity compared to the existing DHT-II algorithms. Additionally, the validity of the proposed algorithm has been confirmed through analysing the arithmetic complexityby calculating the number of real additions and multiplications and associating it with the existing DHT-II algorithms.


    Access

    Download


    Export, share and cite



    Title :

    Direct split-radix algorithm for fast computation of type-II discrete Hartley transform


    Contributors:

    Publication date :

    2020-12-01


    Remarks:

    doi:10.12928/telkomnika.v18i6.16100
    TELKOMNIKA (Telecommunication Computing Electronics and Control); Vol 18, No 6: December 2020; 3067-3072 ; 2302-9293 ; 1693-6930 ; 10.12928/telkomnika.v18i6



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629




    Split vector radix algorithm for two-dimensional Hartley transform

    Huang Shunji / Wang Jianguo / Qiu Hueizhong | IEEE | 1991




    Efficient Computation of the 2-D Discrete Pseudo-Wigner Distribution by the Fast Hartley Transform

    Wu, Y. / Zhu, Z. / IEEE et al. | British Library Conference Proceedings | 1995


    Fast Algorithm of a Multidimensional Hypercomplex Discrete Fourier Transform with Radix-3 Decomposition

    Aliev, M. V. / Chicheva, M. A. | British Library Online Contents | 2005