Skip to main content
Article thumbnail
Location of Repository

Radix-2 x 2 x 2 algorithm for the 3-D discrete hartley transform\ud

By S. Boussakta, O.H. Alshibami and M.Y. Aziz

Abstract

The discrete Hartley transform (DHT) has proved\ud to be a valuable tool in digital signal/image processing and communications and has also attracted research interests in many multidimensional applications. Although many fast algorithms have been developed for the calculation of one- and two-dimensional (1-D and 2-D) DHT, the development of multidimensional algorithms in three and more dimensions is still unexplored and has not been given similar attention; hence, the multidimensional\ud Hartley transform is usually calculated through the row-column approach. However, proper multidimensional algorithms can be more efficient than the row-column method and need to be developed. Therefore, it is the aim of this paper to introduce the concept and derivation of the three-dimensional (3-D) radix-2 2X 2X\ud algorithm for fast calculation of the 3-D discrete Hartley transform. The proposed algorithm is based on the principles of the divide-and-conquer approach applied directly in 3-D. It has a simple butterfly structure and has been found to offer significant savings in arithmetic operations compared with the row-column approach based on similar algorithms

Year: 2001
OAI identifier: oai:eprints.whiterose.ac.uk:707

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.