Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartley transform

@article{Boussakta2001Radix22,
  title={Radix-2 × 2 × 2 algorithm for the 3-D discrete Hartley transform},
  author={Said Boussakta and Osama Alshibami and Mohammed Aziz},
  journal={IEEE Trans. Signal Process.},
  year={2001},
  volume={49},
  pages={3145-3156}
}
The discrete Hartley transform (DHT) has proved 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 Hartley… 

Figures and Tables from this paper

A Split Vector-Radix Algorithm for the 3-D Discrete Hartley Transform
TLDR
This algorithm offers substantial reductions in the numbers of multiplications, additions, data transfers, and twiddle factor evaluations or accesses to the look-up table, without a significant increase in the structural complexity compared to that of the existing 3-D vector radix FHT algorithm.
A Novel Split-Radix Fast Algorithm for 2-D Discrete Hartley Transform
This paper presents a fast split-radix- (2×2)/(8×8) algorithm for computing the 2-D discrete Hartley transform (DHT) of length N ×N with N = q · 2 m, where q is an odd integer. The
Multidimensional vector radix FHT algorithms
TLDR
These algorithms are derived for computing the discrete Hartley transform (DHT) of any dimension using an appropriate index mapping and the Kronecker product and possess properties such as high regularity, simplicity and in-place computation that are highly desirable for software and hardware implementations, especially for the M-D applications.
Fast algorithm for the 3-D DCT-II
TLDR
This paper introduces the 3-D vector-radix decimation-in-frequency (3-D VR DIF) algorithm, which possesses a regular structure, can be implemented in-place for efficient use of memory, and is faster than the conventional row-column-frame (RCF) approach.
A high performance hybrid parallel algorithm for fast calculation of 3-D convolution/correlation using the 3-D VR FHT for multi-dimensional signal processing applications
TLDR
The 3-D hybrid parallel algorithm is highly parallel and efficient, as it overcomes the computations overhead and performance limitations associated with the block filtering method by eliminating the overlapping blocks and boundary conditions in parallel filtering applications.
A high performance 3-D parallel filtering algorithm using the vector radix fast Hartley transform
  • M. Aziz, S. Boussakta, D. McLernon
  • Computer Science
    Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies
  • 2003
TLDR
The 3-D parallel algorithm is highly parallel and efficient as it overcomes the overhead and performance limitations of the block filtering method by eliminating the overlapping segments and boundary conditions in parallel filtering applications.
A novel method of splitting the 3D discrete Hartley transform
TLDR
The improvement of this method, the recurrent algorithm, that reduces about 1.6 times the number of multiplications is described, which is the best estimate of all existent algorithms.
An efficient three-dimensional decimation-in-time FHT algorithm based on the radix-2/4 approach
  • S. Bouguezel, M.O. Ahmad, M. Swamy
  • Computer Science, Engineering
    Proceedings of the Fourth IEEE International Symposium on Signal Processing and Information Technology, 2004.
  • 2004
In this paper, a decimation-in-time (DIT) fast Hartley transform (FHT) algorithm is proposed for efficient computation of the three-dimensional (3-D) discrete Hartley transform (DHT). It is based on
Fast 3-D algorithm for the 3-D IDCT
  • O. Alshibami, S. Boussakta, M. Darnell
  • Computer Science
    Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies
  • 2003
TLDR
The proposed algorithm is found to reduce the number of multiplications by about 41%, whilst keeping theNumber of additions the same, which makes the developed algorithm more suitable for 3-D image and video compression decoders involving the3-D IDCTs.
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
TLDR
An efficient algorithm for three-dimensional vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT).
...
...

References

SHOWING 1-10 OF 33 REFERENCES
On computing the discrete Hartley transform
TLDR
A complete set of fast algorithms for computing the discrete Hartley transform is developed, including decimation-in-frequency, radix-4, split radix, prime factor, and Winograd transform algorithms.
Fast computation of the two-dimensional generalised Hartley transforms
The two-dimensional generalised Hartley transforms (2-D GDHTs) are various half-sample generalised DHTs, and are used for computing the 2-D DHT and 2-D convolutions. Fast computation of 2-D GDHTs is
Split-radix fast Hartley transform in one and two dimensions
TLDR
The method is extended, in a straightforward manner, to the two-dimensional FHT (2-D FHT) by implementing the vector-radix approach, which requires many fewer computational operations than the nonsplit vector- Radix 2- D FHT method.
New split-radix algorithm for the discrete Hartley transform
  • G. Bi
  • Computer Science
    IEEE Trans. Signal Process.
  • 1997
TLDR
A split-radix algorithm that can flexibly compute the discrete Hartley transforms of various sequence lengths is presented and it shows that the length-3*2/sup m/ DHTs need a smaller number of multiplications than thelength-2/Sup m/DHTs, but they both require about the same computational complexity.
Vector-radix algorithm for a 2-D discrete Hartley transform
A new multidimensional Hartley transform is defined and a vector-radix algorithm for fast computation of the transform is developed. The algorithm is shown to be faster (in terms of multiplication
A three-dimensional DFT algorithm using the fast Hartley transform
TLDR
A three-dimensional (3-D) Discrete Fourier Transform (DFT) algorithm for real data using the one-dimensional Fast Hartley Transform (FHT) is introduced that is simpler and retains the speed advantage that is characteristic of the Hartley approach.
Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data
TLDR
An algorithm for the in-place computation of the discrete Fourier transform on real data: a decimation-in-time split-radix algorithm, more compact than the previously published one and a new fast Hartley transform algorithm with a reduced number of operations.
The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation
Fast computation of multidimensional discrete Hartley transform
TLDR
It is shown that the proposed algorithms offer a significant saving in computation over the existing methods for various array sizes.
Fast multidimensional discrete Hartley transform using Fermat number transform
It is shown that by using an index mapping scheme, the multidimensional discrete Hartley transform can be changed into convolutions that can be calculated very efficiently via the Fermat number
...
...