Abstract
Methods for the parallel computation of a multidimensional hypercomplex discrete Fourier transform (HDFT) are considered. The basic idea consists in the application of the properties of the hypercomplex algebra in which this transform is performed. Additional possibilities for increasing the efficiency of the algorithm are provided by the natural parallelism of the multidimensional Cooley-Tukey scheme.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
