Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures

@article{Linzer1993ImplementationOE,
  title={Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures},
  author={Elliot N. Linzer and Ephraim Feig},
  journal={IEEE Trans. Signal Processing},
  year={1993},
  volume={41},
  pages={93-107}
}
The decimation-in-time radix-2, radix-4, split-radix, and radix-8 algorithms, presented in a paper by Linzer and Feig [5 ] , are described in detail. These algorithms compute discrete Fourier transforms (DFT’s) on input sequences with lengths that are powers of 2 with fewer multiply-adds than traditional Cooley-Tukey algorithms. The descriptions given provide the needed details to implement these algorithms efficiently in a computer program that could compute DFT’s on a length 2” sequence for… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

FFT and convolution algorithms on DSP microprocessors

  • C. S. Burua
  • 1991

Variants of the Winograd multiplicative FFT algorithms and their implementation on IBM RSI 6000 , ”

  • J. W. Cooley, R. Tolimieri
  • 1986

He received the B.S. degree in electrical engineering and in mathematics from the University of Maryland

  • Thomas J . Watson
  • Geisco scholarship. He received the M.S. and the…
  • 1966

Design of the IBM RlSC Systemi 6000 floating point execution unit

  • E. Hokenek R. K. Montoye, S. L. Runyon

Similar Papers

Loading similar papers…