Abstract
Highly parallel computing machines can vary over a wide range of design philosophies, but all depend on some form of space-time concurrency for their potential high-speed computing capacity. Typically, such computers feature a collection of homogeneous processing elements (nodes) together with an interconnection network and can be characterized by the granularity, or power, of the node processors, the degree of parallelism as measured by the number of independent processing elements and the complexity of node coupling, which describes the degree of interaction between nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gertner, I. (1988), “A New Efficient Algorithm to Compute the Twodimensional Discrete Fourier Transform,” IEEE Trans. ASSP ASSP-36(7), 1036–1050.
Gertner, I. and Tolimieri, R. (1989), “Fast Algorithm to Compute Multidimensional Discrete Fourier Transform,” SPIE Real-Time Signal Processing Proc., San Diego, CA, 132–146.
Kechriotis, G., An, M., Bletzas, M., Tolimieri, R., and Manolakos, E. (1995), “A new approach for computing multidimensional DFT’s on parallel machines and its implementation on the iPSC/860 Hypercube,” IEEE Trans. on SP 43(1), 272–285.
Rofheart, M. (1991), Algorithms and Methods for Multidimensional Digital Signal Processing, Ph.D. thesis, CUNY.
Rofheart, M. and Gertner, I. (1990), “A Parallel Algorithm for 2-D DFT Computation with No Interprocessor Comm.,” IEEE Trans. Paral. Dist. Syst. 1(3), 377–382.
Shamash, M. (1989), VLSI Architectures for Multidimensional Digital Signal Processing, Ph.D. thesis, Technion-Israel Institute of Technology.
Tsai, D. and Vulis, M. (1990), “Computing Discrete Fourier Transform on a Rectangular Data Array,” IEEE ASSP ASSP-38(2), 271–276.
Tolimieri, R., An, M., Abdelatif, Y., Lu, C, Kechriotis, G., and Anupindi, N. (1995), “Group Invariant Fourier Transform Algorithms,” in Advances in Imaging and Electron Physics, 93, Academic Press.
Vulis, M. (1989), “The Weighted Redundancy Transform,” IEEE ASSP ASSP-37(11), 1687–1692.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tolimieri, R., An, M., Lu, C. (1997). Reduced Transform Algorithms. In: Burrus, C.S. (eds) Mathematics of Multidimensional Fourier Transform Algorithms. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1948-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1948-4_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7352-3
Online ISBN: 978-1-4612-1948-4
eBook Packages: Springer Book Archive