1 of 52

HKN ECE 210 Exam 3 Review Session

Alex Zhang

Sara Spahi

Karthik Prasad

Jason Flanagan

2 of 52

Topics

  • Fourier Transform
  • Signal Energy and Bandwidth
  • LTI System Response with Fourier Transform
  • Modulation, AM, Coherent Demodulation
  • Impulse Response and Convolution
  • Sampling and Analog Reconstruction
  • LTIC and BIBO Stability

3 of 52

The Big Picture

  • On Exam 2, the only tools we had were LTI systems and Fourier Series.

  • What did that let us do?
    • Deal with any periodic signal as an input to our system and find the corresponding output.

  • But not all signals are periodic ☹

  • Introducing… the Fourier Transform!

4 of 52

Fourier Transform

Note: We are engineers, so we are lazy.

Integrals are hard.

Therefore, we don’t do these integrals often, if at all.

5 of 52

Important Signals for Fourier Transform

Derivative of u(t) is delta(t)

6 of 52

Conceptual Question (NO TABLES ALLOWED)

7 of 52

Fourier Transform Tips & Properties

  • Scaling your signal can force properties to appear; typically time delay
    • Ex:

  • The properties really do matter! Take the time to acquaint yourself with them and PRACTICE. This is how you can be lazy and not do nasty integrals.

  • Remember that the Fourier Transform is linear, so you can express a spectrum as the sum of easier spectra.
    • Ex: Staircase function

  • Magnitude Spectrum is even symmetric, Phase Spectrum is odd symmetric for real valued signals.

8 of 52

Time Travelling Tables

Find the Fourier Transform of .

9 of 52

Shocking Symmetries

10 of 52

Signal Energy and Bandwidth

 

11 of 52

LTI System Response using Fourier Transform

 

 

(Fast Fourier Transform is amazing, take ECE310 to learn more)

12 of 52

Modulation, AM Radio, Coherent Demodulation

13 of 52

Superheterodyning and Radio Basics (ECE 453/459 plug)

  • For envelope detection to work, we need to isolate the signal we want to receive
  • Use preselector filter (before mixing) to prevent the image station problem
  • Image station problem occurs when two different “station” frequencies are shifted to the same IF - is a result of mixing
  • Once the station frequency has been shifted to the IF, use a sharp IF filter to receive just the station you want

14 of 52

Robust Radio Design

Let’s say you’re designing a radio. If you want to listen to an AM station at 1255 KHz with an IF at 455 KHz, what LO frequencies can you choose?

Without a preselector, what would be the image station if you chose the lower LO frequency.

15 of 52

The Big Picture

  • But sometimes frequency domain is hard.
    • A triangle function is passed into a system who’s impulse response is a shifted delta. Let’s go to the frequency domain to find the output!
    • The triangle becomes a sinc^2. The shifted delta becomes an exponential.
    • Now we get sinc^2 * shifted delta and we want to shift back to the time domain.
    • Disgusting.

  • If only there was another way…

  • Introducing… Convolution!

16 of 52

Impulse Response and Convolution

 

17 of 52

Helpful Properties for Convolution

 

18 of 52

More Helpful Properties for Convolution

19 of 52

 

 

(Don’t tell the math majors)

20 of 52

Impulse Intuition

Given what we know about convolution, the frequency domain, and impulse properties, what must the Fourier Transform of be, and more importantly, why?

21 of 52

Silly Simplifications

Simplify the following expression:

22 of 52

Sneaky Simplifications

Simplify the following expression:

23 of 52

Scintillating Simplifications

Simplify the following expression:

24 of 52

Convoluted Convolution

25 of 52

Devious Derivatives

26 of 52

Sampling and Impulse Train (ECE310 plug)

  • Let’s say we have some signal f(t), and we want to sample it, perhaps so we can store it digitally.
  • The resulting sequence f[n] = f(nT), where n is an integer.
  • Intuitively, sampling is simply multiplying the signal by an infinite train of impulses, spaced by T seconds apart (known as the sampling rate).

  • This is known as the A/D, or Analog to Digital conversion.
  • Once we have f[n], we can use Discrete Fourier Transforms or Fast Fourier Transforms, apply digital filters, etc. etc. The possibilities are endless! Take ECE310 if you want to find out more!

27 of 52

Analog Reconstruction

  • How do we convert from a digital sequence back to an analog sequence (D/A)?
  • We want to go from here back to F(w), and then f(t).

  • How? Assuming the shifted F(w)s don’t overlap, we can multiply this sum by a rect centered at the origin, with width pi/T, and then multiply by T. Once we have F(w), we can then transform back to f(t).
  • Multiplication in the frequency domain by rect is convolution in the time domain by sinc. That’s where the following seemingly magical formula comes from:

28 of 52

Nyquist Criterion and Why It Matters

  • We made a big assumption in the previous slide! “Assuming the F(w)s don’t overlap…”
  • Nyquist criterion: the condition that makes this true.
    • Assuming F(w) has some bandwidth B, defined in rad/sec, then overlap won’t occur when:

    • If B is given in Hz, simply divide both sides of the previous equation by :

  • If this isn’t true, our F(w)s overlap, and we get aliasing!
    • It is IMPOSSIBLE to recover the original signal when this occurs, unless you happen to know the original signal in the first place - when we apply our lowpass filter, the F(w) that comes out has been altered.
    • A demonstration of this will be shown in the conceptual questions.

29 of 52

Nefarious Nyquist

30 of 52

Appalling Aliasing

31 of 52

The Big Picture

  • When dealing with real-world systems, their properties are extremely important.
    • Linearity and Time-Invariance (also known as Shift-Invariance) allow you to use the tools you’ve been learning this entire semester.
    • BIBO-Stability says whether or not your system might explode if you accidentally put in the wrong input.
    • Because we live in a world where time is linear, Causality indicates whether or not the system is even realizable (how can you use future inputs to calculate present inputs???)
      • However if your system works off of a full set of data then you can use “future” inputs.

32 of 52

BIBO Stability

Note: Systems can be BIBO stable or not. Signals are bounded or not. Signals have no notion of BIBO stability, and systems have no notion of boundedness.

Bounded signal test: If |f(t)| ≤ α < ∞, then f(t) is bounded.

33 of 52

LTIC

 

34 of 52

Pictographic Representation of Linearity

35 of 52

Pictographic Representation of Time-Invariance

36 of 52

Unpopular Unit-step

Let a system be defined by its impulse response h(t) = u(t).

Is the system Linear? Time-Invariant? Causal? BIBO-Stable?

If it is BIBO-Unstable, name a bounded input that will cause an unbounded output.

37 of 52

Ridiculous Inputs

Let a system be defined by its input-output relation y(t) = x(102841) + x(t).

Is the system Linear? Time-Invariant? BIBO-Stable? Causal?

If it is BIBO-Unstable, name a bounded input that will cause an unbounded output.

38 of 52

Ridiculous Outputs

Let a system be defined by the following input-output relation:

Is the system Linear? Time-Invariant? BIBO-Stable? Causal?

If it is BIBO-Unstable, name a bounded input that will cause an unbounded output.

39 of 52

Feedback Form

Let us know how we did and what we can do to improve!

Completely anonymous!

Please please please fill this out :)

40 of 52

Past Exam Problems

41 of 52

Problem 1 FA19

42 of 52

Problem 1 FA19

43 of 52

Problem 2 FA20

44 of 52

Problem 2 FA20

45 of 52

Problem 2 SP20

46 of 52

47 of 52

Problem 1 FA20

48 of 52

49 of 52

Problem 3 FA20

50 of 52

Problem 4 FA17

51 of 52

Problem 4 SP14

iii) Determine y(t)

52 of 52

Problem 4 SP 20

Note: alpha is a positive integer