A new split radix fast algorithm for the discrete Hartley transform is presented. Comparisons with other reported algorithms are made in terms of the number of additions and multiplications. The algorithm is also simple and straightforward and can be easily implemented.
References
-
-
1)
-
H.S. Malvar
.
Fast computation of the discrete cosine transform and the discrete Hartleytransform.
IEEE Trans.
,
10 ,
1484 -
1488
-
2)
-
S.C. Pei ,
J.L. Wu
.
Split-radix fast Hartley transform.
Electron. Lett.
,
26 -
27
-
3)
-
H.S. Hou
.
The fast Hartley transform algorithm.
IEEE Trans.
,
2 ,
147 -
156
-
4)
-
H.V. Sorensen
.
On computing the discrete Hartley transform.
IEEE Trans.
,
2 ,
147 -
156
-
5)
-
R.N. Bracewell
.
(1986)
The Hartley transform.
-
6)
-
K. Meher
.
New high-speed prime-factor algorithm for discrete Hartley transform.
IEE Proc. F
,
1 ,
63 -
70
-
7)
-
Y.-H. Chan ,
W.-C. Siu
.
New fast discrete Hartley transform algorithm.
Electron. Lett.
,
347 -
349
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19941256
Related content
content/journals/10.1049/el_19941256
pub_keyword,iet_inspecKeyword,pub_concept
6
6