6.3 Properties of the ctfs

Signals and systems Page 1 / 1

An introduction to the general properties of the Fourier series

Introduction

In this module we will discuss the basic properties of the Continuous-Time Fourier Series. We will begin by refreshing your memory of our basic Fourier series equations:

f t n

∞ ∞ c n ω 0 n t

c_{n} 1 T t 0 T f t ω_{0} n t

Let

ℱ \cdot

denote the transformation from

f t

to the Fourier coefficients

ℱ f t n n c_{n}

ℱ \cdot

maps complex valued functions to sequences of complex numbers .

Linearity

$ℱ \cdot$ is a linear transformation .

If $ℱ f t c_{n}$ and $ℱ g t d_{n}$ . Then $α α ℱ α f t α c_{n}$ and $ℱ f t g t c_{n} d_{n}$

Easy. Just linearity of integral.

ℱ f t g t n n t 0 T f t g t ω_{0} n t n n 1 T t 0 T f t ω_{0} n t 1 T t 0 T g t ω_{0} n t n n c_{n} d_{n} c_{n} d_{n}

Shifting

Shifting in time equals a phase shift of Fourier coefficients

$ℱ f t t_{0} ω_{0} n t_{0} c_{n}$ if $c_{n} c_{n} ∠ c_{n}$ , then $ω_{0} n t_{0} c_{n} ω_{0} n t_{0} c_{n} c_{n}$ $∠ ω_{0} t_{0} n ∠ c_{n} ω_{0} t_{0} n$

ℱ f t t_{0} n n 1 T t 0 T f t t_{0} ω_{0} n t n n 1 T t t_{0} T t_{0} f t t_{0} ω_{0} n t t_{0} ω_{0} n t_{0} n n 1 T t t_{0} T t_{0} f \tilde{t} ω_{0} n \tilde{t} ω_{0} n t_{0} n n ω_{0} n \tilde{t} c_{n}

Parseval's relation

t 0 T f t 2 T n

∞ ∞ c n 2

Parseval's relation tells us that the energy of a signal is equal to the energy of its Fourier transform.

Parseval tells us that the Fourier series maps

L 0 T 2

l 2

For $f t$ to have "finite energy," what do the $c_{n}$ do as $n$ ∞ ?

$c_{n} 2$ ∞ for $f t$ to have finite energy.

Got questions? Get instant answers now!

If $n n 0 c_{n} 1 n$ , is $f L 0 T 2$ ?

Yes, because $c_{n} 2 1 n 2$ , which is summable.

Got questions? Get instant answers now!

Now, if $n n 0 c_{n} 1 n$ , is $f L 0 T 2$ ?

No, because $c_{n} 2 1 n$ , which is not summable.

Got questions? Get instant answers now!

The rate of decay of the Fourier series determines if $f t$ has finite energy .

Parsevals theorem demonstration

ParsevalsDemo — Interact (when online) with a Mathematica CDF demonstrating Parsevals Theorem. To download, right click and save file as .cdf.

Symmetry properties

Even signals

$f (t) = f (- t)$
$∥ c_{n} ∥ = ∥ c_{- n} ∥$

$c_{n} = \frac{1}{T} \int_{0}^{T} f (t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{\frac{T}{2}} f (t) exp (- ı ω_{0} n t) d t + \frac{1}{T} \int_{\frac{T}{2}}^{T} f (t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{\frac{T}{2}} f (- t) exp (- ı ω_{0} n t) d t + \frac{1}{T} \int_{\frac{T}{2}}^{T} f (- t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{T} f (t) [exp (ı ω_{0} n t) d t + exp (- ı ω_{0} n t)] d t$
$= \frac{1}{T} \int_{0}^{T} f (t) 2 cos (ω_{0} n t) d t$

Odd signals

$f (t) = -f (-t)$
$c_{n} = c_{- n}$ *

$c_{n} = \frac{1}{T} \int_{0}^{T} f (t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{\frac{T}{2}} f (t) exp (- ı ω_{0} n t) d t + \frac{1}{T} \int_{\frac{T}{2}}^{T} f (t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{\frac{T}{2}} f (t) exp (- ı ω_{0} n t) d t - \frac{1}{T} \int_{\frac{T}{2}}^{T} f (- t) exp (ı ω_{0} n t) d t$
$= - \frac{1}{T} \int_{0}^{T} f (t) [exp (ı ω_{0} n t) d t - exp (- ı ω_{0} n t)] d t$
$= - \frac{1}{T} \int_{0}^{T} f (t) 2 ı sin (ω_{0} n t) d t$

Real signals

$f (t) = f$ * $(t)$
$c_{n} = c_{- n}$ *

$c_{n} = \frac{1}{T} \int_{0}^{T} f (t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{\frac{T}{2}} f (t) exp (- ı ω_{0} n t) d t + \frac{1}{T} \int_{\frac{T}{2}}^{T} f (t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{\frac{T}{2}} f (- t) exp (- ı ω_{0} n t) d t + \frac{1}{T} \int_{\frac{T}{2}}^{T} f (- t) exp (- ı ω_{0} n t) d t$
$= \frac{1}{T} \int_{0}^{T} f (t) [exp (ı ω_{0} n t) d t + exp (- ı ω_{0} n t)] d t$
$= \frac{1}{T} \int_{0}^{T} f (t) 2 cos (ω_{0} n t) d t$

Differentiation in fourier domain

ℱ f t c_{n} ℱ t f t n ω_{0} c_{n}

Since

f t n

∞ ∞ c n ω 0 n t

then

t f t n

∞ ∞ c n t ω 0 n t n ∞ ∞ c n ω 0 n ω 0 n t

A differentiator attenuates the low frequencies in

f t

and accentuates the high frequencies. It removes general trends and accentuates areas of sharpvariation.

A common way to mathematically measure the smoothness of a function

f t

is to see how many derivatives are finite energy.

This is done by looking at the Fourier coefficients of thesignal, specifically how fast they decay as

n

∞ .If

ℱ f t c_{n}

and

c_{n}

has the form

1 n k

, then

ℱ t m f t n ω_{0} m c_{n}

and has the form

n m n k

.So for the

m^{th}

derivative to have finite energy, we need

n n m n k 2

∞ thus

n m n k

decays faster than

1 n

which implies that

2 k 2 m 1

k 2 m 1 2

Thus the decay rate of the Fourier series dictates smoothness.

Fourier differentiation demonstration

FourierDiffDemo — Interact (when online) with a Mathematica CDF demonstrating Differentiation in the Fourier Domain. To download, right click and save file as .cdf.

Integration in the fourier domain

ℱ f t c_{n}

then

ℱ τ

∞ t f τ 1 ω 0 n c n

c_{0} 0

, this expression doesn't make sense.

Integration accentuates low frequencies and attenuates high frequencies. Integrators bring out the general trends in signals and suppress short term variation (which is noise in many cases). Integrators are much nicer than differentiators.

Fourier integration demonstration

fourierIntDemo — Interact (when online) with a Mathematica CDF demonstrating Integration in the Fourier Domain. To download, right click and save file as .cdf.

Signal multiplication and convolution

Given a signal $f t$ with Fourier coefficients $c_{n}$ and a signal $g t$ with Fourier coefficients $d_{n}$ , we can define a new signal, $y t$ , where $y t f t g t$ . We find that the Fourier Series representation of $y t$ , $e_{n}$ , is such that $e_{n} k$ ∞ ∞ c k d n - k . This is to say that signal multiplication in the time domainis equivalent to signal convolution in the frequency domain, and vice-versa: signal multiplication in the frequency domain is equivalent to signal convolution in the time domain.The proof of this is as follows

e_{n} 1 T t 0 T f t g t ω_{0} n t 1 T t 0 T k

∞ ∞ c k ω 0 k t g t ω 0 n t k ∞ ∞ c k 1 T t 0 T g t ω 0 n k t k ∞ ∞ c k d n - k

for more details, see the section on Signal convolution and the CTFS

Conclusion

Like other Fourier transforms, the CTFS has many useful properties, including linearity, equal energy in the time and frequency domains, and analogs for shifting, differentation, and integration.

Properties of the ctfs
Property	Signal	CTFS
Linearity	$a x (t) + b y (t)$	$a X (f) + b Y (f)$
Time Shifting	$x (t - τ)$	$X (f) e^{- j 2 π f τ / T}$
Time Modulation	$x (t) e^{j 2 π f τ / T}$	$X (f - k)$
Multiplication	$x (t) y (t)$	$X (f) * Y (f)$
Continuous Convolution	$x (t) * y (t)$	$X (f) Y (f)$

<< Chapter < Page Page > Chapter >>

Read also:

Get Jobilize Job Search Mobile App in your pocket Now!

100% Free Mobile Applications
Receive real-time job alerts and never miss the right job again

Source: OpenStax, Signals and systems. OpenStax CNX. Aug 14, 2014 Download for free at http://legacy.cnx.org/content/col10064/1.15

Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Signals and systems' conversation and receive update notifications?

Ask

	Engineering Communication MCQ By Steve Gibbs Start Quiz
©flickr: Miguel	Gram Positive Infections and Clostridium By Cath Yu Start Quiz
©flickr: anjelkam	Art By Caitlyn Gobble Start Exam
	23 Biology 23 Protists MCQ By OpenStax Start Quiz
	Biology By OpenStax Read Online Course
	14 Dr Landholt Large Animal Medicine-GI quiz By Brooke Delaney Start Exam
	Anthropology Biology Culture By Richley Crapo Start Assignment
	3 AP Key Terms 03 Cellular Level of Organization By OpenStax Start Key Terms
	15 AP Key Terms 15 Autonomic Nervous System By OpenStax Start Key Terms
	15 Dr. Amberg Pharm quiz By Brooke Delaney Start Exam