By Topic

Number of multiplications necessary to compute length-2n two-dimensional discrete Hartley transform DHT (2n; 2)

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)
Ma, W. ; Dept. of Electr. & Electron. Eng., South China Univ. of Technol., China

The multiplicative complexity of the two-dimensional discrete Hartley transform (2D DHT) of size 2n*2n, where n is a positive integer, is determined. The method of deviation is based on linear congruences and a ring structure. The minimal number of real multiplications necessary to compute a length-2n two-dimensional discrete Hartley transform over the field Q of rational numbers is 22n+11-6(n-1)2n-8. DHT (2n; 2) has the same multiplicative complexity as a corresponding real data 2D-DFT.

Published in:

Electronics Letters  (Volume:28 ,  Issue: 5 )