By Topic

A New Fast Radix-2 Decimation-in-Frequency Algorithm for Computing the Discrete Hartley Transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shah, G.A. ; Dept. of E&TC, NMIMS Univ., Mumbai, India ; Rathore, T.S.

The radix-2 decimation-in-time fast Hartley transform algorithm for computing the discrete Hartley transform (DHT) was introduced by Bracewell. A radix-2 decimation-in-frequency algorithm by Meckelburg and Lipka followed. Prado came up with an in-place version of Bracewells decimation-in-time fast Hartley transform algorithm. A set of fast algorithms for both decimation-in-time and decimation-in-frequency was further developed by Sorenson et al. A new fast radix-2 decimation-in-frequency algorithm for computing the DHT that requires less number of multiplications than those presented by Bracewell, Meckelburg and Lipka, Prado and Sorenson et al is proposed. It exploits the characteristics of the DHT matrix, exhibits stage structures with butterflies similar for each stage and introduces multiplying structures in the signal flow diagram. The operation count for the proposed algorithm is determined. It is verified by implementing the program in C.

Published in:

Computational Intelligence, Communication Systems and Networks, 2009. CICSYN '09. First International Conference on

Date of Conference:

23-25 July 2009