Cart (Loading....) | Create Account
Close category search window
 

Implementation and performance of the fast 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)
Le-Ngoc, Tho ; Concordia Univ., Montreal, Que., Canada ; Vo, M.T.

The authors investigated the implementation aspects of the fast Hartley transform (FHT) in both software and hardware. They describe the modifications required to convert existing fast Fourier transform (FFT) programs to execute FHTs, showing the ease with which these modifications can be implemented. They compare execution time and memory storage requirements of both transforms and present power spectrum calculation and convolution as illustrative examples to compare the performances of the two transform techniques. They also give a comparative survey of the performances of various microprocessors and digital signal processors in FFT and FHT computation.<>

Published in:

Micro, IEEE  (Volume:9 ,  Issue: 5 )

Date of Publication:

Oct. 1989

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.