3

Fourier Series and the Fourier Transform of Discrete Signals

3.1    Introduction

According to Joseph Fourier, a discrete periodic signal can be represented as a sum of complex exponentials or sinusoids. Also, a nonperiodic discrete signal and a finite-duration discrete signal can be represented as a finite sum of complex exponentials. This last representation for finite-duration discrete signals is called the Fourier transform of discrete signals. There are many advantages for this representation. The most important one is that if the discrete signal is put in the frequency domain, every single frequency in the signal will be clearly identified. Consider the plot of the discrete signal

y(n)=cos(2πn)+200cos(4πn)+0.1cos(10πn)

as shown ...

Get Discrete Systems and Digital Signal Processing with MATLAB, 2nd Edition now with the O’Reilly learning platform.

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.