article

Free access

A state-of-the-art SIMD two-dimensional FFT array processor

Authors:

Mehrad Yasrebi,

G. J. LipovskiAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 12, Issue 3

Pages 21 - 27

https://doi.org/10.1145/773453.808162

Published: 01 January 1984 Publication History

Abstract

A novel implementation of a Two-dimensional FFT array processor is given. The reasons for its superior performance is the one-to-one and onto mapping of the problem communications topology onto the interconnection network, VLSI-based implementation, a proper choice for the number system, multiple-parallelism, and the use of packet-switching as opposed to circuit switching. A performance comparison also presented.

References

[1]

S. Anderson, "The Looping Algorithm Extended to Base 2t Rearrangable Switching Networks," IEEE Trans. on Comm., Vol. COM-25, No. 10, Oct. 77, PP. 1057-1063.

[2]

K.E. Batcher, "The Flip Network in STARAN," Proc. of the Int'l Parallel Processing Conf., Aug. 76, PP. 65-71.

[3]

K.E. Batcher, "The Multidimensional Access Memory in STARAN," IEEETC, Vol. C-26, No. 2, Feb. 77, PP. 174-177.

Digital Library

[4]

L.N. Bhuyan and D.P. Agrawal, "Applications of SIMD Computers in Signal Processing," AFIPS Conference Proceeding, Vol. 51, 1982, PP. 135-142.

[5]

L.N. Bhuyan and D.P. Agrawal, "VLSI Performance of Multistage Interconnection Networks Using 4*4 Switches," Distributed Comp. Sys. Conf., 1982, PP. 606-613.

[6]

S.H. Bokhari, "On the Mapping Problem," IEEETC, Vol. C-30, No. 3, March 81, PP.207-214.

Digital Library

[7]

D.M. Dias, J.R. Jump, "Packet Switching Interconnection Networks for Modular Systems," Computer, Vol. 14, No. 2, Dec. 81, PP. 43-53.

Digital Library

[8]

Intel Component Data Catelog, Intel Corp., Santa Clara, CA, Jan. 1982.

[9]

G.M. Masson, C.G. Gingher, S. Nakamura, "A Sampler of Circuit Switching Netwroks," Computer, Vol. 12, No. 6, June 79, PP. 32-47.

Digital Library

[10]

MC68000 16-bit Microprocessor User's Manual, 2nd Ed., Motorla, INC., Austin, TX, Jan. 1980.

[11]

D.A. Patterson and C.H. Se'quin, "Design Considerations for Single-Chip Computers of the Future," IEEETC, Vol. C-29, No. 2, Feb. 80, PP. 108-115.

Digital Library

[12]

M.C. Pease, "An Adaptation of the Fast Fourier Transform for Parallel Processing," J. ACM, Vol. 15, April 1968, PP. 252-264.

Digital Library

[13]

L.R. Rabiner and B. Gold, "Theory and Applications of Digital Signal Processing," Prectice-Hall, Inc., Englewood Cliffs, NJ, 1975.

[14]

H.J. Siegel, "The Theory Underlying the Partitioning of Permutation Networks," IEEETC, Vol. C-29, No. 9, Sept. 80, PP. 791-800.

Digital Library

[15]

H.J. Siegel, "A Model of SIMD Machines and A Comparison of Various Interconnection Networks," IEEETC, Vol. C-28, No. 12, Dec. 79, PP. 907-917.

Digital Library

[16]

H.J. Siegel, et al, "PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition", IEEETC, Vol. C-30, No. 12, Dec. 81.

Digital Library

[17]

H.S. Stone, "Parallel Processing With Perfect Shuffle," IEEETC, Vol. C-20, No. 2, Feb. 71, PP. 153-161.

Digital Library

[18]

N.S. Szabo and R.I. Tanaka, "Residue Arithmetic and Its Applications to Computer Technology," New York: McGraw-Hill, 1967.

[19]

B.D. Tseng, G.A. Jullien and W.C. Miller, "Implementation of FFT Structures Using The Residue Number System," IEEETC, Vo. C-28, No. 11, Nov. 79, PP. 831-844.

Digital Library

[20]

C.L. WU and T.Y. Feng, "On A Class of Multistage Interconnection Networks," IEEETC, Vol. C-29, Aug. 80, PP. 694-702.

Digital Library

[21]

M. Yasrebi, S. Deshpande and J.C. Browne, "A Comparison of Circuit Switching and Packet Switching for Data Transfer in Two Simple Image Processing Algorithms," Proc. of 1983 Int'l Parallel Processing Conf., Aug 23-26, PP. 25-28.

[22]

G.A. Jullien, "Residue Number Scaling and Other Operations Using ROM Arrays,", IEEETC, Vol. C-27, NO. 4, April 78, PP. 325-336.

Digital Library

Cited By

Antola ANegrini RSami MScarabottolo N(1990)Fault-tolerance in FFT arrays: time-redundancy approachesIEEE International Conference on Communications, Including Supercomm Technical Sessions10.1109/ICC.1990.117182(779-785)Online publication date: 1990
https://doi.org/10.1109/ICC.1990.117182
Zapata ERivera FBenavides ICarazo JPeskin R(1990)Multidimensional fast Fourier transform into SIMD hypercubesIEE Proceedings E Computers and Digital Techniques10.1049/ip-e.1990.0031137:4(253)Online publication date: 1990
https://doi.org/10.1049/ip-e.1990.0031
Antola ANegrini RSami MScarabottolo N(1992)Fault tolerance in FFT arrays: Time redundancy approachesJournal of VLSI signal processing systems for signal, image and video technology10.1007/BF009306424:4(295-316)Online publication date: 1-Nov-1992
https://doi.org/10.1007/BF00930642

Index Terms

A state-of-the-art SIMD two-dimensional FFT array processor

Recommendations

A state-of-the-art SIMD two-dimensional FFT array processor
ISCA '84: Proceedings of the 11th annual international symposium on Computer architecture

A novel implementation of a Two-dimensional FFT array processor is given. The reasons for its superior performance is the one-to-one and onto mapping of the problem communications topology onto the interconnection network, VLSI-based implementation, a ...
Algorithm and architecture for implementing FFT array processor with wafer scale integration
An Efficient Two-Dimensional FFT Algorithm

A new version of the radix-2 row-column method for computing two-dimensional fast Fourier transforms is proposed. It uses a ``multiple vector'' FFT algorithm to compute the transforms of all the columns in an array simultaneously while avoiding all ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 12, Issue 3

June 1984

348 pages

ISSN:0163-5964

DOI:10.1145/773453

Issue’s Table of Contents

ISCA '84: Proceedings of the 11th annual international symposium on Computer architecture
January 1984
373 pages
ISBN:0818605383
DOI:10.1145/800015
Chairman:
Dharma P. Agrawal

Copyright © 1984 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1984

Published in SIGARCH Volume 12, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
598
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)6

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Antola ANegrini RSami MScarabottolo N(1990)Fault-tolerance in FFT arrays: time-redundancy approachesIEEE International Conference on Communications, Including Supercomm Technical Sessions10.1109/ICC.1990.117182(779-785)Online publication date: 1990
https://doi.org/10.1109/ICC.1990.117182
Zapata ERivera FBenavides ICarazo JPeskin R(1990)Multidimensional fast Fourier transform into SIMD hypercubesIEE Proceedings E Computers and Digital Techniques10.1049/ip-e.1990.0031137:4(253)Online publication date: 1990
https://doi.org/10.1049/ip-e.1990.0031
Antola ANegrini RSami MScarabottolo N(1992)Fault tolerance in FFT arrays: Time redundancy approachesJournal of VLSI signal processing systems for signal, image and video technology10.1007/BF009306424:4(295-316)Online publication date: 1-Nov-1992
https://doi.org/10.1007/BF00930642

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents