skip to main content
10.1145/1500774.1500791acmotherconferencesArticle/Chapter ViewAbstractPublication PagesafipsConference Proceedingsconference-collections
research-article
Free access

Applications of SIMD computers in signal processing

Published: 07 June 1982 Publication History

Abstract

This paper analyzes in detail how far the proposed Single Instruction Multiple Data (SIMD) computers with interconnection networks are applicable in the signal processing area. Decimation in the time radix-2 fast Fourier transform (FFT) algorithm is considered here for implementation in a multiprocessor system with shared bus and an SIMD computer with interconnection network.
Results are derived for data allocation, interprocessor communication, approximate computation time, speedup, and cost effectiveness for an N-point FFT with any P available processors. Further generalization is obtained for a radix-r FFT algorithm. N X N point, two-dimensional discrete Fourier transform (DFT) implementation is also considered, with one or more rows of input matrix allocated to each processor.
Various curves are plotted and a comparison in performance is carried out between a shared-bus multiprocessor and SIMD computer with interconnection network. It is shown that the latter gives much higher speedup for P > 16 and is more cost-effective even with the high cost of switches. N, P and r, considered here, are all powers of 2.

References

[1]
Aho, A. V., J. E. Hopcroft, and J. D. Ullman. "The Design and Analysis of Computer Algorithms." Reading, Massachusetts: Addison-Wesley, 1976.
[2]
Lint, B., and T. Agerwala. "Communication Issues in the Design and Analysis of Parallel Algorithms." IEEE Transactions on Software Engineering, SE-7 (1981), pp. 174--188.
[3]
Bergland, G. D. "A Parallel Implementation of the Fast Fourier Transfer Algorithm." IEEE Transactions on Computers, C-21 (1972), pp. 366--370.
[4]
Siegel, L. J., P. T. Muller, and H. J. Siegel. "FFT Algorithm for SIMD Machines." Proceedings of the 17th Annual Allerton Conference on Comm., Control, and Computing, University of Illinois, Urbana-Champaign, Oct. 1979, pp. 1006--1014.
[5]
Stone, H. S. "Parallel Processing with Perfect Shuffle." IEEE Transactions on Computers, C-20 (1971), pp. 153--161.
[6]
Pease, M. C. "The Indirect Binary n Cube Microprocessor Array." IEEE Transactions on Computers, C-26 (1977), pp. 458--473.
[7]
Abidi, M. A., and D. P. Agrawal. "On Conflict-Free Permutations in Multistage Interconnection Network." Journal of Digital Systems, (Special Issue on Parallel Processing) 4 (1980), pp. 115--134.
[8]
Wallach, Y., and A. Shimor. "Alternating Sequential Parallel Versions of FFT." IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP-28 (1980), pp. 236--242.
[9]
Rabiner, L. R., and B. Gold. "Theory and Applications of Digital Signal Processing." Englewood Cliffs, New Jersey: Prentice Hall, 1975.
[10]
Lenfant, J. "Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutation." IEEE Transactions on Computers, E-27, (1978), pp. 637--647.

Cited By

View all
  • (1986)Probabilistic Signal ProcessingMILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's10.1109/MILCOM.1986.4805734(19.2.1-19.2.3)Online publication date: Oct-1986

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
AFIPS '82: Proceedings of the June 7-10, 1982, national computer conference
June 1982
857 pages
ISBN:088283035X
DOI:10.1145/1500774
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • AFIPS: American Federation of Information Processing Societies

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 1982

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)39
  • Downloads (Last 6 weeks)10
Reflects downloads up to 19 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (1986)Probabilistic Signal ProcessingMILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's10.1109/MILCOM.1986.4805734(19.2.1-19.2.3)Online publication date: Oct-1986

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media