Title :
Split-radix FHT algorithm for real-symmetric data
Abstract :
A fast algorithm for computing the discrete Hartley transform of a real-symmetric data sequence is introduced. The number of computations required is significantly less than that required by the usual split-radix fast Hartley transform.
Keywords :
computational complexity; subroutines; transforms; discrete Hartley transform; fast algorithm; number of computations required; real-symmetric data sequence; split radix FHT algorithm; split-radix fast Hartley transform;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19901276
