Top Qs
Timeline
Chat
Perspective

Discrete Fourier series

From Wikipedia, the free encyclopedia

Remove ads

In digital signal processing, a discrete Fourier series (DFS) is a Fourier series whose sinusoidal components are functions of a discrete variable instead of a continuous variable. The result of the series is also a function of the discrete variable, i.e. a discrete sequence. A Fourier series, by nature, has a discrete set of components with a discrete set of coefficients, also a discrete sequence. So a DFS is a representation of one sequence in terms of another sequence. Well known examples are the Discrete Fourier transform and its inverse transform.[1]:ch 8.1

Remove ads

Introduction

Summarize
Perspective

Relation to Fourier series

The exponential form of Fourier series is given by:

which is periodic with an arbitrary period denoted by When continuous time is replaced by discrete time for integer values of and time interval the series becomes:

With constrained to integer values, we normally constrain the ratio to an integer value, resulting in an -periodic function:

Discrete Fourier series

which are harmonics of a fundamental digital frequency The subscript reminds us of its periodicity. And we note that some authors will refer to just the coefficients themselves as a discrete Fourier series.[2]:p.85 (eq 15a)

Due to the -periodicity of the kernel, the infinite summation can be "folded" as follows:

which is the inverse DFT of one cycle of the periodic summation, [1]:p.542 (eq 8.4) [3]:p.77 (eq 4.24)

Remove ads

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.

Remove ads