Premium
Fast computation of the discrete Hartley transform
Author(s) -
Jain Priyanka,
Kumar Balbir,
Jain S. B.
Publication year - 2010
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.574
Subject(s) - discrete hartley transform , discrete fourier transform (general) , hartley transform , discrete sine transform , computation , algorithm , sequence (biology) , fast fourier transform , computer science , mathematics , spectrum (functional analysis) , discrete cosine transform , fractional fourier transform , discrete mathematics , fourier transform , mathematical analysis , artificial intelligence , fourier analysis , image (mathematics) , physics , quantum mechanics , biology , genetics
The discrete Hartley transform (DHT) is a real‐valued transform closely related to the discrete Fourier transform (DFT) of a real‐valued spectrum which preserves some useful properties of DFT. In this paper, an algorithm is proposed to realize one‐dimensional DHT with sequence length N =2 (2 × m ) , m ⩾2. The proposed algorithm requires fewer multiplications than some of the algorithms in the literature. Copyright © 2008 John Wiley & Sons, Ltd.