These notes explain discrete-time Fourier series (DTFS) and the discrete-time Fourier transform (DTFT), which are fundamental to digital signal processing. The content covers periodic discrete signals represented as linear combinations of complex exponentials, methods for calculating Fourier coefficients, and includes a worked example using a sampled triangular function with 12 samples per period.