CTFS (GPT)
CTFS (GPT)
Hell yeah, Taha. Buckle up — I'm about to teach you Continuous-Time Fourier Series (CTFS)
like a damn master, so you can strut into your exam and destroy it with A++++ confidence.
We’re diving deep from core concepts to practical tricks. Ready? Let’s roll. 🔥
In nerd-speak:
We express x(t) as a linear combination of harmonically-related complex sinusoids.
💡 Core Concept
The CTFS formula (called the synthesis equation) is:
∞
x(t) = ∑ ck ejkω0 t
k=−∞
Where:
2π
ω0 =
T
is the fundamental frequency
1/8
Use the analysis equation:
1
ck =
∫ x(t)e−jkω0 t dt
T T
This is just a projection of x(t) onto the complex exponential ejkω0 t . Think of it like finding
k=−∞
k=1
Where:
ak = 2 ⋅ Re{ck }
bk = −2 ⋅ Im{ck }
k=1
Where:
c−k = c∗k
1
ck =
∫ x(t)e−jkω0 t dt
T T
4. Simplify ck
x(t) = {
A, 0 ≤ t < T /2
−A, T /2 ≤ t < T
3/8
The result of computing CTFS gives:
−j2A
ck = { πk , k odd
0, k even
∞
−j2A jkω0 t
x(t) = ∑ e
πk
k=−∞
k odd
Gibbs Phenomenon: Ripples near jumps in the signal that don’t go away
FS
x(t) ↔ ck and y(t) = H{x(t)}
Then:
FS
y(t) ↔ H(jkω0 ) ⋅ ck
It means an LTI system scales each frequency component by the system's frequency
response at that harmonic.
4/8
Example:
H(jω) = {
1, ∣ω∣ ≤ ωc
0, otherwise
🧪 Practice Strategy
1. Master at least 3 examples: square wave, impulse train, triangle wave.
Fourier Series problem together — step by freakin’ step — so you OWN this thing. 💪
💥 Problem Setup
Let’s start with a classic:
⚙️ Given:
5/8
x(t) = {
1, 0≤t<1
0, 1≤t<2
form:
1
ck =
∫ x(t) ⋅ e−jkω0 t dt
T T
🚦 Step 1: Find ω 0
2π 2π
ω0 = = =π
2
1 1
ck = ∫ 1 ⋅ e−jkπt dt
2 0
6/8
Now remember:
So:
1 1
ck = ⋅ ((−1)k − 1)
2 −jkπ
1
ck = ((−1)k − 1)
−2jkπ
1 1 1
c0 = ∫ 1 dt =
2 0 2
✅ Final Answer
ck = {
1
2,
k=0
1
((−1)k − 1) , k
=0
−2jkπ
🔎 What It Means
For even k : (−1)k = 1 ⇒ ck = 0
1 1
For odd k : (−1)k = −1 ⇒ ck =
−2jkπ
(−2) = jkπ
7/8
So:
⎧ 12 , k=0
ck = ⎨ jkπ
1
, k odd
⎩
0, k even and
=0
🎯 Your Turn?
Wanna do one together where you try each step and I correct you?
Or want me to give you a trickier one next?
8/8