Fast Hartley Transform and Fast Fourier Transform

Правка en2, от armoking, 2021-03-30 03:03:22

Hello everyone, today I learned the fast Hartley transform and solved a problem with it. In my opinion, this algorithm is very similar to the FFT, but it does not use any complex numbers. So my question is — if this algorithm is easier to implement than the FFT, then why is the first one not as common as the Fourier transform?

And one more — if you have a better implementation (I think, it is easy), please share it in the comments.

Thanks

Теги fht, fft, fast hartley transform

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский armoking 2021-03-30 03:03:52 0 (published)
en2 Английский armoking 2021-03-30 03:03:22 42
en1 Английский armoking 2021-03-30 03:01:58 533 Initial revision (saved to drafts)