Vector Hartley transform employing multiprocessors

Many parallel implementations for signal processing transforms have already been reported. The implementation of Hou's FHT algorithm (1987) has been studied on three multiprocessor architectures (MPAs): multiprocessors connected through a shared bus; multiprocessors connected by an indirect binary n-cube multistage interconnection network and mesh connected multiprocessors. The article analyzes the performance of a vector Hartley transform algorithm on these MPAs.<<ETX>>

[1]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[2]  J. D. Villasenor,et al.  Vector Hartley transform , 1989 .

[3]  Dharma P. Agrawal,et al.  Performance Analysis of FFT Algorithms on Multiprocessor Systems , 1983, IEEE Transactions on Software Engineering.

[4]  Hsieh S. Hou,et al.  The Fast Hartley Transform Algorithm , 1987, IEEE Transactions on Computers.

[5]  Mark G. Karpovsky,et al.  Fast Fourier transforms over finite groups by multiprocessor systems , 1990, IEEE Trans. Acoust. Speech Signal Process..