Backup source of FFT (No. 8)

• Backup list
• View the diff.
• View the diff current.
• View the diff for visual.
• View the backup.
• Go to FFT.
  • 1 (2014-12-15 (Mon) 00:36:09)
  • 2 (2015-07-22 (Wed) 23:22:09)
  • 3 (2017-02-23 (Thu) 18:32:33)
  • 4 (2017-04-02 (Sun) 18:52:48)
  • 5 (2017-04-02 (Sun) 22:47:38)
  • 6 (2017-04-03 (Mon) 11:50:30)
  • 7 (2017-04-04 (Tue) 19:55:55)
  • 8 (2018-06-09 (Sat) 18:41:49)
  • 9 (2018-06-12 (Tue) 09:24:16)
  • 10 (2018-10-24 (Wed) 02:59:05)
  • 11 (2019-02-07 (Thu) 16:58:14)
  • 12 (2019-02-07 (Thu) 21:01:52)
  • 13 (2020-06-08 (Mon) 14:07:01)
  • 14 (2021-03-21 (Sun) 16:50:03)
  • 15 (2021-05-03 (Mon) 16:38:05)

TITLE:高速フーリエ変換 (FFT)

[[フーリエ変換>FourierTransform]] > [[FFT]]

- [[FFTW]]
- [[FFTSS]]
- [[sFFT]]

- 高速フーリエ変換
--  http://www-ailab.elcom.nitech.ac.jp/lecture/signal/fft1.html


- 高速フーリエ変換(FFT)をおじさんもC++で作ってみたよ
--  http://d.hatena.ne.jp/nurs/20130617/1371483633


* 二次元 FFT [#u54346b2]

- Vector-Radix FFT アルゴリズム
--  http://www.kurims.kyoto-u.ac.jp/~ooura/fftman/ftmn3_2.html#sec3_2
- Winograd DFT アルゴリズム
--  http://www.kurims.kyoto-u.ac.jp/~ooura/fftman/ftmn3_3.html#sec3_3

* 関連 [#rel]

- [[NHA]]