Back to Results
First PageMeta Content
Digital signal processing / Parallel computing / Supercomputers / Fast Fourier transform / Numerical analysis / Cooley–Tukey FFT algorithm / Discrete Fourier transform / IWarp / WARP / Mathematical analysis / Computing / Fourier analysis


in Proceedings of the Scalable High Performance Computing Conference, Knoxville, TN, IEEE, May, 1994, pp[removed]Computing the Pipelined Phase-Rotation FFT
Add to Reading List

Document Date: 2005-07-30 22:26:51

Open Document

File Size: 126,42 KB

Share Result on Facebook

City

Philadelphia / Knoll Square Ashburn / Knoxville / /

Company

Prentice-Hall / COX / E-Systems Inc. / Intel / Peter J. Lieu L.P. / /

/

Facility

pipeline FFT / Computer Science Carnegie Mellon University / Square Ashburn / /

IndustryTerm

typical real-time signal processing application / iWarp systems / high-speed parallel computing / memory-bank conflict / important algorithm / communications links / parallel processing / signal processing / parallel systems / scientific computing / /

MarketIndex

set 20 / /

Organization

John E. Whelchel School of Computer Science Carnegie Mellon University Pittsburgh / QC FN / Advanced Research Projects Agency / Air Force office of Scientific Research / Carnegie Mellon / Association for Computing Machinery / /

Person

LeeAnn Tzeng / Fr Figure / Tom Warfel / Doug Noll / Doug Smith / /

Position

left end / programmer / /

Product

Coby CX 7 Radio / /

ProgrammingLanguage

MATLAB / /

ProvinceOrState

Virginia / Pennsylvania / /

PublishedMedium

Mathematics of Computation / /

Technology

important algorithm / VLSI chip / one-dimensional algorithm / J. An algorithm / conventional FFT algorithms / parallel processing / /

SocialTag