Fast DHT algorithms for length N=q*2m

  • Authors:
  • Guoan Bi;Yan Chen

  • Affiliations:
  • Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ.;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 1999

Quantified Score

Hi-index 35.68

Visualization

Abstract

This article presents an improved split-radix algorithm that can flexibly compute the discrete Hartley transforms (DHT) of length-q*2m where q is an odd integer. Comparisons with previously reported algorithms show that savings on the number of arithmetic operations can be made. Furthermore, a wider range of choices on different DHT lengths is naturally provided