Overview of Sampling Topics

Size: px
Start display at page:

Download "Overview of Sampling Topics"

Transcription

1 Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT sampling Decimation & interpolation J. McNames Portland State University ECE 223 Sampling Ver

2 Amplitude versus Time In this class we are working only with continuous-valued signals Signals with discrete values that have been quantized are called digital signals Analog-to-Digital converters (ADC) convert continuous-valued signals to discrete-valued signals. These often also convert from CT to DT. Digital-to-analog converters (DAC) convert discrete-valued signals to continuous-valued signals. These often also convert from DT to CT. Signals that are both continuous-valued and continuous-time are usually called analog signals Signals that are both discrete-valued and discrete-time are usually called digital J. McNames Portland State University ECE 223 Sampling Ver

3 Overview of DT Processing of CT Signals x(t) CT DT x[n] H(z) y[n] DT CT y(t) T s T s Many systems (1) sample a signal, (2) process it in discrete-time, and (3) convert it back to a continuous-time signal Called discrete-time processing of continuous-time signals Most modern digital signal processing (DSP) uses this architecture The first step is called sampling The last step is called interpolation J. McNames Portland State University ECE 223 Sampling Ver

4 Signals x(t) x[n] x i (t) X(jω) X(e jω ) X i (jω) For now, just consider the two conversions Sampling (CT DT) Interpolation (DT CT) Suppose we want x i (t) to be as close to x(t) as possible Need to consider relationships in both time- and frequency-domains Three signals, three transforms J. McNames Portland State University ECE 223 Sampling Ver

5 Guiding Questions and Objectives x[n] =x(t) t=nts The operation of sampling (CT DT conversion) is trivial The challenge is to understand the limits and tradeoffs The remainder of these slides is dedicated to answering the following three questions 1. How is the CTFT of x(t), X(jω) related to the DTFT of x[n] =x(nt s ), X(e jω )? 2. Under what conditions can we synthesize x(t) from x[n]: x[n] x(t)? 3. How do we perform this DT CT conversion? J. McNames Portland State University ECE 223 Sampling Ver

6 Consider three signals Need for a Bridge Signal Type Time Domain Frequency Domain Original Signal CT x(t) X(jω) Sampled Signal DT x[n] X(e jω ) Bridge Signal CT x δ (t) X δ (jω) Goals: to determine the relationship of x(t) to x[n] =x(nt s ) in the time and frequency domains In the time domain, the relationship x[n] =x(nt s ) is clear But what is the relationship of X(jω) to X(e jω )? The transforms differ in character X(e jω ) is periodic X(e jω ) has units of radians per sample A bridge signal x δ (t) is the only way (that I know of) to determine how X(jω) is related to X(e jω ) J. McNames Portland State University ECE 223 Sampling Ver

7 Use of the Bridge Signal Define the bridge signal by relating X δ (jω) to X(e jω ) Determine how x(t) is related to x δ (t) in the time domain Determine how X(jω) is related to X δ (jω) Use the relationships of X(e jω ) and X(jω) to X δ (jω) to determine their relationship to one another J. McNames Portland State University ECE 223 Sampling Ver

8 Defining the Bridge Signal The bridge signal x δ (t) is a CT representation of a DT signal x[n] It is defined as having the same transform, within a scale factor, as the DT signal Suppose x[n] =Ae j(ωn+φ) What is the CT equivalent? Let us pick x(t) =Ae j(ωt+φ) How do we relate the DT frequency Ω to the CT frequency ω? ω has units of radians/second Ω has units of radians/sample Let us use the conversion factor of T s = f 1 s seconds/sample Ω (radians/sample) = ω (radians/second) T s (seconds/sample) ω (radians/second) =Ω(radians/sample) f s (samples/second) J. McNames Portland State University ECE 223 Sampling Ver

9 Defining the Bridge Signal X δ (jω)=x(e jω ) Ω=ωTs = X(e jωt s ) The bridge signal is a CT representation of a DT signal We define it by equating the CTFT and DTFT with an appropriate scaling factor for frequency Note that this is a highly unusual CT signal The CTFT is periodic What does this tell us about x δ (t)? J. McNames Portland State University ECE 223 Sampling Ver

10 Solving for the Bridge Signal X(e jω )= X δ (jω)=x(e jω ) Ω=ωTs = n= n= n= x δ (t) FT X δ (jω) δ(t t o ) FT e jωt o δ(t T s n) FT e jωt sn x[n] δ(t T s n) FT x δ (t) = n= n= x[n]e jωn x[n]e jωt sn x[n]e jωt sn x[n] δ(t T s n) J. McNames Portland State University ECE 223 Sampling Ver

11 Why Isn t the Inverse Transform Similar to x(t)? DTFT x[n] = 1 X(e jω )e jωn dω 2π 2π CTFT x(t) = 1 + X(jω)e jωt dω 2π We generated x δ (t) from x[n] by equating a CTFT to the DTFT of x[n] This seems reasonable at first But consider the range of the CTFT and DTFT synthesis equations The DTFT synthesizes x[n] out of a finite range of frequencies The CTFT synthesizes x(t) out of all frequencies This is why, if x[n] =x(nt s ), that x δ (t) =F 1 {X δ (jω)} = F 1 { X(e jωt s ) } x(t) J. McNames Portland State University ECE 223 Sampling Ver

12 Impulse Sampling 1 p(t) -4Ts -3Ts -2Ts -Ts 0 Ts 2Ts 3Ts 4Ts 5Ts p(t) = x δ (t) = δ(t nt s ) n= n= x(nt s ) δ(t T s n)=x(t) p(t) x δ (t) can also be formed from a CT signal This is called impulse sampling We can model sampling by use of the periodic impulse train J. McNames Portland State University ECE 223 Sampling Ver

13 Rectangular Window and Impulse Train Notation 1 p(t) -4Ts -3Ts -2Ts -Ts 0 Ts 2Ts 3Ts 4Ts 5Ts Note that a similar symbol was used for rectangular windows { 1 t <T p T (t) = 0 Otherwise but p(t) p T (t) J. McNames Portland State University ECE 223 Sampling Ver

14 Impulse Sampling Conceptual Example 1 x(t) -4Ts -3Ts -2Ts -Ts 0 Ts 2Ts 3Ts 4Ts 5Ts 1 p(t) -4Ts -3Ts -2Ts -Ts 0 Ts 2Ts 3Ts 4Ts 5Ts 1 x(t)p(t) -4Ts -3Ts -2Ts -Ts 0 Ts 2Ts 3Ts 4Ts 5Ts J. McNames Portland State University ECE 223 Sampling Ver

15 Impulse Sampling Terminology x(t) CT DT x[n] H(z) y[n] DT CT y(t) T s T s x δ (t) =x(t) p(t) = n= x(nt s )δ(t nt s ) The impulse train p(t) is called the sampling function p(t) is periodic with fundamental period T s T s, the fundamental period of p(t), is called the sampling period f s 1 T s and ω s = 2π T s are called the sampling frequency J. McNames Portland State University ECE 223 Sampling Ver

16 Fourier Transforms of Periodic Signals Overview x δ (t) = n= x(nt s ) δ(t T s n)=x(t) p(t) X δ (jω)= 1 X(jω) P (jω) 2π To determine how X δ (jω) is related to X(jω), we need to calculate P (jω) p(t) is a periodic function with infinite energy The CTFT clearly doesn t converge Is easier to Calculate the Fourier series coefficients P [k] for p(t) Solve for P (jω) from P [k] using the general relationship between the CTFS and the CTFT Since periodic signals have infinite energy, the CTFT of these signals consists of impulses J. McNames Portland State University ECE 223 Sampling Ver

17 Fourier Transforms of Periodic Signals Recall the Fourier series representations of periodic signals x(t) = e jω ot FT k= X[k]e jkωt 2πδ(ω ω o ) x(t) = k= X[k]e jkω ot FT 2π k= X[k] δ(ω kω o ) J. McNames Portland State University ECE 223 Sampling Ver

18 Example 1: CT Fourier Transform of an Impulse Train Solve for the Fourier transform of the impulse train p(t) = δ(t nt s ) n= Hint: the impulse train is periodic. X[k] = 1 x(t)e jkωot dt T T X(jω)= + x(t)e jωt dt J. McNames Portland State University ECE 223 Sampling Ver

19 Example 1: Workspace J. McNames Portland State University ECE 223 Sampling Ver

20 The Relationship of X(jω) to X δ (jω) x(t) p(t) P (jω) ω s x(t) p(t) FT 1 2π FT 2π T s 2π T s X(jω) P (jω) k= FT 1 2π X(jω) 2π T s δ ( ) ω k 2π T s k= X(jω) δ(ω ω o ) = X (j(ω ω o )) FT x(t) p(t) 1 X (j(ω kω s )) T s k= δ(ω kω s ) J. McNames Portland State University ECE 223 Sampling Ver

21 Summary Sampling: x[n] =x(nt s ) Definition: X δ (jω)=x(e jω ) Ω=ωTs Inverse CTFT: x δ (t) = x[n]δ(t nt s ) Impulse Sampling: x δ (t) = CTFT: P (jω)= 2π T s n= n= x(nt s )δ(t nt s ) k= δ (t kω s ) Multiplication Property: X δ (jω)= 1 X(jω) P (jω) 2π = 1 X (j(ω kω s )) T s k= J. McNames Portland State University ECE 223 Sampling Ver

22 Conceptual Diagram of the Relationship 1 X(jω) -ω s -ω x 0 ω x ω s 2π Ts P (jω) -ω s -ω x 0 ω x ω s 1 Ts X δ (jω) -ω s -ω x -ω s -ω s +ω x -ω x 0 ω s -ω x ω s +ω x ω x ω s 1 Ts X(e jω ) -Ω s -Ω x -Ω s -Ω s +Ω x -Ω x 0 Ω x Ω s -Ω x Ω s Ω s +Ω x J. McNames Portland State University ECE 223 Sampling Ver

23 x(t) p(t) FT 1 T s X(e jωt s )= 1 T s Observations k= k= X (j(ω kω s )) X (j(ω kω s )) What is Ω s? Ω s = ω s T s = 2π T s =2π T s Thus ω s in CT corresponds to 2π radians/sample in DT Recall that the fastest DT signal is e jπn =( 1) n and oscillates at π radians/sample This is the fastest signal we can observe due to e jωn =e j(ω±l2π)n What is this frequency in the CT domain? J. McNames Portland State University ECE 223 Sampling Ver

24 Expressing DT Transform in Terms of CT Transform X(e jωt s )= 1 T s k= X (j(ω kω s )) Ω=ωT s ω = Ω T s X(e jω )= 1 T s ω s = Ω s T s X(e jω )= 1 T s k= = 2π T s k= X X ( ) j( Ω T s kω s ) ( j ( )) Ω k2π T s J. McNames Portland State University ECE 223 Sampling Ver

25 What Does this Mean? x(t) p(t) FT 1 T s k= X (j(ω kω s )) Sampling with an impulse train results in a signal with a CTFT of X δ (jω) that is a periodic function of ω There are replicas of X(jω) at each multiple of ω s Note that the replicas will not overlap if ω x < ω s 2 In this case, X(jω) could be recovered from X δ (jω) by applying a lowpass filter with gain T s and a cutoff frequency ω c such that ω x <ω c <ω s ω x This is a surprising result This is the sampling theorem J. McNames Portland State University ECE 223 Sampling Ver

26 The Sampling Theorem Let x(t) be a bandlimited signal with X(jω)=0for ω >ω x.then x(t) is uniquely determined by its samples x(nt ),n=0, ±1, ±2,..., if ω s > 2 ω x where ω s = 2π T s. Thus, we can reconstruct any bandlimited signal x(t) exactly by creating a scaled impulse train and lowpass filtering This theorem is sometimes called the Shannon sampling theorem min ω s =2ω x is called the Nyquist rate max ω x = ω s 2 is called the Nyquist frequency In other words, we must obtain at least two samples per a cycle of the fastest sinusoidal component This should sound familiar Recall that the fastest perceivable frequency in discrete-time signals is π radians per sample (i.e. 0.5 cycles per sample) J. McNames Portland State University ECE 223 Sampling Ver

27 Signal Relationships Summary x[n] =x(nt s ) X(e jωt s )= 1 T s x δ (t) = x δ (t) = n= n= k= x(nt s ) δ(t T s n) X δ (jω)= 1 T s k= x[n] δ(t T s n) X δ (jω)=x ( e jωt s ) X (j(ω kω s )) X (j(ω kω s )) We now know the relationships between all of the three signals Note that x δ (t) was just a means to determining the relationship of X(e jω ) to X(jω) J. McNames Portland State University ECE 223 Sampling Ver

28 Guiding Questions and Objectives Revisited x[n] =x(nt s ) X(e jωt s )= 1 T s k= X (j(ω kω s )) Recall our guiding questions How is the CTFT of x(t) related to the DTFT of x[n] =x(nt s )? Under what conditions can we synthesize x(t) from x[n]? How do we do this DT CT conversion? Only the last remains J. McNames Portland State University ECE 223 Sampling Ver

29 Example 2: Equivalent Sinusoids Suppose x[n] is a DT sinusoidal signal, x[n] =cos(ωn + θ) Solve for all of the CT sinusoids x(t) =cos(ωt + φ) that satisfy the relationship x(t) t=nts = x[n]. Which of these CT sinusoids satisfy the sampling theorem criterion? J. McNames Portland State University ECE 223 Sampling Ver

30 Example 2: Workspace J. McNames Portland State University ECE 223 Sampling Ver

31 Example 2: Equivalent Sinusoids cos(ω t+θ cos((2π ω)t θ) cos((ω t+2π)t + θ) 1 0 Equivalent DT Sinusoids Time (s) J. McNames Portland State University ECE 223 Sampling Ver

32 function [] = EquivalentSinusoids(); close all; t = -3:6/1000:3; n = floor(min(t)):ceil(max(t)); ph = 2*pi*rand; w = 0.6*pi; Example 2: MATLAB Code figure; FigureSet(1, LTX ); subplot(3,1,1); h = plot(t,cos(w*t + ph),n,cos(w*n + ph), k. ); set(h, MarkerSize,12); box off; ylabel( cos(\omega t+\theta ); title( Equivalent DT Sinusoids ); ylim([ ]); AxisLines; subplot(3,1,2); h = plot(t,cos((2*pi-w)*t - ph),n,cos(w*n + ph), k. ); set(h, MarkerSize,12); box off; ylabel( cos((2\pi - \omega)t - \theta) ); ylim([ ]); AxisLines; subplot(3,1,3); h = plot(t,cos((w+2*pi)*t + ph),n,cos(w*n + ph), k. ); set(h, MarkerSize,12); box off; ylabel( cos((\omega t+2\pi)t + \theta) ); xlabel( Time (s) ); ylim([ ]); AxisLines; AxisSet(8); J. McNames Portland State University ECE 223 Sampling Ver

33 print -depsc EquivalentSinusoids; J. McNames Portland State University ECE 223 Sampling Ver

34 Interpolation Introduction CT DT conversion is trivial: x[n] =x(nt s ) We now know that we can reconstruct x(t) from x[n] exactly This should be surprising There are many signals x(t) that satisfy the constraint x[n] =x(nt s ) Which one is the original x(t)? J. McNames Portland State University ECE 223 Sampling Ver

35 Interpolation Possibilities Signal (scaled) Time (s) J. McNames Portland State University ECE 223 Sampling Ver

36 Bandlimited Interpolation x(t) X x p (t) H(jω) y(t) p(t) = P n= δ(t nt s) Intuitively there are signals that are equal to x(t) and evenly spaced samples However, if The samples were taken from a bandlimited signal: X(jω)=0 for ω>ω x The conditions of the sampling theorem are satisfied: ω s > 2 ω x then there is only one bandlimited signal that passes exactly through the samples! J. McNames Portland State University ECE 223 Sampling Ver

37 DT Processing of CT Signals x(t) CT DT x[n] H(z) y[n] DT CT y(t) T s T s Since x[n] completely represents x(t), we can process x[n] in discrete-time However, once we process the discrete-time signal and generate a discrete-time output, y[n] we need to create a continuous-time output y(t) We assume that y[n] represent samples from a continuous-time signal y(t) that is bandlimited the same as x(t) J. McNames Portland State University ECE 223 Sampling Ver

38 Interpolation x(t) X x δ (t) H(jω) x r (t) p(t) = P n= δ(t nt s) There are many forms of interpolation Piecewise constant Linear (point to point) Splines (piecewise cubic) For bandlimited signals, a lowpass filter can be used to exactly recover the signal Called bandlimited interpolation J. McNames Portland State University ECE 223 Sampling Ver

39 Interpolation Simplified x δ (t) = x(nt s ) δ(t nt ) n= x r (t) =x δ (t) h(t) = = = = + n= n= x δ (t τ) h(τ)dτ [ n= x(nt ) ] x(nt s ) δ(t τ nt s ) h(τ)dτ x(nt s ) h(t nt s ) δ(t τ nt s ) h(τ)dτ J. McNames Portland State University ECE 223 Sampling Ver

40 Interpolation with Ideal Filters x[n] =x(nt s ) X δ (jω)= 1 T s k= X (j(ω kω s )) If the terms of the sum do not overlap, an ideal lowpass filter can extract X(jω) from X δ (jω) The passband gain must be T s Recall that the ideal lowpass filter with cutoff frequency ω c and gain T s has an impulse response given by h(t) = T sω c sin(ω c t) = T ( ) sω c π ω c t π sinc ωc t π Thus, for ideal interpolation x r (t) = T sω c π n= ( ) ωc (t nt s ) x(nt s )sinc π J. McNames Portland State University ECE 223 Sampling Ver

41 Notes on Bandlimited Interpolation x[n] =x(nt s ) x r (t) = T sω c π n= ( ) ωc (t nt s ) x(nt s )sinc π If the sampling theorem criterion is satisfied, x r (t) =x(t) However, this assumes that the frequency components of x[n] are between π/2 and +π/2 If the sampling criterion is not satisfied, high-frequency components will appear as low-frequency components J. McNames Portland State University ECE 223 Sampling Ver

42 Bandlimited Interpolation Example 1 Example of Band limited Signal Reconstruction (Interpolation) x(t) x[n] x r (t) Time (s) J. McNames Portland State University ECE 223 Sampling Ver

43 Introduction to Aliasing x(t) p(t) FT 1 T s + k= X (j(ω kω s )) If the sampling theorem is not satisfied (ω x > ω s 2 ), the sum of replicated spectral components X(j(ω kω s )) will overlap This is called aliasing In this case x r (t) x(t), though the two will be equal at t = nt s When aliasing occurs with pure tones (sinusoidal signals), signals with frequencies above ω s 2 are reflected to lower frequencies You should have experienced this in the lab with audio J. McNames Portland State University ECE 223 Sampling Ver

44 Example 3:Aliasing of Pure Tones Signals (scaled) Aliasing of Pure Tones Example Tone Frequency:500 Hz Sample Rate:2000 Hz True Signal Reconstructed Signal Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

45 Example 3:Aliasing of Pure Tones Signals (scaled) Aliasing of Pure Tones Example Tone Frequency:900 Hz Sample Rate:2000 Hz True Signal Reconstructed Signal Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

46 Example 3:Aliasing of Pure Tones Signals (scaled) Aliasing of Pure Tones Example Tone Frequency:1100 Hz Sample Rate:2000 Hz True Signal Reconstructed Signal Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

47 Example 3:Aliasing of Pure Tones Signals (scaled) Aliasing of Pure Tones Example Tone Frequency:1500 Hz Sample Rate:2000 Hz True Signal Reconstructed Signal Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

48 Example 3:Aliasing of Pure Tones Signals (scaled) Aliasing of Pure Tones Example Tone Frequency:1800 Hz Sample Rate:2000 Hz True Signal Reconstructed Signal Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

49 Example 3:Aliasing of Pure Tones Signals (scaled) Aliasing of Pure Tones Example Tone Frequency:2200 Hz Sample Rate:2000 Hz True Signal Reconstructed Signal Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

50 Example 3: MATLAB Code function [] = AliasingTones(); close all; fs = 2e3; % 2 khz sample rate fx = [ e3 1.5e3 1.8e3 2.2e3]; t = 0:10e-3/500:10e-3; % Span of 5 ms ts = -15e-3:1/fs:25e-3; % Sampled times T = 1/fs; ws = 2*pi*fs; wc = ws/2; for c1 = 1:length(fx), xt = cos(2*pi*fx(c1)*t); % True signal xs = cos(2*pi*fx(c1)*ts); % True signal sampled xr = zeros(size(t)); % Reconstructed signal memory allocation for c2 = 1:length(ts), st = (wc*t/pi)*xs(c2)*sinc(wc*(t-ts(c2))/pi); % Band-limited interpolation xr = xr + st; end; figure; FigureSet(1, LTX ); h = plot(t*1e3,xt, b,t*1e3,xr, g,ts*1e3,xs, ko ); set(h(1), LineWidth,1.5); set(h(2), LineWidth,0.8); set(h(3), MarkerFaceColor, k ); set(h(3), MarkerSize,4); xlim([min(t*1e3) max(t*1e3)]); ylim([ ]); box off; xlabel( Time (ms) ); ylabel( Signals (scaled) ); title(sprintf( Aliasing of Pure Tones Example Tone Frequency:%d Hz Sample Rate:%d Hz,fx(c1),fs)); J. McNames Portland State University ECE 223 Sampling Ver

51 return; AxisSet(8); legend( True Signal, Reconstructed Signal ); eval(sprintf( print -depsc AliasingTones%04d;,fx(c1))); end; n = -15:15; t = -5.5:0.01:5.5; xp = rand(size(n)); % Sampled signal wc = pi; T = 1; xr = zeros(size(t)); % Reconstructed signal subplot(3,1,3); for cnt = 1:length(n), st = (wc*t/pi)*xp(cnt)*sinc(wc*(t-n(cnt)*t)/pi); plot(t,st, g ); hold on; xr = xr + st; end; h = plot(t,xr, b,n,xp, ro ); set(h(2), MarkerFaceColor, r ); set(h(2), MarkerSize,2); hold off; xlim([min(t) max(t)]); ylim([ ]); xlabel( Time (s) ); ylabel( Signal ); box off; subplot(3,1,2); plot([min(t) max(t)],[0 0], k: ); hold on; h = stem(n,xp, r ); set(h(1), MarkerFaceColor, r ); set(h(1), MarkerSize,2); J. McNames Portland State University ECE 223 Sampling Ver

52 hold off; ylabel( Sampled Signal ); subplot(3,1,1); h = plot(t,xr, b,n,xp, ro ); set(h(2), MarkerFaceColor, r ); set(h(2), MarkerSize,2); ylabel( Reconstructed Signal ); xlim([min(t) max(t)]); ylim([ ]); box off; title( Example of Band-limited Siganl Reconstruction (Interpolation) ); J. McNames Portland State University ECE 223 Sampling Ver

53 Example 4:Aliasing of Speech The following slides show a segment of speech for Regis Philbin stating part of the word Your. The signal was sampled at various rates and then interpolated. The difference between the true signal and the reconstructed signal demonstrates the hazard of under sampling. The original signal was sampled at 44.1 khz. Why isn t the aliasing apparent at 22 khz? J. McNames Portland State University ECE 223 Sampling Ver

54 Example 4:Aliasing of Speech Signals (scaled) True Signal Reconstructed Signal Regis "Your" Sample Rate: Hz Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

55 Example 4:Aliasing of Speech Signals (scaled) True Signal Reconstructed Signal Regis "Your" Sample Rate: Hz Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

56 Example 4:Aliasing of Speech Signals (scaled) True Signal Reconstructed Signal Regis "Your" Sample Rate: Hz Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

57 Example 4:Aliasing of Speech Signals (scaled) True Signal Reconstructed Signal Regis "Your" Sample Rate: Hz Time (ms) J. McNames Portland State University ECE 223 Sampling Ver

58 Effect of Aliasing in the Frequency Domain 1 X δ (jω) ω s ω x 1 0 ω x X δ (jω) ω s ω ω s ω x 0 ω x ω s ω 1 X δ (jω) ω s ω x 2 0 ω x X δ (jω) ω s ω 1-2ws ω s 0 ω s 2ws ω J. McNames Portland State University ECE 223 Sampling Ver

59 Aliasing Comments In discrete-time, one of the key concepts of this class is that complex exponentials with frequencies that differ by a multiple of 2π are indistinguishable: e j(ω+l2π)n =e jωn When we sample a signal, we convert a continuous-time signal to a discrete-time signal Sinusoidal components that are above ω s 2 are reflected down to lower frequencies You have experienced aliasing before Spoked wheels in street lights that strobe at 120 Hz Spoked wagon wheels or helicopter blades in movies and television Strobe lights applied to rapidly oscillating objects J. McNames Portland State University ECE 223 Sampling Ver

60 Preventing Aliasing x(t) H(s) Anti-Aliasing Filter C/D Conversion T x[n] In practice, most data acquisition systems that convert CT signals to DT signals take two measures to prevent aliasing Apply an analog (continuous-time) lowpass filter prior to sampling to ensure the signal is bandlimited Use a higher sampling rate than required by the sampling theorem (e.g. ω s =2.2 ω x ) These lowpass filters are often called anti-aliasing filters J. McNames Portland State University ECE 223 Sampling Ver

61 Anti-aliasing Filter Tradeoffs x(t) H(s) Anti-Aliasing Filter C/D Conversion T x[n] Over-sampling also has a number of benefits for the anti-aliasing filter (AAF). The transition band can be wider If the filter order is fixed, the passband and stopband attenuation can be improved If the passband and stopband attenuation are fixed, a lower order filter can be used (easier and less expensive to design and build) J. McNames Portland State University ECE 223 Sampling Ver

62 Discrete-Time Processing of Continuous-Time Signals x(t) CT DT x[n] H(z) y[n] DT CT y(t) T s X(e jω )= 1 T s k= X ( j ( T)) s Ω k2π Most electronic systems that process signals do so in discrete-time There are many advantages to this approach Digital technology is cheap to manufacture and very advanced Digital systems do not drift over time Parameter tuning (expensive) is not necessary; repeatable More flexible The sampling theorem is the theoretical basis for DT processing of CT signals T s J. McNames Portland State University ECE 223 Sampling Ver

63 Fourier Example of CTFT & DTFT Relationship 1 X(jω) ω s 0 ω s ω 1 X δ (jω) ω s 0 ω s ω 1 T X(e jω ) 2π 0 2π Ω J. McNames Portland State University ECE 223 Sampling Ver

64 CT to DT Conversion Comments X(e jω )= 1 ( ( )) Ω k2π X j T s T s k= If the sampling theorem is satisfied, the DTFT is a scaled version of the CTFT The amplitude of the DTFT is scaled by 1 T s The frequency ω s is mapped to Ω s =2π This means we can theoretically calculate the CTFT of a band-limited signal exactly using the DTFT of the sampled signal x(nt ) For spectral estimation, the signal must first be windowed and then the FFT is used to calculate the DTFT This is exactly how the sampling oscilloscopes use the FFT to estimate the Fourier transform of a CT signal J. McNames Portland State University ECE 223 Sampling Ver

65 CT to DT Conversion Comments 1 H(jω) ω s ω s 1 2 ω s H(e jω ) ω s ω 2π π 0 π 2π Ω This also means we can process band-limited CT signals with DT systems without any loss As long as the sampling theorem is satisfied, we simply design H(z) such that H(e jω )=H(jω) Ω for Ω <π ω= T s In this case, the DT & CT systems are equivalent J. McNames Portland State University ECE 223 Sampling Ver

66 DT to CT Conversion Comments y[n] Impulse Train DT to CT y δ (t) Interpolation Filter y(t) y δ (t) = n= y[n] δ(t nt s ) The interpolation filter is just a lowpass filter with a passband gain of T s and a cutoff frequency of ω s 2 J. McNames Portland State University ECE 223 Sampling Ver

67 Summary of Key Concepts If a signal is bandlimited, we can sample the signal without losing any information The original signal can be reconstructed from its samples exactly The sampling theorem is the basis for discrete-time processing of continuous-time signals If the sampling theorem is satisfied, the CTFT can be calculated exactly from the DTFT There are many advantages to using this type of architecture If the sampling theorem is not satisfied, sampling will result in aliasing If a signal is bandlimited, we can theoretically build an equivalent DT system for any CT system J. McNames Portland State University ECE 223 Sampling Ver

J. McNames Portland State University ECE 223 Sampling Ver

J. McNames Portland State University ECE 223 Sampling Ver Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT

More information

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids

Core Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids Overview of Continuous-Time Fourier Transform Topics Definition Compare & contrast with Laplace transform Conditions for existence Relationship to LTI systems Examples Ideal lowpass filters Relationship

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series

More information

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal

Overview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI

More information

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding

Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω

More information

Assignment 4 Solutions Continuous-Time Fourier Transform

Assignment 4 Solutions Continuous-Time Fourier Transform Assignment 4 Solutions Continuous-Time Fourier Transform ECE 3 Signals and Systems II Version 1.01 Spring 006 1. Properties of complex numbers. Let c 1 α 1 + jβ 1 and c α + jβ be two complex numbers. a.

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

Chapter 5 Frequency Domain Analysis of Systems

Chapter 5 Frequency Domain Analysis of Systems Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this

More information

J. McNames Portland State University ECE 223 DT Fourier Series Ver

J. McNames Portland State University ECE 223 DT Fourier Series Ver Overview of DT Fourier Series Topics Orthogonality of DT exponential harmonics DT Fourier Series as a Design Task Picking the frequencies Picking the range Finding the coefficients Example J. McNames Portland

More information

EE 224 Signals and Systems I Review 1/10

EE 224 Signals and Systems I Review 1/10 EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS

More information

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n. ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Consider the following periodic signal, depicted below: {, if n t < n +, for any integer n,

More information

Chap 4. Sampling of Continuous-Time Signals

Chap 4. Sampling of Continuous-Time Signals Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion

More information

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)

More information

Signals and Systems Spring 2004 Lecture #9

Signals and Systems Spring 2004 Lecture #9 Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier

More information

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)

4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1) 4.1 Introduction Two cases of mixed signals to be studied in this chapter: 1. Periodic and nonperiodic signals 2. Continuous- and discrete-time signals Other descriptions: Refer to pp. 341-342, textbook.

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing

More information

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1

Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, Signals & Systems Sampling P1 Homework: 4.50 & 4.51 of the attachment Tutorial Problems: 7.41, 7.44, 7.47, 7.49 Signals & Systems Sampling P1 Undersampling & Aliasing Undersampling: insufficient sampling frequency ω s < 2ω M Perfect

More information

ESE 531: Digital Signal Processing

ESE 531: Digital Signal Processing ESE 531: Digital Signal Processing Lec 8: February 7th, 2017 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing

More information

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1

ECE 301 Fall 2011 Division 1 Homework 10 Solutions. { 1, for 0.5 t 0.5 x(t) = 0, for 0.5 < t 1 ECE 3 Fall Division Homework Solutions Problem. Reconstruction of a continuous-time signal from its samples. Let x be a periodic continuous-time signal with period, such that {, for.5 t.5 x(t) =, for.5

More information

Overview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros)

Overview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros) Overview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros) J. McNames Portland State University ECE 222 Bode Plots Ver.

More information

ELEN 4810 Midterm Exam

ELEN 4810 Midterm Exam ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise

More information

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

Lecture 13: Discrete Time Fourier Transform (DTFT)

Lecture 13: Discrete Time Fourier Transform (DTFT) Lecture 13: Discrete Time Fourier Transform (DTFT) ECE 401: Signal and Image Analysis University of Illinois 3/9/2017 1 Sampled Systems Review 2 DTFT and Convolution 3 Inverse DTFT 4 Ideal Lowpass Filter

More information

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.

Final Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. Final Exam of ECE301, Section 3 (CRN 17101-003) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and

More information

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples

Lecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 8: Signal Reconstruction, D vs C Processing Oct 24, 2001 Prof: J. Bilmes

More information

Fourier transform representation of CT aperiodic signals Section 4.1

Fourier transform representation of CT aperiodic signals Section 4.1 Fourier transform representation of CT aperiodic signals Section 4. A large class of aperiodic CT signals can be represented by the CT Fourier transform (CTFT). The (CT) Fourier transform (or spectrum)

More information

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011

LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011 University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral

More information

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e

More information

Grades will be determined by the correctness of your answers (explanations are not required).

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers

More information

Review of Discrete-Time System

Review of Discrete-Time System Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.

More information

Each problem is worth 25 points, and you may solve the problems in any order.

Each problem is worth 25 points, and you may solve the problems in any order. EE 120: Signals & Systems Department of Electrical Engineering and Computer Sciences University of California, Berkeley Midterm Exam #2 April 11, 2016, 2:10-4:00pm Instructions: There are four questions

More information

Grades will be determined by the correctness of your answers (explanations are not required).

Grades will be determined by the correctness of your answers (explanations are not required). 6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations

More information

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t

More information

6.003: Signals and Systems. Sampling and Quantization

6.003: Signals and Systems. Sampling and Quantization 6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =

More information

MEDE2500 Tutorial Nov-7

MEDE2500 Tutorial Nov-7 (updated 2016-Nov-4,7:40pm) MEDE2500 (2016-2017) Tutorial 3 MEDE2500 Tutorial 3 2016-Nov-7 Content 1. The Dirac Delta Function, singularity functions, even and odd functions 2. The sampling process and

More information

Windowing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples

Windowing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples ing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples ing In practice, we cannot observe a signal x(n) for n = to n = Thus we must truncate, or window, the signal: x(n) w(n) ing

More information

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING GEORGIA INSIUE OF ECHNOLOGY SCHOOL of ELECRICAL and COMPUER ENGINEERING ECE 6250 Spring 207 Problem Set # his assignment is due at the beginning of class on Wednesday, January 25 Assigned: 6-Jan-7 Due

More information

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.

Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address, and signature

More information

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.

More information

EEO 401 Digital Signal Processing Prof. Mark Fowler

EEO 401 Digital Signal Processing Prof. Mark Fowler EEO 4 Digital Signal Processing Pro. Mark Fowler ote Set # Using the DFT or Spectral Analysis o Signals Reading Assignment: Sect. 7.4 o Proakis & Manolakis Ch. 6 o Porat s Book /9 Goal o Practical Spectral

More information

FROM ANALOGUE TO DIGITAL

FROM ANALOGUE TO DIGITAL SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary

More information

Bridge between continuous time and discrete time signals

Bridge between continuous time and discrete time signals 6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems

More information

Review: Continuous Fourier Transform

Review: Continuous Fourier Transform Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By

More information

Definition of Discrete-Time Fourier Transform (DTFT)

Definition of Discrete-Time Fourier Transform (DTFT) Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with

More information

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.

Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,

More information

E : Lecture 1 Introduction

E : Lecture 1 Introduction E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation

More information

Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion

Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion Analog Digital Sampling & Discrete Time Discrete Values & Noise Digital-to-Analog Conversion Analog-to-Digital Conversion 6.082 Fall 2006 Analog Digital, Slide Plan: Mixed Signal Architecture volts bits

More information

Digital Signal Processing. Midterm 1 Solution

Digital Signal Processing. Midterm 1 Solution EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete

More information

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that:

More information

X. Chen More on Sampling

X. Chen More on Sampling X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,

More information

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December

More information

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY 1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/

More information

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk

Signals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω

More information

Digital Signal Processing

Digital Signal Processing Digital Signal Processing Introduction Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz prenosil@fi.muni.cz February

More information

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out

More information

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R.

Signals & Systems. Chapter 7: Sampling. Adapted from: Lecture notes from MIT, Binghamton University, and Purdue. Dr. Hamid R. Signals & Systems Chapter 7: Sampling Adapted from: Lecture notes from MIT, Binghamton University, and Purdue Dr. Hamid R. Rabiee Fall 2013 Outline 1. The Concept and Representation of Periodic Sampling

More information

Fourier Representations of Signals & LTI Systems

Fourier Representations of Signals & LTI Systems 3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n] 2. LTI system: LTI System Output = A weighted superposition of the system response to each complex

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing EE23 Digital Signal Processing Lecture 7B Sampling What is this Phenomena? https://www.youtube.com/watch?v=cxddi8m_mzk Sampling of Continuous ime Signals (Ch.4) Sampling: Conversion from C. (not quantized)

More information

6.003: Signals and Systems. CT Fourier Transform

6.003: Signals and Systems. CT Fourier Transform 6.003: Signals and Systems CT Fourier Transform April 8, 200 CT Fourier Transform Representing signals by their frequency content. X(jω)= x(t)e jωt dt ( analysis equation) x(t)= X(jω)e jωt dω ( synthesis

More information

Discrete Time Fourier Transform

Discrete Time Fourier Transform Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of

More information

ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name:

ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, Name: ECE 3084 QUIZ 2 SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY APRIL 2, 205 Name:. The quiz is closed book, except for one 2-sided sheet of handwritten notes. 2. Turn off

More information

Sinc Functions. Continuous-Time Rectangular Pulse

Sinc Functions. Continuous-Time Rectangular Pulse Sinc Functions The Cooper Union Department of Electrical Engineering ECE114 Digital Signal Processing Lecture Notes: Sinc Functions and Sampling Theory October 7, 2011 A rectangular pulse in time/frequency

More information

Homework 3 Solutions

Homework 3 Solutions EECS Signals & Systems University of California, Berkeley: Fall 7 Ramchandran September, 7 Homework 3 Solutions (Send your grades to ee.gsi@gmail.com. Check the course website for details) Review Problem

More information

6.003: Signals and Systems. CT Fourier Transform

6.003: Signals and Systems. CT Fourier Transform 6.003: Signals and Systems CT Fourier Transform April 8, 200 CT Fourier Transform Representing signals by their frequency content. X(jω)= x(t)e jωt dt ( analysis equation) x(t)= 2π X(jω)e jωt dω ( synthesis

More information

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Signals and Systems Lecture 14 DR TAIA STATHAKI READER (ASSOCIATE PROFESSOR) I SIGAL PROCESSIG IMPERIAL COLLEGE LODO Introduction. Time sampling theorem resume. We wish to perform spectral analysis using

More information

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions 8-90 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 08 Midterm Solutions Name: Andrew ID: Problem Score Max 8 5 3 6 4 7 5 8 6 7 6 8 6 9 0 0 Total 00 Midterm Solutions. (8 points) Indicate whether

More information

Aspects of Continuous- and Discrete-Time Signals and Systems

Aspects of Continuous- and Discrete-Time Signals and Systems Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the

More information

The Fourier Transform (and more )

The Fourier Transform (and more ) The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider

More information

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

Fourier Analysis of Signals Using the DFT

Fourier Analysis of Signals Using the DFT Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal

More information

Spectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates

Spectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates Spectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates J. McNames Portland State University ECE 3 Spectrograms Ver. 1.1 1 Introduction

More information

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set

More information

Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University

Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2 Robi Polikar, Rowan University Sinusoids & Exponentials Signals Phasors Frequency Impulse, step, rectangular Characterization Power /

More information

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2

TTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2 Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be

More information

2 Background: Fourier Series Analysis and Synthesis

2 Background: Fourier Series Analysis and Synthesis Signal Processing First Lab 15: Fourier Series Pre-Lab and Warm-Up: You should read at least the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in the Pre-Lab section before

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded

More information

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit dwm/courses/2tf

2A1H Time-Frequency Analysis II Bugs/queries to HT 2011 For hints and answers visit   dwm/courses/2tf Time-Frequency Analysis II (HT 20) 2AH 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 20 For hints and answers visit www.robots.ox.ac.uk/ dwm/courses/2tf David Murray. A periodic

More information

Complex symmetry Signals and Systems Fall 2015

Complex symmetry Signals and Systems Fall 2015 18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The

More information

Continuous Fourier transform of a Gaussian Function

Continuous Fourier transform of a Gaussian Function Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain

More information

Lecture 19: Discrete Fourier Series

Lecture 19: Discrete Fourier Series EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou

More information

Sensors. Chapter Signal Conditioning

Sensors. Chapter Signal Conditioning Chapter 2 Sensors his chapter, yet to be written, gives an overview of sensor technology with emphasis on how to model sensors. 2. Signal Conditioning Sensors convert physical measurements into data. Invariably,

More information

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its

More information

Discrete-Time David Johns and Ken Martin University of Toronto

Discrete-Time David Johns and Ken Martin University of Toronto Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn

More information

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control

School of Information Technology and Electrical Engineering EXAMINATION. ELEC3004 Signals, Systems & Control This exam paper must not be removed from the venue Venue Seat Number Student Number Family Name First Name School of Information Technology and Electrical Engineering EXAMINATION Semester One Final Examinations,

More information

ECE 301: Signals and Systems Homework Assignment #7

ECE 301: Signals and Systems Homework Assignment #7 ECE 301: Signals and Systems Homework Assignment #7 Due on December 11, 2015 Professor: Aly El Gamal TA: Xianglun Mao 1 Aly El Gamal ECE 301: Signals and Systems Homework Assignment #7 Problem 1 Note:

More information

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response. University of California at Berkeley Department of Electrical Engineering and Computer Sciences Professor J. M. Kahn, EECS 120, Fall 1998 Final Examination, Wednesday, December 16, 1998, 5-8 pm NAME: 1.

More information

Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited

Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited Copyright c 2005 Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 14, 2018 Frame # 1 Slide # 1 A. Antoniou

More information

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters

Signals, Instruments, and Systems W5. Introduction to Signal Processing Sampling, Reconstruction, and Filters Signals, Instruments, and Systems W5 Introduction to Signal Processing Sampling, Reconstruction, and Filters Acknowledgments Recapitulation of Key Concepts from the Last Lecture Dirac delta function (

More information

L6: Short-time Fourier analysis and synthesis

L6: Short-time Fourier analysis and synthesis L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude

More information

Filter Analysis and Design

Filter Analysis and Design Filter Analysis and Design Butterworth Filters Butterworth filters have a transfer function whose squared magnitude has the form H a ( jω ) 2 = 1 ( ) 2n. 1+ ω / ω c * M. J. Roberts - All Rights Reserved

More information

Fourier Analysis & Spectral Estimation

Fourier Analysis & Spectral Estimation The Intuitive Guide to Fourier Analysis & Spectral Estimation with MATLAB This book will deepen your understanding of Fourier analysis making it easier to advance to more complex topics in digital signal

More information

6.003 Signal Processing

6.003 Signal Processing 6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal

More information

Final Exam 14 May LAST Name FIRST Name Lab Time

Final Exam 14 May LAST Name FIRST Name Lab Time EECS 20n: Structure and Interpretation of Signals and Systems Department of Electrical Engineering and Computer Sciences UNIVERSITY OF CALIFORNIA BERKELEY Final Exam 14 May 2005 LAST Name FIRST Name Lab

More information

2A1H Time-Frequency Analysis II

2A1H Time-Frequency Analysis II 2AH Time-Frequency Analysis II Bugs/queries to david.murray@eng.ox.ac.uk HT 209 For any corrections see the course page DW Murray at www.robots.ox.ac.uk/ dwm/courses/2tf. (a) A signal g(t) with period

More information

Chapter 2: Problem Solutions

Chapter 2: Problem Solutions Chapter 2: Problem Solutions Discrete Time Processing of Continuous Time Signals Sampling à Problem 2.1. Problem: Consider a sinusoidal signal and let us sample it at a frequency F s 2kHz. xt 3cos1000t

More information

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set

More information

Lecture 14: Windowing

Lecture 14: Windowing Lecture 14: Windowing ECE 401: Signal and Image Analysis University of Illinois 3/29/2017 1 DTFT Review 2 Windowing 3 Practical Windows Outline 1 DTFT Review 2 Windowing 3 Practical Windows DTFT Review

More information

Cast of Characters. Some Symbols, Functions, and Variables Used in the Book

Cast of Characters. Some Symbols, Functions, and Variables Used in the Book Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998

More information

LAB 6: FIR Filter Design Summer 2011

LAB 6: FIR Filter Design Summer 2011 University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 6: FIR Filter Design Summer 011

More information