Radar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing
|
|
- Brian McKenzie
- 5 years ago
- Views:
Transcription
1 Radar Systems Engineering Lecture Review of Signals, Systems and Digital Signal Processing Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course Review Signals, Systems & DSP //
2 Block Diagram of Radar System Target Radar Cross Section Propagation Medium Antenna T / R Switch Power Amplifier Transmitter Waveform Generation Signal Processor Computer Received Signal Receiver A / D Converter Pulse Compression Clutter Rejection (Doppler Filtering) Signal Strength General Purpose Computer Time Console / Displays Tracking Parameter Estimation Thresholding Detection Data Recording Radar Systems Course Review Signals, Systems & DSP // Application of Signals and Systems, and Digital Signal Processing Algorithms to the Received Radar Signals Result in Optimum Target Detection
3 Reasons for Review Lecture Signals and systems, and digital signal processing are usually one semester advanced undergraduate courses for electrical engineering majors In no way will this + hour lecture to justice to this large amount of material The lecture will present an overview of the material from these two courses that will be useful for understanding the overall Radar Systems Engineering course Goal of lecture- Give non EE majors a quick view of material; they may wish to study in more depth to enhance their understanding of this course. UC Berkeley has an excellent, free, video Signals and Systems course (ECE ) online at //webcast.berkeley.edu Given in Spring 7 Radar Systems Course Review Signals, Systems & DSP //
4 Signal Processing Signal processing is the manipulation, analysis and interpretation of signals. Signal processing includes: Adaptive filtering / thresholding Spectrum analysis Pulse compression Doppler filtering Image enhancement Adaptive antenna beam forming, and A lot of other non-radar stuff ( Image processing, speech processing, etc. It involves the collection, storage and transformation of data Analog and digital signal processing A lot of processing horsepower is usually required Radar Systems Course 4 Review Signals, Systems & DSP //
5 Outline Continuous Signals Sampled Data and Discrete Time Systems Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 5 Review Signals, Systems & DSP //
6 Continuous Time Signal x( t) t Examples: x x x ( t) = sin( πt) 79cos( πt) () t () 5 t = = t t t + 5t Radar Systems Course 6 Review Signals, Systems & DSP //
7 Continuous Time Signal x () t x( t) Non-periodic Periodic ( t + Δt) x( t) x = t t Types of continuous time signals Periodic or Non-periodic Radar Systems Course 7 Review Signals, Systems & DSP //
8 Continuous Time Signal Re [ x() t ] Im x [ ( t) ] t t x( t) is a complex periodic signal Types of continuous time signals Periodic or Non-periodic Real or Complex Radar signals are complex Radar Systems Course 8 Review Signals, Systems & DSP //
9 Continuous, Linear, Time Invariant Systems Continuous Linear Time Invariant System x () t y( t) y ( t) = T[ x( t) ] T = Operator Continuous If x() t and y( t) are continuous time functions, the system is a continuous time system Linear If the system satisfies [ α x ( t) + β x ( t) ] = α y ( t) + y ( t) T β Time Invariant If a time shift in the input causes the same time shift in the output Radar Systems Course 9 Review Signals, Systems & DSP //
10 Linear Time Invariant Systems (Delta Function) Continuous Linear Time Invariant System x () t y( t) Continuous Linear Time Invariant System δ ( t) h( t) Properties of Delta Function δ () t = δ t t = () t dt = The impulse response h t is the response of the system when the input is δ t () ( ) Radar Systems Course Review Signals, Systems & DSP //
11 Linear Time Invariant Systems Continuous Linear Time Invariant System x () t y( t) Continuous Linear Time Invariant System δ ( t) h( t) Definition : Convolution of Two Functions x () t x () t x () τ x ( t τ) dτ Reversed and Shifted Radar Systems Course Review Signals, Systems & DSP //
12 Linear Time Invariant Systems Continuous Linear Time Invariant System x () t y( t) Continuous Linear Time Invariant System δ ( t) h( t) y Convolution of and () t x() t h() t = x() τ h( t τ) dτ = x ( t) h( t) The output of any continuous time, linear, time-invariant (LTI) system is the convolution of the input x() t with the impulse response of the system h t ( ) Radar Systems Course Review Signals, Systems & DSP //
13 Why not Analog Sensors and Calculation Systems? Voltmeter Disadvantages Measurement Repeatability Environmental Sensitivity Size Complexity Courtesy of Hannes Grobe Cost Slide Rule Courtesy of oschene Courtesy of US Navy Torpedo Data Computer (94s) Radar Systems Course Review Signals, Systems & DSP //
14 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems General properties A/D Conversion Sampling Theorem and Aliasing Convolution of Discrete Time Signals Fourier Properties of Signals Continuous vs. Discrete Periodic vs. Aperiodic Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 4 Review Signals, Systems & DSP //
15 Sampled Data Systems Digital signal processing deals with sampled data Digital processing differs from processing continuous (analog) signals Digital Samples are obtained with a Sample and Hold (S/H) Amplifier followed by an Analog-to-Digital (A/D) converter Sampling rate Word length Radar Systems Course 5 Review Signals, Systems & DSP //
16 Waveform Sampling Sampling converts a continuous signal into a sequence of numbers Continuous-time System x ( t) Discrete-time System x[ n] A/D Converter Radar signals are complex Radar Systems Course 6 Review Signals, Systems & DSP //
17 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems General properties A/D Conversion Sampling Theorem and Aliasing Convolution of Discrete Time Signals Fourier Properties of Signals Continuous vs. Discrete Periodic vs. Aperiodic Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 7 Review Signals, Systems & DSP //
18 Ideal Analog to Digital (A/D) Converter V OUT V IN A/D Converter V OUT P(V ERROR q ) V FS q V FS V IN q σ VERROR = Radar Systems Course 8 Review Signals, Systems & DSP // q q q q V ERROR = V OUT V V IN IN
19 Non-Perfect Nature of A/D Converters Non- Monotonic Output Output Missing Bit Actual Input Offset Input Gain Missing bits Monotonicity Offset Nonlinearity Missing bits Ideal Radar Systems Course 9 Review Signals, Systems & DSP //
20 Single Tone A/D Converter Testing Fundamental Power Level (dbm) Spur Free Dynamic Range (SFDR) Highest Spur Frequency (MHz) For Ideal A/D S/N=6.N +.76 db Radar Systems Course Review Signals, Systems & DSP //
21 A/D Word Length A / D output is signed N bit integers Twos complement arithmetic Quantization noise power = Signal-to-noise ratio SNR, S / N must fit o within the word length: S = maximum signal power (target, jamming, clutter) = thermal noise power in A / D input N o α 4 Typically, to reduce clipping (limiting) Required word length: / ( ), L > αs / < N ( SNR / 6). L > DB + o A/D Saturation Head Room (~ db) Maximum Signal Receiver Dynamic Range Noise Signal Foot Room (~ db) Noise Quantization SNRDB = log SNR Radar Systems Course Review Signals, Systems & DSP //
22 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems General properties A/D Conversion Sampling Theorem and Aliasing Convolution of Discrete Time Signals Fourier Properties of Signals Continuous vs. Discrete Periodic vs. Aperiodic Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course Review Signals, Systems & DSP //
23 Waveform Sampling Sampling converts a continuous signal into a sequence of numbers Continuous-time System x ( t) Discrete-time System x[ n] A/D Converter Radar signals are complex Radar Systems Course Review Signals, Systems & DSP //
24 Sampling - Overview Sampling Theorem constraint (a.k.a. Nyquist criterion) to prevent aliasing : For continuous aperiodic signals: F s B F s = Sampling Frequency Nyquist criterion: Permits reconstruction via a low pass filtering Eliminates Aliasing Radar Systems Course 4 Review Signals, Systems & DSP //
25 Signal Sampling Issues Signal Reconstruction F s > B LPF X( F) B X c ( F) F s F s Elimination of Aliasing X( F) Overlapping, Aliased Spectra F s < B F s Fs F s Fs 4Fs Radar Systems Course 5 Review Signals, Systems & DSP //
26 The Sampling Theorem If (t) is strictly band limited, x c X (F) = for F > B then, x c (t) may be uniquely recovered from its samples B F S = π T S B The frequency is called the Nyquist frequency, and the minimum sampling frequency, F S = B, is called the Nyquist rate x[ n] if Radar Systems Course 6 Review Signals, Systems & DSP //
27 Spectrum of a Sampled Signal Sampling periodically replicates the spectrum Fourier transform of a sampled signal is periodic X c ( ) ( ) x c ( ) [ n] If F and X F are the spectra of t and x X c ( F) = x ( t) c e jπft dt ( ) = g( t) δ( t nt) X F n= e jπft dt X c ( F) = n= x jπ Fs [ n] e nf / X( F) F s Fs F s Fs Radar Systems Course 7 Review Signals, Systems & DSP //
28 Distortion of a Signal Spectrum by Aliasing Assume band limited so that x c (t) X (f ) =, for f > B X c ( F) x c (t) F S B If is sampled with F S If is sampled with x c (t) F S < B B B X( F) / T S X( F) / T S B B No Aliasing FS Aliased parts of spectrum F F F S F S / F S / F S F Radar Systems Course 8 Review Signals, Systems & DSP //
29 Effect of Sampling Rate on Frequency..5 x c (t) -5 5 t (sec) Sampled Signal Its Fourier Transform x x c Continuous Signal (t) A t = e, A > A T n AT [ n] = x (nt) = e = ( e ) X Its Fourier Transform X c (F) = A A + (πf) n n AT c = a a = e, FS = ( ω) = x[ n] n= e j ω n a = acosω + a, ω = π T F F S X = T l= ( F) X ( F lf ) = Xˆ ( F) = c c xˆ c(t) Reconstructed Signal c Inverse Fourier Transform T FS X( F) F FS F > Radar Systems Course 9 Review Signals, Systems & DSP // Adapted from Proakis and Manolakis, Reference
30 Spectrum of Reconstructed Signal Signal Frequency Spectrum Continuous Signal..5 x c (t) X c ( F) Sampled Signal x [ n] = x ( nt) c t (sec) T = sec Frequency (Hz) F S = Hz Sampled Signal x Radar Systems Course Review Signals, Systems & DSP // [ n] = x ( nt) c t (sec) t (sec) T = sec Frequency (Hz) F S = Hz Frequency (Hz) Adapted from Proakis and Manolakis, Reference 4
31 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems General properties A/D Conversion Sampling Theorem and Aliasing Convolution of Discrete Time Signals Fourier Properties of Signals Continuous vs. Discrete Periodic vs. Aperiodic Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course Review Signals, Systems & DSP //
32 Convolution for Discrete Time Systems Continuous-time System x () t y = Continuous Linear Time Invariant System x ( t) y( t) () t h() τ x( t τ) dτ Discrete-time System x[ n] x[ n] y Discrete Linear Time Invariant System y[ n] [ n] h[ k] x[ n k] = k= Radar Systems Course Review Signals, Systems & DSP //
33 y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= k= Example: h[ k]= x[ k] = x [ ] h[ k] Step : Plot the sequences, k and Radar Systems Course Review Signals, Systems & DSP //
34 y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= k= Example: h[ k]= x[ k] = h[ k] = - - Step : Take one of the sequences and time reverse it Radar Systems Course 4 Review Signals, Systems & DSP //
35 y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= k= Example: h[ k]= x[ k] = h[ k] = - - [ ] Step : Shift h k by n, yielding a shift to the left a shift to the right n < h[ n k] = n > n-,n-,n Radar Systems Course 5 Review Signals, Systems & DSP //
36 y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= k= Example: h[ k]= x[ k] = h[ k] = - - Step 4 : For each value of n,multiply the sequences x k and h[ n k] ; and add products together for all values of to produce y n [ ] [ ] k Radar Systems Course 6 Review Signals, Systems & DSP //
37 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = k= for n = h[ k] = - - h[ k]= No overlap = Radar Systems Course 7 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
38 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = k= for n = h[ k] = - h[ k]= One sample overlaps = (x) = Radar Systems Course 8 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
39 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = 4 k= 4 5 for n = h[ k] = h[ k]= Two samples overlaps = (x)+(x) = 4 Radar Systems Course 9 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
40 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = k= for n = h[ k] = h[ k]= Three samples overlaps = (x)+(x)+(4x) = Radar Systems Course 4 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
41 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = 4 k= 4 5 for n = 4 h[ 4 k] = 4 h[ 4 k]= Three samples overlaps = (x)+(4x)+(x) = 7 Radar Systems Course 4 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
42 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = 4 k= 4 5 for n = 5 h[ 5 k] = 4 5 Three samples overlaps = (4x)+(x)+(x) = 7 Radar Systems Course 4 Review Signals, Systems & DSP // x[ k]= h[ 5 k]= y [ n] y[ n] Output of Convolution Sample Number
43 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = k= for n = 6 h[ 6 k] = h[ 6 k]= Two samples overlaps = (x)+(x) = Radar Systems Course 4 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
44 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = 4 k= 4 5 for n = 7 h[ 7 k] = h[ 7 k]= One sample overlaps = (x) = Radar Systems Course 44 Review Signals, Systems & DSP // x[ k]= y [ n] y[ n] Output of Convolution Sample Number
45 Example: h[ k]= y Graphical Implementation of Convolution [ n] h[ k] x[ n k] = x[ k] h[ n k] = k= x[ k] = 4 k= 4 5 for n = 8 h[ 8 k] = h[ 8 k]= y No overlap = Radar Systems Course 45 Review Signals, Systems & DSP // x[ k]= [ n] y[ n] Output of Convolution Sample Number
46 Summary- Linear Discrete Time Systems Any Linear and Time-Invariant (LTI) system can be completely described by its impulse response sequence δ[ n] H h[ n] The output of any LTI can be determined using the convolution summation y [ n] h[ k] x[ n k], < n < = = k The impulse response provides the basis for the analysis of an LTI system in the time-domain The frequency response function provides the basis for the analysis of an LTI system in the frequency-domain Radar Systems Course 46 Review Signals, Systems & DSP // Adapted from MIT LL Lecture Series by D. Manolakis
47 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems General properties A/D Conversion Sampling Theorem and Aliasing Convolution of Discrete Time Signals Fourier Properties of Signals Continuous vs. Discrete Periodic vs. Aperiodic Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 47 Review Signals, Systems & DSP //
48 Frequency Analysis of Signals Decomposition of signals into their frequency components A series of sinusoids of complex exponentials The general nature of signals Continuous or discrete Aperiodic or periodic Radar echoes, from each transmitted pulse, are continuous and aperiodic, and are usually transformed into discrete signals by an A/D converter before further processing Complex signals Radar Systems Course 48 Review Signals, Systems & DSP //
49 Time and Frequency Domains Analysis Fourier Transform Time History Frequency Spectrum Time Domain Frequency Domain Inverse Fourier Transform Synthesis Radar Systems Course 49 Review Signals, Systems & DSP //
50 Fourier Properties of Signals Continuous-Time Signals Periodic Signals: Fourier Series Aperiodic Signals: Fourier Transform Discrete-Time Signals Periodic Signals: Fourier Series Aperiodic Signals: Fourier Transform Radar Systems Course 5 Review Signals, Systems & DSP //
51 Fourier Transform for Continuous-Time Aperiodic Signals Time Domain Continuous and Aperiodic Signals Frequency Domain Continuous and Aperiodic Signals x (t) X(F) X(F) t π = x(t) e j F t dt x(t) j π F t = X(F) e df F Adapted from Manolakis et al, Reference Radar Systems Course 5 Review Signals, Systems & DSP //
52 Fourier Properties of Signals Continuous-Time Signals Periodic Signals: Fourier Series Aperiodic Signals: Fourier Transform Discrete-Time Signals Periodic Signals: Fourier Series Aperiodic Signals: Fourier Transform Radar Systems Course 5 Review Signals, Systems & DSP //
53 Fourier Transform for Discrete-Time Aperiodic Signals Time Domain Discrete and Aperiodic Signals x[ n] Frequency Domain Continuous and Periodic Signals X[ ω] n 4 4 π π π π ω X( ω) = n= j ω n [ ] e X n x π [ n] = π X( ω)e j ω n dω Adapted from Malolakis et al, Reference Radar Systems Course 5 Review Signals, Systems & DSP //
54 Summary of Time to Frequency Domain Properties Continuous- Time Signals Discrete- Time Signals Time-Domain x() t Frequency-Domain c k Time-Domain x[] n Frequency-Domain c k Periodic Signals Fourier Series T P = T jπkft ck x() t e dt TP P TP Continuous and Periodic x() t t xt () = ce k k= F = TP jπkf t Discrete and Aperiodic XF ( ) F N c k N N = xne [] N n= π j kn N n N xn [] N = k= ce k π j kn N Discrete and Periodic Discrete and Periodic x[] n X( ω) N k Aperiodic Signals Fourier Transforms t 4 F 4 n π π π π ω jωn X( ω= ) xne [ ] jπft X( F) = x( t) e dt x() t X( F) e j π = Ft df Continuous and Aperiodic Continous and Aperiodic Discrete and Aperiodic Continous and Periodic n= jωn x[] n = X() ωe dω π π Adapted from Proakis and Manolakis, Reference Radar Systems Course 54 Review Signals, Systems & DSP //
55 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems Discrete Fourier Transform (DFT) Calculation Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 55 Review Signals, Systems & DSP //
56 N [ ] = x [ n] X k X X R I n= N Direct DFT Computation [ k] = x [ n] cos k n + x [ n] n= N [ k] = x [ n] sin k n x [ n] n= R W R kn N π N π N k N I I sin cos Aka Twiddle Factor W kn N = e π k n N π k n N π j k n / N. N evaluations of trigonometric functions. 4N real ( N complex) multiplications. 4N(N ) real ( N(N ) complex) additions 4. A number of indexing and addressing operations N Complex MADS MADS Multiply And Divides Adapted from MIT LL Lecture Series by D. Manolakis Radar Systems Course 56 Review Signals, Systems & DSP //
57 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 57 Review Signals, Systems & DSP //
58 Fast Fourier Transform (FFT) An algorithm for each efficiently computing the Discrete Fourier Transform (DFT) and its inverse DFT O ( N ) MADS (Multiplies and Divides) FFT N O log N MADS FFT algorithm Development - Cooley / Tukey (965) Gauss (85) Many variations and efficiencies of the FFT algorithm exist Decimation in Time (input - bit reversed, output - natural order) Decimation in Frequency (input - natural order, output - bit reversed) The FFT calculation is broken down into a number of sequential stages, each stage consisting of a number of relatively small calculations called Butterflies Radar Systems Course 58 Review Signals, Systems & DSP //
59 Radix Decimation in Time FFT Algorithm N N π j N kn kn j k n / N [ ] [ ] k n / π x n e = x [ n] W k N W = e X k = n= n= N N Divide DFT of size N into two interleaved DFTs, each of size N/ Example will be N = = 8 Input to each DFT are even and odd x[ n] s, respectively Solve each stage recursively, until the size of the stage s DFT is. N nk nk [ ] = x[ n] W = x[ n] W + x[ n] X k = n= N l= g Radar Systems Course 59 Review Signals, Systems & DSP // N n N Even N n Odd N N lk (l+ )k lk k lk [] l W + h[] l W = g[] l W + W h[] l W N N N / N N / l= l= l= Even index and odd index terms of x [ n] N/ point DFT of h [ l] = H[ k] W nk N N/ point DFT of g [ l] = G[ k]
60 Radix Decimation in Time FFT Algorithm (continued) nk [ ] = G[ k] + W H[ k] X k Using the periodicity of the complex exponentials: N N G[ k] = G k + H[ k] = H k + And the following properties of the twiddle factors : W k+ (N / ) N then W = W k N k+ (N / ) N W H N / N A block diagram of this computational flow is graphically illustrated in the next chart for an 8 point FFT N = W k N k ( k + ( N / ) ) = W H(k) N Radar Systems Course 6 Review Signals, Systems & DSP //
61 8 Point Decimation in Time FFT Algorithm (After First Decimation) x[] x[] x[] 4 x[] 6 x[] x[] x[] 5 x[] 7 4 Point DFT 4 Point DFT G[ ] G[ ] G[ ] G[ ] H[ ] H[ ] H[ ] H[ ] X[ ] W 8 X [ ] W 8 X[ ] W 8 W 8 4 W 8 5 W 8 6 W 8 7 W 8 [ ] X [ ] X 4 [ ] [ ] X 5 X 6 [ ] X 7 Radar Systems Course 6 Review Signals, Systems & DSP //
62 Decimation of 4 Point into two point DFTs If N/ is even, n and h n may again be decimated G N This leads to: N N nk nk nk [ k] = g[ n] W = g[ n] W + g[ n] W G n= g [ ] [ ] N N / n Even N / N n Odd N / 4 nk k nk [ k] = g[ n] W + W g [ n + ] W n= N / 4 N / n= N / 4 x[] x[] x[] 4 x[] 6 Point DFT Point DFT W 4 W 4 W 4 W 4 [ ] G [ ] G [ ] G [ ] G Radar Systems Course 6 Review Signals, Systems & DSP //
63 Butterfly for Point DFT q[ k] q[] [ ] = q[ ] q[ ] Q + q [] Q[ ] = q[ ] q[ ] Q[ k] Now, Putting it all together.. Radar Systems Course 6 Review Signals, Systems & DSP //
64 x[] x[] 4 x[] x[] 6 x[] x[] 5 x[] x[] 7 Flow of 8-Point FFT (Radix - Decimation in Time Algorithm) W 8 W 8 W 8 W 8 W 8 W 8 W 8 W 8 W 8 W 8 W 8 W 8 X[ ] X[ ] X[ ] X[ ] X[ 4] X[ 5] X[ 6] X[ 7] Radar Systems Course 64 Review Signals, Systems & DSP //
65 Basic FFT Computation Flow Graph a Butterfly A = a + W r N b k n π W N = e r = k n j k n/ N Check over Each Butterfly takes MADS (Multiplies and Adds) Twiddle Factors (For 8 point FFT) π j / 8 π j / 4 W = e = W = e = e = j / W 8 8 b = e π r W N j / = j W 8 ( j) / ( ) Butterflies implies MADS vs. 64 MADS for 8 point DFT 5 point FFT more than times faster than 5 DFT 8 = B e = a W π j / 4 = r N Twiddle Factor b Radar Systems Course 65 Review Signals, Systems & DSP //
66 Computational Speed DFT vs. FFT Number of Complex Multiplications DFT FFT Number of points in Radix FFT 4 Lines Drawn Through Data Points Discrete Fourier Transform (O ~ N ) Fast Fourier Transform (O ~ N log N) Radar Systems Course 66 Review Signals, Systems & DSP // Adapted from Lyons, Reference
67 Fast Fourier Transform (FFT) - Summary Fast Fourier Transform (FFT) algorithms make possible the computation of DFT with O ((N/) log N) MADS as opposed to O N MADS Many other implementations of the FFT exist: Radix decimation in frequency algorithm Radar-Brenner algorithm Bluestein s algorithm Prime Factor algorithm The details of FFT algorithms are important to the designers of real-time DSP systems in software or hardware An interesting history of FFT algorithms Heideman, Johnson, and Burrus, Gauss and the History of FFT, IEEE ASSP Magazine, Vol., No. 4, pp. 4-, October 984 Radar Systems Course 67 Review Signals, Systems & DSP //
68 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 68 Review Signals, Systems & DSP //
69 Finite and Infinite Response Filters Infinite Impulse Response (IIR) Filters Output of filter depends on past time history Example : M y[ n] = x[ n] + y[ n ] M M ( ) Finite Impulse Response (FIR) Filters Output depends on the finite past Example: DFT N π j k n / N [ ] x [ n] e X k = n= Radar Systems Course 69 Review Signals, Systems & DSP // Other examples: or y y N [ k] a[ k,n] x [ n] x[ ] = n= [ n] = x[ n,] x[ n,]
70 Four Basic Filter Types- An Idealization Ideal Low Pass Filter ( jw H e ) Ideal High Pass Filter ( jw H e ) π ω c ωc π ω π ωc ωc π ω Ideal Bandpass Filter ( jw H e ) Ideal Bandstop Filter ( jw H e ) π ω ω ω ω π ω π ω ω ω ω π ω Radar Systems Course 7 Review Signals, Systems & DSP //
71 Outline Continuous Signals and Systems Sampled Data and Discrete Time Systems Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) Filters Weighting of Filters Radar Systems Course 7 Review Signals, Systems & DSP //
72 Windowing / Weighting of Filters If we take a square pulse, sample it M times, and calculate the Fourier transform of this uniform rectangular window : W W M j ω M ( ) ( ) ( ω ) ω = j ω n e j M / sin M / e = = e j ω n= e sin( ω/ ) sin( ωm / ) ( ω) = π ω π sin( ω/ ) This is recognized as the sinc function which has db sidelobes If lower sidelobes are needed, at the cost of a widened pass band, one can multiply the elements of the pulse sequence with one of a number of weighting functions, which will adjust the sidelobes appropriately Radar Systems Course 7 Review Signals, Systems & DSP //
73 Commonly Used Window Functions Rectangular w[ n] =, n M, otherwise Bartlett (triangular) Hanning Hamming Blackman w[ n]= [ ] = w n w[ n] = w[ n] = n / M, n / M, otherwise otherwise n M / M / < n M ( π n / M).5.5 cos, n M, otherwise ( π n / M).54.46cos, n M, ( π n / M) +.8 cos ( 4 π n / ).4.5cos M, n, otherwise M Radar Systems Course 7 Review Signals, Systems & DSP //
74 Comparison of Common Windows Type of Window Rectangular Bartlett (triangular) Hanning Hamming Blackman Peak Sidelobe Amplitude (db) Approximate Width of Main Lobe ( M ) 4 π / + 8π / M 8π / M 8π / M π / M Radar Systems Course 74 Review Signals, Systems & DSP //
75 Comparison of Rectangular & Hamming Windows Rectangular Hamming log W(ω Normalized frequency (f = F/F s ) Radar Systems Course 75 Review Signals, Systems & DSP //
76 Summary A brief review of the prerequisite Signal & Systems, and Digital Signal Processing knowledge base for this radar course has been presented Viewers requiring a more in depth exposition of this material should consult the references at the end of the lecture The topics discussed were: Continuous signals and systems Sampled data and discrete time systems Discrete Fourier Transform (DFT) Fast Fourier Transform (FFT) Finite Impulse Response (FIR) filters Weighting of filters Radar Systems Course 76 Review Signals, Systems & DSP //
77 References. Proakis, J, G. and Manolakis, D. G., Digital Signal Processing, Principles, Algorithms, and Applications, Prentice Hall, Upper Saddle River, NJ, 4 th Ed., 7. Lyons, R. G., Understanding Digital Signal Processing, Prentice Hall, Upper Saddle River, NJ, nd Ed., 4. Hsu, H. P., Signals and Systems, McGraw Hill, New York, Hayes, M. H., Digital Signal Processing, McGraw Hill, New York, Oppenheim, A. V. et al, Discrete Time Signal Processing, Prentice Hall, Upper Saddle River, NJ, nd Ed., Boulet, B., Fundamentals of Signals and Systems, Prentice Hall, Upper Saddle River, NJ, nd Ed., 7. Richards, M. A., Fundamentals of Radar Signal Processing, McGraw Hill, New York, 5 8. Skolnik, M., Radar Handbook, McGraw Hill, New York, nd Ed., Skolnik, M., Introduction to Radar Systems, McGraw Hill, New York, rd Ed., Radar Systems Course 77 Review Signals, Systems & DSP //
78 Acknowledgements Dr Dimitris Manolakis Dr. Stephen C. Pohlig Dr William S. Song Radar Systems Course 78 Review Signals, Systems & DSP //
79 Homework Problems From Proakis and Manolakis, Reference Problems.,.7, 4.9a and b, 4. a and b, 6., 6.9 a and b, 8. and 8.8 Or And from Hays, Reference 4 Problems.4,.49,.54,.59,.46,.57,.58,.7,.8,.4, 6.44, 6.45 Radar Systems Course 79 Review Signals, Systems & DSP //
Chapter 2: The Fourier Transform
EEE, EEE Part A : Digital Signal Processing Chapter Chapter : he Fourier ransform he Fourier ransform. Introduction he sampled Fourier transform of a periodic, discrete-time signal is nown as the discrete
More informationCorrelator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi
Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.
More informationReview 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 informationCourse Name: Digital Signal Processing Course Code: EE 605A Credit: 3
Course Name: Digital Signal Processing Course Code: EE 605A Credit: 3 Prerequisites: Sl. No. Subject Description Level of Study 01 Mathematics Fourier Transform, Laplace Transform 1 st Sem, 2 nd Sem 02
More informationELEN 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 informationL6: 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 informationThe 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 informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationDFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.
SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING UNIT I DFT & Fast Fourier
More informationIT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING IT6502 - DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A 1. What is a continuous and discrete time signal? Continuous
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationDiscrete 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 informationQuestion Bank. UNIT 1 Part-A
FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY Senkottai Village, Madurai Sivagangai Main Road, Madurai -625 020 An ISO 9001:2008 Certified Institution Question Bank DEPARTMENT OF ELECTRONICS AND COMMUNICATION
More informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More informationMultimedia 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 informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More informationSound & Vibration Magazine March, Fundamentals of the Discrete Fourier Transform
Fundamentals of the Discrete Fourier Transform Mark H. Richardson Hewlett Packard Corporation Santa Clara, California The Fourier transform is a mathematical procedure that was discovered by a French mathematician
More informationSignals, 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 informationE : 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 informationENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University
ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function
More informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationLecture 7 Discrete Systems
Lecture 7 Discrete Systems EE 52: Instrumentation and Measurements Lecture Notes Update on November, 29 Aly El-Osery, Electrical Engineering Dept., New Mexico Tech 7. Contents The z-transform 2 Linear
More informationLAB 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(Refer Slide Time: 01:28 03:51 min)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture 40 FIR Design by Windowing This is the 40 th lecture and our topic for
More informationINTRODUCTION TO DELTA-SIGMA ADCS
ECE37 Advanced Analog Circuits INTRODUCTION TO DELTA-SIGMA ADCS Richard Schreier richard.schreier@analog.com NLCOTD: Level Translator VDD > VDD2, e.g. 3-V logic? -V logic VDD < VDD2, e.g. -V logic? 3-V
More informationDigital 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 informationSEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis
SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Pro. Mark Fowler Note Set #14 Practical A-to-D Converters and D-to-A Converters Reading Assignment: Sect. 6.3 o Proakis & Manolakis 1/19 The irst step was to see that
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationDiscrete-Time Signals and Systems. Efficient Computation of the DFT: FFT Algorithms. Analog-to-Digital Conversion. Sampling Process.
iscrete-time Signals and Systems Efficient Computation of the FT: FFT Algorithms r. eepa Kundur University of Toronto Reference: Sections 6.1, 6., 6.4, 6.5 of John G. Proakis and imitris G. Manolakis,
More informationIntroduction to Digital Signal Processing
Introduction to Digital Signal Processing 1.1 What is DSP? DSP is a technique of performing the mathematical operations on the signals in digital domain. As real time signals are analog in nature we need
More informationChapter 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 informationUNIVERSITY 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 information1. Calculation of the DFT
ELE E4810: Digital Signal Processing Topic 10: The Fast Fourier Transform 1. Calculation of the DFT. The Fast Fourier Transform algorithm 3. Short-Time Fourier Transform 1 1. Calculation of the DFT! Filter
More informationDIGITAL SIGNAL PROCESSING LECTURE 1
DIGITAL SIGNAL PROCESSING LECTURE 1 Fall 2010 2K8-5 th Semester Tahir Muhammad tmuhammad_07@yahoo.com Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000
More information! 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 informationE2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)
E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,
More informationFrequency-domain representation of discrete-time signals
4 Frequency-domain representation of discrete-time signals So far we have been looing at signals as a function of time or an index in time. Just lie continuous-time signals, we can view a time signal as
More informationChapter 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 informationRepresenting a Signal
The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the
More informationChapter 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 informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More informationLecture 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 informationTheory and Problems of Signals and Systems
SCHAUM'S OUTLINES OF Theory and Problems of Signals and Systems HWEI P. HSU is Professor of Electrical Engineering at Fairleigh Dickinson University. He received his B.S. from National Taiwan University
More informationFilter 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 informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 1 Time-Dependent FT Announcements! Midterm: 2/22/216 Open everything... but cheat sheet recommended instead 1am-12pm How s the lab going? Frequency Analysis with
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More informationHomework 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 informationDown-Sampling (4B) Young Won Lim 11/15/12
Down-Sampling (B) /5/ Copyright (c) 9,, Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version. or any later
More informationAPPENDIX A. The Fourier integral theorem
APPENDIX A The Fourier integral theorem In equation (1.7) of Section 1.3 we gave a description of a signal defined on an infinite range in the form of a double integral, with no explanation as to how that
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationSIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Digital Signal Processing(16EC422) Year & Sem: III-B.Tech & II-Sem Course
More informationω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the
he ime-frequency Concept []. Review of Fourier Series Consider the following set of time functions {3A sin t, A sin t}. We can represent these functions in different ways by plotting the amplitude versus
More informationVel Tech High Tech Dr.Ranagarajan Dr.Sakunthala Engineering College Department of ECE
Subject Code: EC6502 Course Code:C302 Course Name: PRINCIPLES OF DIGITAL SIGNAL PROCESSING L-3 : T-1 : P-0 : Credits 4 COURSE OBJECTIVES: 1. To learn discrete Fourier transform and its properties 2. To
More informationDiscrete 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 informationUp-Sampling (5B) Young Won Lim 11/15/12
Up-Sampling (5B) Copyright (c) 9,, Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version. or any later version
More informationCast 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 informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationDIGITAL SIGNAL PROCESSING
IT 1252 DIGITAL SIGNAL PROCESSING 1. Define Discrete time signal. A discrete time signal x (n) is a function of an independent variable that is an integer.a discrete time signal is not defined at instant
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationEE 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 informationQuestion Paper Code : AEC11T02
Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)
More informationTutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling
2.39 utorial Sheet #2 discrete vs. continuous functions, periodicity, sampling We will encounter two classes of signals in this class, continuous-signals and discrete-signals. he distinct mathematical
More informationSIGNAL PROCESSING. B14 Option 4 lectures. Stephen Roberts
SIGNAL PROCESSING B14 Option 4 lectures Stephen Roberts Recommended texts Lynn. An introduction to the analysis and processing of signals. Macmillan. Oppenhein & Shafer. Digital signal processing. Prentice
More informationUNIT 1. SIGNALS AND SYSTEM
Page no: 1 UNIT 1. SIGNALS AND SYSTEM INTRODUCTION A SIGNAL is defined as any physical quantity that changes with time, distance, speed, position, pressure, temperature or some other quantity. A SIGNAL
More informationPART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.
PART 1 Review of DSP Mauricio Sacchi University of Alberta, Edmonton, AB, Canada The Fourier Transform F() = f (t) = 1 2π f (t)e it dt F()e it d Fourier Transform Inverse Transform f (t) F () Part 1 Review
More informationDigital Signal Processing
DIGITAL SIGNAL PROCESSING SUBJECT CODE : NO. OF LECTURE HRS/WEEK : 04 TOTAL NO. OF LECTURE HRS. : 52 IA MARKS : 25 EXAM HOURS : 03 EXAMMARKS : 100 UNIT - 1 DISCRETE FOURIER TRANSFORMS (DFT): FREQUENCY
More information! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform. " Aka short-time Fourier transform
Lecture Outline ESE 531: Digital Signal Processing Spectral Analysis with DFT Windowing Lec 24: April 18, 2019 Spectral Analysis Effect of zero-padding Time-dependent Fourier transform " Aka short-time
More informationFourier Series Representation of
Fourier Series Representation of Periodic Signals Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline The response of LIT system
More informationLecture Schedule: Week Date Lecture Title
http://elec34.org Sampling and CONVOLUTION 24 School of Information Technology and Electrical Engineering at The University of Queensland Lecture Schedule: Week Date Lecture Title 2-Mar Introduction 3-Mar
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationVU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/17s/
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
More informationNovel Waveform Design and Scheduling For High-Resolution Radar and Interleaving
Novel Waveform Design and Scheduling For High-Resolution Radar and Interleaving Phase Phase Basic Signal Processing for Radar 101 x = α 1 s[n D 1 ] + α 2 s[n D 2 ] +... s signal h = filter if h = s * "matched
More informationEE 435. Lecture 32. Spectral Performance Windowing
EE 435 Lecture 32 Spectral Performance Windowing . Review from last lecture. Distortion Analysis T 0 T S THEOREM?: If N P is an integer and x(t) is band limited to f MAX, then 2 Am Χ mnp 1 0 m h N and
More informationExperimental Fourier Transforms
Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationDistortion Analysis T
EE 435 Lecture 32 Spectral Performance Windowing Spectral Performance of Data Converters - Time Quantization - Amplitude Quantization Quantization Noise . Review from last lecture. Distortion Analysis
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More informationECE4270 Fundamentals of DSP Lecture 20. Fixed-Point Arithmetic in FIR and IIR Filters (part I) Overview of Lecture. Overflow. FIR Digital Filter
ECE4270 Fundamentals of DSP Lecture 20 Fixed-Point Arithmetic in FIR and IIR Filters (part I) School of ECE Center for Signal and Information Processing Georgia Institute of Technology Overview of Lecture
More informationAnalog to Digital Converters (ADCs)
Analog to Digital Converters (ADCs) Note: Figures are copyrighted Proakis & Manolakis, Digital Signal Processing, 4 th Edition, Pearson Publishers. Embedded System Design A Unified HW Approach, Vahid/Givargis,
More informationSistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2015/16 Aula 6-26 de Outubro
Sistemas de Aquisição de Dados Mestrado Integrado em Eng. Física Tecnológica 2015/16 Aula 6-26 de Outubro Flash Decoder Thermometer code Wired NOR based decoder 2 Successive Approximation ADC (SAR) CONVERT
More informationSignals & 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 informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More informationChapter 1 Fundamental Concepts
Chapter 1 Fundamental Concepts Signals A signal is a pattern of variation of a physical quantity as a function of time, space, distance, position, temperature, pressure, etc. These quantities are usually
More informationA523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011
A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided
More informationSignal Processing Signal and System Classifications. Chapter 13
Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationSinc 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 informationL29: Fourier analysis
L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis
More informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
More informationContinuous 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 informationDISCRETE-TIME SIGNAL PROCESSING
THIRD EDITION DISCRETE-TIME SIGNAL PROCESSING ALAN V. OPPENHEIM MASSACHUSETTS INSTITUTE OF TECHNOLOGY RONALD W. SCHÄFER HEWLETT-PACKARD LABORATORIES Upper Saddle River Boston Columbus San Francisco New
More informationSampling and Discrete Time. Discrete-Time Signal Description. Sinusoids. Sampling and Discrete Time. Sinusoids An Aperiodic Sinusoid.
Sampling and Discrete Time Discrete-Time Signal Description Sampling is the acquisition of the values of a continuous-time signal at discrete points in time. x t discrete-time signal. ( ) is a continuous-time
More informationR13 SET - 1
R13 SET - 1 III B. Tech II Semester Regular Examinations, April - 2016 DIGITAL SIGNAL PROCESSING (Electronics and Communication Engineering) Time: 3 hours Maximum Marks: 70 Note: 1. Question Paper consists
More informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/
More information