digital-signal-processing
Why the DFT is the only exactly-computable Fourier representation
taught
The CTFS/CTFT/DTFS/DTFT each need an infinite sum or integral -- the DFT alone is a finite sum a computer can actually carry out completely.
Taught in
-
Why only the DFT is exactly computable
Digital Signal Processing
Requires
- two-dimensional-sampling required
Required by
- The DFT as a sampled DTFT required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.