Skip to Main Content
An algorithm for computing the two-dimensional discrete Hartley transform (2D-DHT) of size pn*pn, where p is an odd prime number and n a positive integer, is proposed. The algorithm is based on linear congruences and a local ring structure. The 2D-DHT is calculated by the sum of the cores of the discrete Hartley transform, CHTs.
Date of Publication: 11 Oct. 1990