This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers
June 1995 (vol. 6 no. 6)
pp. 561-577

Abstract—Although fast Hartley transform (FHT) provides efficient spectral analysis of real discrete signals, the literature that addresses the parallelization of FHT is extremely rare. FHT is a real transformation and does not necessitate any complex arithmetics. On the other hand, FHT algorithm has an irregular computational structure which makes efficient parallelization harder. In this paper, we propose a efficient restructuring for the sequential FHT algorithm which brings regularity and symmetry to the computational structure of the FHT. Then, we propose an efficient parallel FHT algorithm for medium-to-coarse grain hypercube multicomputers by introducing a dynamic mapping scheme for the restructured FHT. The proposed parallel algorithm achieves perfect load-balance, minimizes both the number and volume of concurrent communications, allows only nearest-neighbor communications and achieves in-place computation and communication. The proposed algorithm is implemented on a 32-node iPSC/21 hypercube multicomputer. High-efficiency values are obtained even for small size FHT problems.

Index Terms—Digital signal processing, fast Hartley transform, parallel computing, multicomputer, hypercube, load balance, nearest-neighbor communication.

[1] R. N. Bracewell,“The fast Hartley transform,”Proc. IEEE, vol. 72, Aug. 1984.
[2] O. Buneman,“Conversion of FFT's to fast Hartley transforms,”SIAM J. Sci. Stat. Comput., vol. 7, no. 2, pp. 624–638, Apr. 1986.
[3] J. W. Cooley and J. W. Tukey,“An algorithm for the machine calculation of complex Fourier series,”Math. Comput., vol. 19, pp. 297–301, Apr. 1965.
[4] R. V. L. Hartley,“A more symmetrical Fourier analysis applied to transmission problems,”Proc. IRE, vol. 30, pp. 144–150, Mar. 1942.
[5] H. S. Hou,“The fast Hartley transform algorithm,”IEEE Trans. Comput., vol. C-36, pp. 147–156, Feb. 1987.
[6] ——,“Hypercube architecture for singular value decomposition and other fast transforms,”inProc. SPIE's Symp. Advances in Intelligent Robot. Syst., Cambridge, MA, 1987, paper 848–84.
[7] T. Le-Ngoc and M. Tue Vo,“Implementation and performance of the fast Hartley transform,”IEEE Micro, pp. 20–27, Oct. 1989.
[8] X. Lin, T. F. Chan, and W. J. Karplus,“The fast Hartley transform on the hypercube multiprocessors,”inProc. 3rd Conf. Hypercube Concurrent Comput. and Appl., Pasadena, CA:Assoc. Comput. Machinery, Jan. 1988, vol. I, pp. 1451–1454.
[9] H. V. Sorensen, D. L. Jones, C. S. Burrus, and M. T. Heideman,“On computing the discrete Hartley transform,”IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1231–1238, Oct. 1985.
[10] J. D. Villasenor and R. N. Bracewell,“Vector Hartley transform,”Electron. Lett., vol. 25, no. 17, pp. 1110–1111, Aug. 17, 1989.

Citation:
Cevdet Aykanat, Argun Dervi\c s, "Efficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 561-577, June 1995, doi:10.1109/71.388039
Usage of this product signifies your acceptance of the Terms of Use.