Radix-3×3 algorithm for the 2-D discrete Hartley transform
Résumé
Abstract—In this correspondence, we propose a vector-radix algorithm for the fast computation of two-dimensional (2-D) discrete Hartley transform (DHT). For data sequences whose length is power of three, a radix-3×3 decimation in frequency algorithm is developed. It decomposes a length-N×N DHT into nine length-(N/3)×(N/3) DHTs. Comparison of the computational complexity with known algorithms shows that the proposed algorithm, in some cases, reduces significantly the number of arithmetic operations.
Fichier principal
Radix-3x3_algorithm_for_the_2-D_discrete_Hartley_transform.pdf (252.66 Ko)
Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...