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

Fast DHT algorithms for length N=q*2m

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)
Guoan Bi ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Yan Qiu Chen

This article presents an improved split-radix algorithm that can flexibly compute the discrete Hartley transforms (DHT) of length-q*2m where q is an odd integer. Comparisons with previously reported algorithms show that savings on the number of arithmetic operations can be made. Furthermore, a wider range of choices on different DHT lengths is naturally provided

Published in:

Signal Processing, IEEE Transactions on  (Volume:47 ,  Issue: 3 )

Date of Publication:

Mar 1999

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.