DocumentCode :
1336545
Title :
Fast Radix-2 Algorithm for the Discrete Hartley Transform of Type II
Author :
Chiper, Doru Florin
Author_Institution :
Dept. of Appl. Electron., Tech. Univ. Gh. Asachi Iasi, Iasi, Romania
Volume :
18
Issue :
11
fYear :
2011
Firstpage :
687
Lastpage :
689
Abstract :
We present a new efficient method for the computation of the discrete Hartley transform of type II and radix-2 length N=2n. This recursive method requires a reduced number of arithmetic operations compared with existing methods and can be easily implemented. A new efficient method for the direct computation of a length N type-II DHT from two adjacent DHT-II sequences of length N/2 is also presented.
Keywords :
digital arithmetic; discrete Hartley transforms; signal processing; arithmetic operations; discrete Hartley transform; fast radix-2 algorithm; recursive method; Algorithm design and analysis; Computational efficiency; Discrete Fourier transforms; Equations; Mathematical model; Signal processing algorithms; Discrete Hartley transform; fast radix-2 algorithm; low arithmetic cost;
fLanguage :
English
Journal_Title :
Signal Processing Letters, IEEE
Publisher :
ieee
ISSN :
1070-9908
Type :
jour
DOI :
10.1109/LSP.2011.2170166
Filename :
6031905
Link To Document :
بازگشت