By Topic

New fast discrete Hartley transform algorithm

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 $31
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)
Chan, Y.-H. ; Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong ; Siu, W.-C.

A new algorithm is proposed that enables the realisation of a discrete Hartley transform with the lowest number of multiplications yet reported. This algorithm also achieves the minimum number of additions compared with the reported algorithms achieving the same minimum number of multiplications.

Published in:

Electronics Letters  (Volume:27 ,  Issue: 4 )