A fast algorithm is presented which computes the two-dimensional Hartley transform. This algorithm is referred to as the split vector radix algorithm. It uses the decimation in frequency decomposition and, due to its in-place property, it does not require midmemory devices or matrix transposition. Its computational structure is simpler than that of the algorithm of L.Z. Chen (1983), and it is easy to program. Compared with the vector radix algorithm of R. Kumaresan and P.K. Gupta (1986), the proposed algorithm saves about 35% of the multiplication and 10% of the additions for the discrete Fourier transform (DFT) of a 4096*4096 real valued input sequence.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Split vector radix algorithm for two-dimensional Hartley transform


    Contributors:
    Huang Shunji (author) / Wang Jianguo (author) / Qiu Hueizhong (author)


    Publication date :

    1991-11-01


    Size :

    288856 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English