Number of multiplications necessary to compute length 2 n two-dimensional discrete Hartley transform DHT(2 n ;2)
Weihong Ma · Electronics Letters · 1992
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+1 – 6(n – 1)2n – 8. DHT (2n; 2) has the same multiplicative complexity as a corresponding real data 2D-DFT.