Fast radix-3 algorithm for the generalized discrete Hartley transform of type II

Abstract : We present a new fast radix-3 algorithm for the computation of the length-N generalized discrete Hartley transform of type-II (GDHT-II), where N = 3^m, m ≥ 2. Then we apply this algorithm to the direct computation of length-N GDHT-II coefficients when given three adjacent length-N/3 GDHT-II coefficients. The computational complexity of the proposed method is lower than that of the traditional approach for length N ≥ 9. The arithmetic operations can be saved from 19% to 29% for N = 3^m varying from 9 to 243 and from 17% to 29% for N = 3×2^m varying from 12 to 384. Furthermore, the new approach can be easily implemented.
Type de document :
Article dans une revue
IEEE Signal Processing Letters, Institute of Electrical and Electronics Engineers, 2012, 19 (6), pp.348 - 351. 〈10.1109/LSP.2012.2194782〉
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

http://www.hal.inserm.fr/inserm-00692219
Contributeur : Lotfi Senhadji <>
Soumis le : dimanche 29 avril 2012 - 15:02:52
Dernière modification le : mardi 3 juillet 2018 - 10:58:04
Document(s) archivé(s) le : lundi 30 juillet 2012 - 02:25:14

Fichier

Fast_Radix-3_Algorithm_for_the...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Huazhong Shu, Jiasong Wu, Chufeng Yang, Lotfi Senhadji. Fast radix-3 algorithm for the generalized discrete Hartley transform of type II. IEEE Signal Processing Letters, Institute of Electrical and Electronics Engineers, 2012, 19 (6), pp.348 - 351. 〈10.1109/LSP.2012.2194782〉. 〈inserm-00692219〉

Partager

Métriques

Consultations de la notice

381

Téléchargements de fichiers

221