Learn Before
Formula

1-D Discrete Fourier Transforms

DFT Analysis equation: X[k]=∑n=0N−1x[n]e−2πjknN,0≤k≤N−1X[k] = \sum_{n=0}^{N-1}x[n] e^{-2\pi j \frac{kn}{N}} , 0\leq k\leq N-1

DFT Synthesis equation: x[n]=1N∑k=0N−1X[k]e2πjknN,0≤n≤N−1x[n] =\frac{1}{N} \sum_{k=0}^{N-1}X[k] e^{2\pi j \frac{kn}{N}} , 0\leq n\leq N-1

0

1

Updated 2026-05-17

Tags

Python Programming Language

Data Science