A New Approach for Computing Multidimensional DFT's on Parallel Machines and its Implementation on the iPSC/860 Hypercube

IEEE Transactions on Signal Processing

Volumn 43, Issue 1, 1995, Pages 272-285

  Kechriotis, George I ^a   Bletsas, Michail ^b   Manolakos, Elias S ^b  

^a AWARE INC   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA HANDLING; DATA TRANSFER; FOURIER TRANSFORMS; MATHEMATICAL MODELS; POLES AND ZEROS; PROGRAM PROCESSORS;

DISCRETE FOURIER TRANSFORMS; GOOD THOMAS FACTONIZATION; IMPLEMENTATION PARAMETERS; REDUCED TRANSFORM ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0029207602     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.365307     Document Type: Article

References (19)

1. R. Tolimieri, M. An, and C. Lu, Algorithms for Discrete Fourier Transform and Convolution. New York: Springer Verlag, 1989.
2. L. Auslander, E. Feig, and S. Winograd, “New algorithms for the multidimensional discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 388-403, Feb. 1983.
3. I. Gertner, “A new efficient algorithm to compute the two-dimensional discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 36, pp. 1036-1050, July 1988.
4. H. J. Nussbaumer and P. Qualdalle, “Fast computation of discrete Fourier transforms using polynomial transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 169-181, 1979.
5. M. Vulis, “The weighted redundancy transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 1687-1692, Nov. 1989.
6. M. An et al. “Discrete fast-Fourier transforms: A tutorial survey,” in Advances in Electronics and Electron Physics. New York: Academic, pp. 2-69.
7. R. Tolimieri, M. An, and C. Lu, Mathematics of Multidimensional Fourier Transform Algorithms. New York: Springer-Verlag, 1993.
8. M. Rofheart, “Algorithms and methods for multidimensional digital signal processing,” Ph.D. thesis. City Univ. of New York, 1991.
9. A. Kojima, N. Sakurai, and J. Kishigami, “Motion detection using 3D-FFT spectrum,” in IEEE 1CASSP, 1993, pp. 213-216.
10. B. Porat and B. Friedlander, “A frequency domain algorithm for multiframe detection and estimation of dim targets,” IEEE Trans. Pattern Anal. Machine Intell., vol. 12, pp. 398-401, Apr. 1990.
11. I. J. Good, “The interaction algorithm and practical Fourier analysis,” J. Stat. Soc. Ser. B, vol. 20, 1958.
12. L. H. Thomas, “Using a computer to solve problems in physics,” in Applications of Digital Computers. Boston: Ginn, 1963.
13. S. Lang, Algebra. Reading, MA: Addison Wesley, 1970.
14. C. S. Burrus and P. W. Eschenbacher, “An in-place in-order prime factor FFT algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, pp. 806-817, 1981.
15. D P. Kolba and T. W. Parks, “A prime factor FFT algorithm using high-speed convolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 281-294, Aug. 1977.
16. C. Temperton, “A new set of minimum-add small-n rotated DFT modules,” J. of Comput. Physics, to appear, 1993.
17. S. Chu and C. S. Burrus, “A prime factor FFT algorithm using distributed arithmetic,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30. pp. 217-227, Feb. 1982.
18. C. Van Loan, “Computational frameworks for the fast Fourier transform.” in SIAM Frontiers in Applied Mathematics. Philadelphia: SIAM, 1992.
19. D. S. Scott, “Parallel I/O and solving out of core systems of linear equations,” in Proc. DAGS '93 Symposium (Hanover, NH), 1993. pp. 125-130.