Help | Contact Us
Home » Supplemental Resources » Digital Signal Processing » Video Lectures » Lecture 20: Computation of the Discrete Fourier Transform, Part 3
Flash and JavaScript are required for this feature.
Download the video from iTunes U or the Internet Archive.
Topics covered: Rearrangements of the basic decimation-in-frequency algorithm, relation between decimation-in-time and decimation-in-frequency through the transposition theorem, arbitrary radix FFT algorithms.
Instructor: Prof. Alan V. Oppenheim
Demonstration 1: Sampling, ...
Demonstration 2: Sampling, ...
Lecture 1: Introduction
Lecture 2: Discrete-Time Si...
Lecture 3: Discrete-Time Si...
Lecture 4: The Discrete-Tim...
Lecture 5: The z-Transform
Lecture 6: The Inverse z-Tr...
Lecture 7: z-Transform Prop...
Lecture 8: The Discrete Fou...
Lecture 9: The Discrete Fou...
Lecture 10: Circular Convol...
Lecture 11: Representation ...
Lecture 12: Network Structu...
Lecture 13: Network Structu...
Lecture 14: Design of IIR D...
Lecture 15: Design of IIR D...
Lecture 16: Digital Butterw...
Lecture 17: Design of FIR D...
Lecture 18: Computation of ...
Lecture 19: Computation of ...
Lecture 20: Computation of ...
Computation of the Discrete Fourier Transform, Part 3 (PDF)