By Topic

Fast algorithm for the 3-D 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
$33 $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)
S. Boussakta ; Sect. of Electr. & Electron. Eng., Teesside Polytech., Middlesbrough, UK ; O. Alshibami

The application of multidimensional fast transforms to solve problems in image processing, motion analysis and multidimensional signal processing is growing. The discrete Hartley transform (DHT) is one of the new tools used in many applications including signal and image processing, digital filters, communication etc. This transform is closely related to the discrete Fourier transform, but it is a real-to-real transform and it has the same inverse. Many fast algorithms have been developed for the calculation of one-dimensional DHT. These algorithms are then used for the calculation of multidimensional Hartley transform through an intermediate transform using the row-column approach. However proper multidimensional algorithms can be more efficient and need to be developed. It is the aim of this paper to derive the 3-D vector radix for the 3-D discrete Hartley transform. The arithmetic operations of this algorithm are compared to similar algorithms using the row-column approach

Published in:

Acoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on  (Volume:6 )

Date of Conference: