By Topic

New fast algorithm to compute two-dimensional 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 $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

1 Author(s)
Dekun Yang ; Dept. of Radio Eng., South China Univ. of Technol., Guangdong, China

A new fast algorithm for computing the two-dimensional discrete Hartley transform is presented. This algorithm requires the lowest number of multiplications compared with other related algorithms.

Published in:

Electronics Letters  (Volume:25 ,  Issue: 25 )