Fast DHT algorithms for length N=q*2(m)

Authors
Citation
Ga. Bi et Yg. Chen, Fast DHT algorithms for length N=q*2(m), IEEE SIGNAL, 47(3), 1999, pp. 900-903
Citations number
10
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON SIGNAL PROCESSING
ISSN journal
1053587X → ACNP
Volume
47
Issue
3
Year of publication
1999
Pages
900 - 903
Database
ISI
SICI code
1053-587X(199903)47:3<900:FDAFLN>2.0.ZU;2-3
Abstract
This correspondence presents an improved split-radix algorithm that can fle xibly compute the discrete Hartley transforms (DHT) of length-q * 2(m) wher e q is an odd integer. Comparisons with previously reported algorithms show that savings on the number of arithmetic operations can be made. Furthermo re, a wider range of choices on different DHT lengths is naturally provided .