FHT - FEATURES



  • Uses real arithmetic in all computations

  • Bilateral transform, unlike the DFT

  • Similar butterfly structure as the RAD2

  • Approximately (6N log N - 8N) floating point operations

  • Simple conversion to Fourier domain exists

  • Formulas