Advertisement

Problems of Information Transmission

, Volume 53, Issue 3, pp 284–293 | Cite as

On the real complexity of a complex DFT

  • I. S. Sergeev
Large Systems

Abstract

We present a method to construct a theoretically fast algorithm for computing the discrete Fourier transform (DFT) of order N = 2 n . We show that the DFT of a complex vector of length N is performed with complexity of 3.76875N log2 N real operations of addition, subtraction, and scalar multiplication.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blahut, R.E., Fast Algorithms for Digital Signal Processing, Reading: Addison-Wesley, 1985. Translated under the title Bystrye algoritmy tsifrovoi obrabotki signalov, Moscow: Mir, 1989.Google Scholar
  2. 2.
    Vlasenko, V.A., Lappa, Yu.M., and Yaroslavskii, L.P., Metody sinteza bystrykh algoritmov svertki i spektral’nogo analiza signalov (Methods for Fast Convolution Algorithms Synthesis and Signal Spectral Analysis), Moscow: Nauka, 1990.MATHGoogle Scholar
  3. 3.
    Gashkov, S.B. and Sergeev, I.S., Fast Fourier Transform Algorithms, in Diskrentaya matematika i ee prilozheniya (Discrete Mathematics and Its Applications), vol. V, Moscow: Keldysh Inst. Appl. Math., 2009, pp. 3–23.Google Scholar
  4. 4.
    Winograd, S., On the Multiplicative Complexity of the Discrete Fourier Transform, Adv. in Math., 1979, vol. 32, no. 2, pp. 83–117.CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Heideman, M.T., Applications of Multiplicative Complexity Theory to Convolution and the Discrete Fourier Transform, PhD Thesis, Rice Univ., Houston, Texas, 1986.Google Scholar
  6. 6.
    Johnson, S.F. and Frigo, M., A Modified Split-Radix FFT with Fewer Arithmetic Operations, IEEE Trans. Signal Process., 2007, vol. 55, no. 1, pp. 111–119.CrossRefMathSciNetGoogle Scholar
  7. 7.
    Lundy, T.J. and van Buskirk, J., A New Matrix Approach to Real FFTs and Convolutions of Length 2k, Computing, 2007, vol. 80, no. 1, pp. 23–45.CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Haynal, S. and Haynal, H., Generating and Searching Families of FFT Algorithms, J. Satisf. Boolean Model. Comput., 2011, vol. 7, no. 4, pp. 145–187.MATHMathSciNetGoogle Scholar
  9. 9.
    Zheng, W., Li, K., and Li, K., Scaled Radix-2/8 Algorithm for Efficient Computation of Length-N = 2. DFTs, IEEE Trans. Signal Process., 2014, vol. 62, no. 10, pp. 2492–2503.CrossRefMathSciNetGoogle Scholar
  10. 10.
    Cooley, J.W. and Tukey, J.W., An Algorithm for the Machine Calculation of Complex Fourier Series, Math. Comp., 1965, vol. 19, no. 90, pp. 297–301.CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2017

Authors and Affiliations

  1. 1.Federal State Unitary Enterprise “Kvant Scientific Research Institute,”MoscowRussia

Personalised recommendations