# Notes on discrete-time Fourier series and transform

DevFeed: [Notes on discrete-time Fourier series and transform](<https://devfeed.tech/articles/notes-on-discrete-time-fourier-series-and-transform-55390.md>)

Original publisher: [Read original article](<https://eli.thegreenplace.net/2026/notes-on-discrete-time-fourier-series-and-transform/>)

Author: Eli Bendersky

Published: 2026-09-19T16:39:00Z

Content type: tutorial

Language: en

Sources: [Eli Bendersky](<https://devfeed.tech/sources/eli-bendersky.md>)

Topics: [fourier transform](<https://devfeed.tech/topics/fourier-transform.md>), [processing](<https://devfeed.tech/topics/processing.md>), [digital](<https://devfeed.tech/topics/digital.md>)

Tags: [digital](<https://devfeed.tech/tags/digital.md>), [fourier-transform](<https://devfeed.tech/tags/fourier-transform.md>), [math](<https://devfeed.tech/tags/math.md>), [misc](<https://devfeed.tech/tags/misc.md>), [processing](<https://devfeed.tech/tags/processing.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>)

## AI overview

These notes explain discrete-time Fourier series and the discrete-time Fourier transform, including periodic discrete signals, complex exponentials, Fourier coefficients, and signal decomposition. They frame these concepts as theoretical foundations for digital signal processing using the discrete Fourier transform.

## Source excerpt

The following are my notes on discrete-time Fourier series (DTFS), as well as the discrete-time Fourier transform (DTFT). These topics serve as an important theoretical underpinning to the digital processing of signals by computers using the DFT (which will be covered in a future post). For discrete-time signals, we use ...