Fast Fourier Transform

Fast Fourier Transform is a divide-and-conquer algorithm that efficiently computes the discrete Fourier transform of a sequence by recursively decomposing the problem into smaller subproblems, thereby reducing the computational complexity from quadratic to linearithmic order.

7.6K

Publications

472.7K

Citations

19K

Authors

3.8K

Institutions

Publications per year

2017–2026

1.5K

Authors

19K

  1. QL
    Qing Liu

    Duke University, United States

    70 publications · 3.8K citations

    33

    h-index

  2. CB
    C.S. Burrus

    Rice University, United States

    20 publications · 3.1K citations

    18

    h-index

  3. MG
    Mario Garrido

    Linköping University, Sweden

    19 publications · 802 citations

    17

    h-index

  4. DP
    Daniel Potts

    Chemnitz University of Technology, Germany

    19 publications · 1.3K citations

    17

    h-index

  5. JC
    J.W. Cooley

    IBM Research - Thomas J. Watson Research Center, United States

    18 publications · 3.1K citations

    16

    h-index

1–5 of 19K

Venues

  1. IEEE Transactions on Signal Processing

    175 publications · 13.3K citations

    53

    h-index

  2. 47

    h-index

  3. IEEE Transactions on Antennas and Propagation

    118 publications · 6K citations

    43

    h-index

  4. 40

    h-index

  5. Optics Express

    90 publications · 5.3K citations

    37

    h-index

1–5