Overview. Signals as functions (1D, 2D) 1D Fourier Transform. 2D Fourier Transforms. Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT)
|
|
- Jacob Elliott
- 5 years ago
- Views:
Transcription
1 Fourier Transform
2 Overview Signals as functions (1D, 2D) Tools 1D Fourier Transform Summary of definition and properties in the different cases CTFT, CTFS, DTFS, DTFT DFT 2D Fourier Transforms Generalities and intuition Examples A bit of theory Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT)
3 Signals as functions 1. Continuous functions of real independent variables 1D: f=f(x) 2D: f=f(x,y) x,y Real world signals (audio, ECG, images) 2. Real valued functions of discrete variables 1D: f=f[k] 2D: f=f[i,j] Sampled signals 3. Discrete functions of discrete variables 1D: y=y[k] 2D: y=y[i,j] Sampled and quantized signals For ease of notations, we will use the same notations for 2 and 3
4 Images as functions Gray scale images: 2D functions Domain of the functions: set of (x,y) values for which f(x,y) is defined : 2D lattice [i,j] defining the pixel locations Set of values taken by the function : gray levels Digital images can be seen as functions defined over a discrete domain {i,j: 0<i<I, 0<j<J} I,J: number of rows (columns) of the matrix corresponding to the image f=f[i,j]: gray level in position [i,j]
5 Example 1: δ function [ ] = = = j i j i j i j i 0;, 0 0 1, δ [ ] = = = otherwise J j i J j i 0 0; 1, δ
6 Example 2: Gaussian Continuous function f x + y 1 2 2σ (, ) x y = σ e 2π 2 2 Discrete version f i + j 1 2 2σ [ i, j] = e σ 2π 2 2
7 Example 3: Natural image
8 Example 3: Natural image
9 Fourier Transform Different formulations for the different classes of signals Summary table: Fourier transforms with various combinations of continuous/discrete time and frequency variables. Notations: CTFT: continuous time FT: t is real and f real (f=ω) (CT, CF) DTFT: Discrete Time FT: t is discrete (t=n), f is real (f=ω) (DT, CF) CTFS: CT Fourier Series (summation synthesis): t is real AND the function is periodic, f is discrete (f=k), (CT, DF) DTFS: DT Fourier Series (summation synthesis): t=n AND the function is periodic, f discrete (f=k), (DT, DF) P: periodical signals T: sampling period ω s : sampling frequency (ω s =2π/T) For DTFT: T=1 ω s =2π
10 Continuous Time Fourier Transform (CTFT) Time is a real variable (t) Frequency is a real variable (ω)
11 CTFT: Concept A signal can be represented as a weighted sum of sinusoids. Fourier Transform is a change of basis, where the basis functions consist of sins and cosines (complex exponentials). [Gonzalez Chapter 4]
12 Continuous Time Fourier Transform (CTFT) T=1
13 Fourier Transform Cosine/sine signals are easy to define and interpret. However, it turns out that the analysis and manipulation of sinusoidal signals is greatly simplified by dealing with related signals called complex exponential signals. A complex number has real and imaginary parts: z = x+j y A complex exponential signal: ( α α ) jα re = r cos + jsin
14 CTFT Continuous Time Fourier Transform Continuous time a-periodic signal Both time (space) and frequency are continuous variables NON normalized frequency ω is used Fourier integral can be regarded as a Fourier series with fundamental frequency approaching zero Fourier spectra are continuous A signal is represented as a sum of sinusoids (or exponentials) of all frequencies over a continuous frequency interval Fourier integral ( ω) = () jωt F f t e dt t 1 jωt f() t = F( ω) e dω 2π ω analysis synthesis
15 Then CTFT becomes Fourier Transform of a 1D continuous signal j2πux F( u) f ( xe ) dx = Euler s formula ( π ) ( π ) j2πux e = cos 2 ux jsin 2 ux Inverse Fourier Transform 2 f( x) F( u) e j πux du =
16 CTFT: change of notations Fourier Transform of a 1D continuous signal Euler s formula jωx F( ω) = f( x) e dx Inverse Fourier Transform 1 jωx f( x) = F( ω) e dω 2π ( ω ) sin ( ω ) jωx e = cos x j x Change of notations: ω 2π u ωx 2π u ω y 2π v
17 CTFT Replacing the variables j2πux F(2 πu) F( u) f( x) e dx More compact notations = = = 1 j2πux j2πux ( π ) f( x) = F( u) e d 2 u = F( u) e du 2π j2πux Fu ( ) = f( xe ) dx j2πux f x = F( u) e du ( )
18 Sinusoids Frequency domain characterization of signals + jωt F( ω) = f( te ) dt Signal domain Frequency domain (spectrum, absolute value of the transform)
19 Time domain Gaussian Frequency domain
20 rect Time domain Frequency domain sinc function
21 Example
22 Example
23 Discrete Fourier Transform (DFT) The easiest way to get to it Time is a discrete variable (t=n) Frequency is a discrete variable (f=k)
24 DFT The DFT can be considered as a generalization of the CTFT to discrete series N 1 1 j 2 π kn / N Fk [ ] = f[ ne ] N n= 0 N 1 f[ n] = F[ k] e k = 0 n= 0,1,, N 1 k = 0,1,, N 1 In order to calculate the DFT we start with k=0, calculate F(0) as in the formula below, then we change to u=1 etc F[0] is the average value of the function f[n] 0 This is also the case for the CTFT j2 π kn/ N N 1 N 1 1 j2π 0 n/ N 1 F[0] = f[ ne ] = f[ n] = f N N n= 0 n= 0
25 Example 1 amplitude 0 time F[k] F[0] low-pass characteristic frequency
26 Example 2 amplitude 0 time F[k] F[0]=0 band-pass (or high-pass) characteristic -M 0 M frequency
27 DFT About M 2 multiplications are needed to calculate the DFT The transform F[k] has the same number of components of f[n], that is N The DFT always exists for signals that do not go to infinity at any point Using the Eulero s formula N 1 N 1 1 j2 π kn/ N 1 F[ k] = f[ ne ] = f[ n] cos j2 kn/ N jsin j2 kn/ N N N n= 0 n= 0 ( ( π ) ( π )) frequency component k discrete trigonometric functions
28 Intuition The FT decomposed the signal over its harmonic components and thus represents it as a sum of linearly independent complex exponential functions Thus, it can be interpreted as a mathematical prism
29 DFT is a complex number F[k] in general are complex numbers [ ] = Re{ [ ]} + Im{ [ ]} [ ] = [ ] exp{ [ ]} F k F k j F k F k F k j F k F k F k F k [ ] = Re{ [ ]} + Im{ [ ]} Im{ F[ k 1 ]} F[ k] = tan Re{ F[ k] } [ ] = Fk [ ] Pk magnitude or spectrum phase or angle power spectrum
30 Example
31 Let s take a bit more advanced perspective Book: Lathi, Signal Processing and Linear Systems
32 Overview Transform Time Frequency Analysis/Synthesis Duality (Continuous Time) Fourier Transform (CTFT) (Continuous Time) Fourier Series (CTFS) Discrete Time Fourier Transform (DTFT) C C jωt F ω = f t e dt Self-dual C P D D C P ( ) () t 1 jωt f () t = F( ω) e dω 2π ω T /2 1 j2 π kt/ T Fk [ ] = f ( te ) dt T T /2 f() t = F[ k] e k + 2π j2 π kt/ T F( Ω ) = f[ k] e k = jωk 1 jωk f [ k] = F( Ω) e dω 2π Dual with DTFT Dual with CTFS Discrete Time Fourier Series (DTFS) D P D P N 1 1 Fk [ ] = f[ ne ] N n= 0 N 1 f[ n] = F[ k] e n= 0 j2 π kn / T j2 π kn/ T Self dual
33 Linking continuous and discrete domains amplitude amplitude f k =f(kt s ) T s t n DT signals can be seen as sampled versions of CT signals Both CT and DT signals can be of finite duration or periodic There is a duality between periodicity and discretization Periodic signals have discrete frequency (DF) transform (f=k) CTFS Discrete time signals have periodic transform DTFT DT periodic signals have DF periodic transforms DTFS, DFT
34 Dualities SIGNAL DOMAIN FOURIER DOMAIN Sampling DTFT Periodicity Periodicity CTFS Sampling Sampling+Periodicity DTFS/DFT Sampling +Periodicity
35 Sequences of samples f[k]: sample values Assumes a unitary spacing among samples (T s =1) Normalized frequency Ω Transform DTFT for NON periodic sequences CTFS for periodic sequences DFT for periodized sequences All transforms are 2π periodic 2π Ω s = ωsts = Ts = 2π T Discrete time signals s Ω = ωt s Sampled signals f(kt s ): sample values The sampling interval (or period) is T s Non normalized frequency ω Transform DTFT CSTF DFT BUT accounting for the fact that the sequence values have been generated by sampling a real signal f k =f(kt s ) All transforms are periodic with period ω s 2π ω = s T s
36 Connection DTFT-CTFT sampling periodization Fc(ω) f(t) t 0 _ Fc(ω) ω f(kt s ) f[k] 0Ts 4Ts t 0 F(Ω) 2π/Ts ω k 0 2π Ω
37 CTFS Continuous Time Fourier Series Continuous time periodic signals The signal is periodic with period T The transform is sampled (it is a series) amplitude T t T /2 1 j2 π kt/ T F k = f te dt [ ] ( ) T T /2 f() t = F[ k] e k j2 π kt/ T coefficients of the Fourier series periodic signal
38 CTFS Representation of a continuous time signal as a sum of orthogonal components in a complete orthogonal signal space The exponentials are the basis functions Properties even symmetry only cosinusoidal components odd symmetry only sinusoidal components
39 DTFT Discrete Time Fourier Transform Discrete time a-periodic signal The transform is periodic and continuous with period non normalized frequency ω = s 2π T s n ( ω) F = f ne = f ne j2 πωn/ ωs jωnt [ ] [ ] n n ωs /2 π / T j πωn ω π jωnt s 1 jωt 2 / 2 s jωt s f [ n] = F( e ) e dω F( e ) e dω ω = s T ωs /2 s π / Ts 2π 2πω 2πω ωs = = Ts = ωts T ω 2π s s s T s = 2 π / ω s sampling interval in time periodicity in frequency the closer the samples, the farther the replicas
40 DTFT with normalized frequency Normalized frequency: change of variables Ω = ωt s 2π Ω s = ωsts = Ts = Ts Ω = 2π s 2π normalized frequency periodicity in the normalized frequency domain + F( Ω ) = f[ k] e n= 1 jkω f [ n] = F( Ω) e dω 2π F ( ) 2π 1 Ω Ω = Fc T s T s jnω Relation to the CTFT If Ts>1, the DTFT can be seen as a stretched periodized version of the CTFT.
41 DTFT with normalized frequency F(Ω) can be _ obtained from F c (ω) by replacing ω with Ω /T s. Thus F(Ω) is identical to F(ω) frequency scaled and stratched by a factor 1/T s, where T s is the sampling interval in time domain Notations DTFT 1 Ω F( Ω ) = Fc T s T s 2π 2π ωs = Ts = T ω s s Ω ω = Ω = ωt T ( ω ) ( ω π ω ) F( Ω) F T = F 2 / s s s CTFT periodicity of the spectrum normalized frequency (the spectrum is 2π-periodic) s + + jωn j2 nπω/ ωs ( Ω ) = [ ] ( ω s ) = ( ω) = [ ] n= k= F f ne F T F f ne
42 DTFT with unitary frequency ( f ) Ω= 2π u ω = 2π jωn j2π nu F( Ω ) = f[ n] e F( u) = f[ n] e n= 1 2 jωn j2πnu j2πnu 1 f [ n] = F( Ω) e dω f[ n] = F( u) e du = F( u) e du 2π Fu ( ) = fke [ ] n= [ ] = ( ) 2π 1 j2π nu 1 2 j2π nu f n F u e du 1 2 n= 1 2 NOTE: when T s =1, Ω=ω and the spectrum is 2π-periodic. The unitary frequency u=2π/ Ω corresponds to the signal frequency f=2π/ω. This could give a better intuition of the transform properties.
43 Summary Sampled signals are sequences of sampels Looking at the sequence as to a set of samples obtained by sampling a real signal with sampling frequency ω s we can still use the formulas for calculating the transforms as derived for the sequences by Stratching the time axis (and thus squeezing the frequency axis if T s >1) normalized frequency (sample series) spectral periodicity in Ω Ω = ωt 2π ω = s s 2π T s frequency (sampled signal) spectral periodicity in ω Enclosing the sampling interval T s in the value of the sequence samples (DFT) f ( ) = Tf kt k s s
44 Connection DTFT-CTFT sampling periodization Fc(ω) f(t) t 0 _ Fc(ω) ω f(kt s ) f[k] 0Ts 4Ts t 0 F(Ω) 2π/Ts ω k 0 2π Ω
45 Differences DTFT-CTFT The DTFT is periodic with period Ω s =2π (or ω s =2π/T s ) The discrete-time exponential e jωn has a unique waveform only for values of Ω in a continuous interval of 2π Numerical computations can be conveniently performed with the Discrete Fourier Transform (DFT)
46 DTFS Discrete Time Fourier Series Discrete time periodic sequences of period N 0 Fundamental frequency Ω = 2 π /N 0 0 N0 1 1 Fk [ ] = f[ ne ] N N 0 k = 0 0 n= 0 1 jkn2 π / N f[ n] = F[ k] e jkn2 π / N 0 0
47 DTFS: Example N 0 =20 T s =1 Ω s =2π Ω 0 = π/10 [Lathi, pag 621]
48 Discrete Fourier Transform (DFT) N0 N0 j nk jnω0k N0 Fk [ ] = fe = fe n n= 0 n= 0 0 N0 N0 jn k jnω0k N0 The DFT transforms N 0 samples of a discrete-time signal to the same number of discrete frequency samples The DFT and IDFT are a self-contained, one-to-one transform pair for a length-n 0 discrete-time signal (that is, the DFT is not merely an approximation to the DTFT as discussed next) However, the DFT is very often used as a practical approximation to the DTFT 2π f[ n] = F[ k] e = F[ k] e N N Ω = 2π N 0 k= 0 0 k= 0 n 2π
49 DFT 0 N 0 n zero padding F(Ω) 0 2π 2π/N 0 4π k
50 zero padding DFT Increasing the number of zeros augments the resolution of the transform since the samples of the DFT gets closer 0 N 0 F(Ω) n 0 2π 2π/N 0 4π k
51 Properties For real signals f(t) ( ) fˆ ( ω) ( ) ˆ( ) ˆ ω = ( ω) f t f t f f Proof + + jωt jωt' { f ( t) } f ( t) e dt f ( t' ) e dt' fˆ ( ω) I = = =
52 Discrete Cosine Transform (DCT) Operate on finite discrete sequences (as DFT) A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies DCT is a Fourier-related transform similar to the DFT but using only real numbers DCT is equivalent to DFT of roughly twice the length, operating on real data with even symmetry (since the Fourier transform of a real and even function is real and even), where in some variants the input and/or output data are shifted by half a sample There are eight standard DCT variants, out of which four are common Strong connection with the Karunen-Loeven transform VERY important for signal compression
53 DCT DCT implies different boundary conditions than the DFT or other related transforms A DCT, like a cosine transform, implies an even periodic extension of the original function Tricky part First, one has to specify whether the function is even or odd at both the left and right boundaries of the domain Second, one has to specify around what point the function is even or odd In particular, consider a sequence abcd of four equally spaced data points, and say that we specify an even left boundary. There are two sensible possibilities: either the data is even about the sample a, in which case the even extension is dcbabcd, or the data is even about the point halfway between a and the previous point, in which case the even extension is dcbaabcd (a is repeated).
54 Symmetries
55 DCT N0 1 π 1 Xk = xn cos n+ k k 0,..., N0 1 n 0 N0 2 = = N π k 1 xn = X0 + Xk cos k N0 2 + k = 0 N0 2 Warning: the normalization factor in front of these transform definitions is merely a convention and differs between treatments. Some authors multiply the transforms by (2/N 0 ) 1/2 so that the inverse does not require any additional multiplicative factor. Combined with appropriate factors of 2 (see above), this can be used to make the transform matrix orthogonal.
56 Images vs Signals 1D 2D Signals Frequency Temporal Spatial Time (space) frequency characterization of signals Reference space for Filtering Changing the sampling rate Signal analysis. Images Frequency Spatial Space/frequency characterization of 2D signals Reference space for Filtering Up/Down sampling Image analysis Feature extraction Compression.
57 2D spatial frequencies 2D spatial frequencies characterize the image spatial changes in the horizontal (x) and vertical (y) directions Smooth variations -> low frequencies Sharp variations -> high frequencies y ω x =1 ω y =0 ω x =0 ω y =1 x
58 Large vertical frequencies correspond to horizontal lines 2D Frequency domain ω y Large horizontal and vertical frequencies correspond sharp grayscale changes in both directions Small horizontal and vertical frequencies correspond smooth grayscale changes in both directions ω x Large horizontal frequencies correspond to vertical lines
59 Vertical grating ω y 0 ω x
60 Double grating ω y 0 ω x
61 Smooth rings ω y ω x
62 2D box 2D sinc
63 Margherita Hack log amplitude of the spectrum
64 Einstein log amplitude of the spectrum
65 What we are going to analyze 2D Fourier Transform of continuous signals (2D-CTFT) 1D + + ( ) ( ) j ω t jωt F ω = f te dt, f ( t) = F( ω) e dt 2D Fourier Transform of discrete space signals (2D-DTFT) 1D jωk 1 jωk F( Ω ) = f[ ke ], f [ k] = F( Ω) e dt 2π k = 2π 2D Discrete Fourier Transform (2D-DFT) 1D N 1 N 1 1 2π F = f k e f k = Fe Ω = 0 0 jrω0k jrω0k [], [], 0 r N r 0 k= 0 N0 r= 0 N0
66 2D Continuous Fourier Transform Continuous case (x and y are real) 2D-CTFT (notation 1) ( ωx ωy) = ( ) j ˆ ( ωxx+ ωyy) f, f x, y e dxdy 1 j( ω ) ( ) ˆ xx+ ωyy f xy, = f 2 (, ) e d d 4 π + + ω ω ω ω x y x y * 1 * f ( xyg, ) ( xydxdy, ) = fˆ 2 ( ωx, ωy) gˆ ( ωx, ωy) dωxdωy 4π f = g f ( x, y) dxdy fˆ = 2 ( ωx, ωy) dωxdωy 4π Parseval formula Plancherel equality
67 2D Continuous Fourier Transform Continuous case (x and y are real) 2D-CTFT ωx = 2π u ω = 2πv y + j2π ( ux+ vy) f u v f x y e dxdy ( ) = ( ) ˆ,, + 1 ˆ j2π,, 2 2 4π ( ) ( ) ( ux+ vy ) ( π ) f x y = f u v e dudv = = + 1 ˆ j2π 2 f ( u, v) e 2 4π ( ux+ vy ) ( π ) 2 2 dudv
68 2D Continuous Fourier Transform 2D Continuous Fourier Transform (notation 2) + j2π ( ux+ vy) f u v f x y e dxdy ( ) = ( ) ˆ,, + j2π ( ux+ vy) f x y f u v e dudv (, ) ˆ (, ) = = 2 ˆ f ( x, y) dxdy = f ( u, v) dudv Plancherel s equality 2
69 2D Discrete Fourier Transform The independent variable (t,x,y) is discrete F r 0 = N 1 0 k = 0 0 f[ k] e N0 1 1 fn [ k] = Fe 0 r N Ω = 2π N 0 jrω k r = 0 0 jrω k N Fuv [, ] = f[ ike, ] i= 0 k= u= 0 v= 0 jω ( ui+ vk) N0 1N0 1 1 fn [, i k] = F[ u, v] e 0 N Ω = 2π N N 0 jω ( ui+ vk ) 0 [Lathi s notations]
70 Delta Sampling property of the 2D-delta function (Dirac s delta) Transform of the delta function δ ( x x, y y ) f( x, y) dxdy = f( x, y ) j2 π ( ux+ vy) { δ } δ F ( x, y) = ( x, y) e dxdy = 1 j2 π ( ux+ vy) j π ux0+ vy0 { δ(, )} = δ(, ) = F x x y y x x y y e dxdy e ( ) shifting property
71 Constant functions Inverse transform of the impulse function 1 j2 π( ux+ vy) j2 π(0x+ v0) { δ } F ( u, v) = δ( u, v) e dudv = e = 1 Fourier Transform of the constant (=1 for all x and y) kxy (, ) = 1 xy, j2 π ( ux+ vy) ( ) F uv, = e dxdy= δ ( uv, )
72 Trigonometric functions Cosine function oscillating along the x axis Constant along the y axis sxy (, ) = cos(2 π fx) j2 π ( ux+ vy) { cos(2 π )} cos(2 π ) F fx = fx e dxdy = j2 π( fx) j2 π( fx) e + e = e 2 [ δ( u f) + δ( u+ f) ] j2 π ( ux+ vy) dxdy 1 j2 π( u f ) x j2 π( u+ f ) x j2πvy = e + e e dxdy = 2 j2πvy j2 π( u f ) x j2 π( u+ f ) x j2 π( u f ) x j2 π( u+ f ) x e dy e e dx e e dx 1 1 = = + = 2 1 2
73 Vertical grating ω y -2πf 0 2πf ω x
74 Ex. 1
75 Ex. 2
76 Ex. 3 Magnitudes
77 Examples
78 Properties Linearity Shifting Modulation Convolution Multiplication Separability af ( x, y) + bg( x, y) af( u, v) + bg( u, v) f x x y x e F u v j 2 π ( ux0 vy0 (, ) + ) (, ) 0 0 j2 π ( u0x+ v0y) e f x y F u u v v (, ) (, ) 0 0 f ( xy, )* gxy (, ) FuvGuv (, ) (, ) f ( xygxy, ) (, ) Fuv (, )* Guv (, ) f ( xy, ) = f( xf ) ( y) Fuv (, ) = FuFv ( ) ( )
79 Separability 1. Separability of the 2D Fourier transform 2D Fourier Transforms can be implemented as a sequence of 1D Fourier Transform operations performed independently along the two axis j2 π ( ux+ vy) Fuv (, ) f( xye, ) dxdy j2πux j2πvy j2πvy j2πux f ( x, y) e e dxdy e dy f ( x, y) e dx ( ) j2π vy (, ), = Fuye dy= F uv = = = = 2D DFT 1D DFT along the rows 1D DFT along the cols
80 Separability Separable functions can be written as 2. The FT of a separable function is the product of the FTs of the two functions j2 π ( ux+ vy) Fuv (, ) f( xye, ) dxdy j2πux j2πvy j2πvy j2πux h( x) g y e e dxdy g y e dy h( x) e dx ( ) ( ) H u G v = = ( ) ( ) = = = (, ) = ( ) ( ) (, ) = ( ) ( ) f x y h x g y F u v H u G v (, ) = ( ) ( ) f xy f xg y
81 2D Fourier Transform of a Discrete function Fourier Transform of a 2D a-periodic signal defined over a 2D discrete grid The grid can be thought of as a 2D brush used for sampling the continuous signal with a given spatial resolution (T x,t y ) 1D jωk 1 jωk F( Ω ) = f[ k] e, f[ k] = F( Ω) e dt 2π k = 2π 2D F( Ω, Ω ) = f[ k, k ] e x y ( 1 x k2 y) 1 jk ( 1Ω x+ k2ωy) f[ k] = F( Ω, Ω ) e dω Ω 2 4 π 2π 2π + + k = k = jkω + Ω x y x y Ω x,ω y : normalized frequency
82 Unitary frequency notations Ω x = 2π u Ω y = 2π v Fuv (, ) = fk [, k] e 1 2 1/2 1/2 1 2 j2 π ( k u+ k v) 1 2 j2 π ( k1u+ k2v) f k k F u v e dudv [, ] = (, ) 1 2 k + + = k = 1/2 1/2 The integration interval for the inverse transform has width=1 instead of 2π It is quite common to choose 1 1 uv, < 2 2
83 Properties Periodicity: 2D Fourier Transform of a discrete a-periodic signal is periodic The period is 1 for the unitary frequency notations and 2π for normalized frequency notations. Proof (referring to the firsts case) Fu ( + kv, + l) = fmne [, ] Arbitrary integers m= n= = m= n= = m= n= = F( uv, ) ( ) j 2 π ( u+ k) m+ ( v+ l) n ( ) j2π um+ vn j2π km j2πln f[ m, n] e e e f[ m, n] e j 2 π ( um+ vn) 1 1
84 Properties Linearity shifting modulation convolution multiplication separability energy conservation properties also exist for the 2D Fourier Transform of discrete signals. NOTE: in what follows, (k 1,k 2 ) is replaced by (m,n)
85 2D DTFT Properties Linearity Shifting Modulation af [ m, n] + bg[ m, n] af( u, v) + bg( u, v) f m m n n e F u v j 2 π ( um0 vn0 [, ] + ) (, ) 0 0 j2 π ( u0m+ v0n) e f m n F u u v v [, ] (, ) 0 0 Convolution Multiplication f [ mn, ]* g[ mn, ] FuvGuv (, ) (, ) f [ mngmn, ] [, ] Fuv (, )* Guv (, ) Separable functions Energy conservation f [ m, n] = f[ m] f[ n] F( u, v) = F( u) F( v) 1/2 1/2 2 2 f [ mn, ] = Fuv (, ) dudv m= n= 1/2 1/2
86 Impulse Train Define a comb function (impulse train) as follows combm, N[ m, n] = δ[ m km, n ln] k= l= where M and N are integers 1 comb [ n] 2 n
87 Appendix
88 2D-DTFT: delta Define Kronecker delta function δ[ mn, ] 1, for m= 0 and n= 0 = 0, otherwise DT Fourier Transform of the Kronecker delta function j2π( um+ vn) j2π( u0+ v0 ) = = = Fuv (, ) δ[ mne, ] e 1 m= n=
89 2D DT Fourier Transform: constant Fourier Transform of 1 f[ k, l] = 1, k, l j2π ( uk+ vl ) = = Fuv [, ] 1e k= l= = δ ( u k, v l) k= l= periodic with period 1 along u and v To prove: Take the inverse Fourier Transform of the Dirac delta function and use the fact that the Fourier Transform has to be periodic with period 1.
Contents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationContents. Signals as functions (1D, 2D)
Fourier Transform The idea A signal can be interpreted as en electromagnetic wave. This consists of lights of different color, or frequency, that can be split apart usign an optic prism. Each component
More informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More information2D Discrete Fourier Transform (DFT)
2D Discrete Fourier Transform (DFT) Outline Circular and linear convolutions 2D DFT 2D DCT Properties Other formulations Examples 2 2D Discrete Fourier Transform Fourier transform of a 2D signal defined
More informationMultimedia communications
Multimedia communications Comunicazione multimediale G. Menegaz gloria.menegaz@univr.it Prologue Context Context Scale Scale Scale Course overview Goal The course is about wavelets and multiresolution
More informationFrequency2: Sampling and Aliasing
CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo
More informationIntroduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)
Introduction to the Fourier transform Computer Vision & Digital Image Processing Fourier Transform Let f(x) be a continuous function of a real variable x The Fourier transform of f(x), denoted by I {f(x)}
More informationG52IVG, School of Computer Science, University of Nottingham
Image Transforms Fourier Transform Basic idea 1 Image Transforms Fourier transform theory Let f(x) be a continuous function of a real variable x. The Fourier transform of f(x) is F ( u) f ( x)exp[ j2πux]
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 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 informationFourier 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 informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
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 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 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 informationLecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016
Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier
More informationSignals 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 informationUniversity of Connecticut Lecture Notes for ME5507 Fall 2014 Engineering Analysis I Part III: Fourier Analysis
University of Connecticut Lecture Notes for ME557 Fall 24 Engineering Analysis I Part III: Fourier Analysis Xu Chen Assistant Professor United Technologies Engineering Build, Rm. 382 Department of Mechanical
More informationDSP-I DSP-I DSP-I DSP-I
NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79
More informationEE 438 Essential Definitions and Relations
May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present
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 informationFourier Analysis Overview (0A)
CTFS: Fourier Series CTFT: Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2011-2016 Young W. Lim. Permission is granted to copy, distribute
More informationLecture 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 information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More informationDiscrete-time Signals and Systems in
Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The
More informationFourier Series and Fourier Transforms
Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3 Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic
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 informationFundamentals of the DFT (fft) Algorithms
Fundamentals of the DFT (fft) Algorithms D. Sundararajan November 6, 9 Contents 1 The PM DIF DFT Algorithm 1.1 Half-wave symmetry of periodic waveforms.............. 1. The DFT definition and the half-wave
More informationMIT 2.71/2.710 Optics 10/31/05 wk9-a-1. The spatial frequency domain
10/31/05 wk9-a-1 The spatial frequency domain Recall: plane wave propagation x path delay increases linearly with x λ z=0 θ E 0 x exp i2π sinθ + λ z i2π cosθ λ z plane of observation 10/31/05 wk9-a-2 Spatial
More informationCMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation
CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is
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 informationDiscrete Fourier Transform
Discrete Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013 Mårten Björkman
More informationX. 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 informationAspects 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 informationFourier Series. Spectral Analysis of Periodic Signals
Fourier Series. Spectral Analysis of Periodic Signals he response of continuous-time linear invariant systems to the complex exponential with unitary magnitude response of a continuous-time LI system at
More informationReview of Linear Time-Invariant Network Analysis
D1 APPENDIX D Review of Linear Time-Invariant Network Analysis Consider a network with input x(t) and output y(t) as shown in Figure D-1. If an input x 1 (t) produces an output y 1 (t), and an input x
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationSignals & 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 informationContinuous-Time Fourier Transform
Signals and Systems Continuous-Time Fourier Transform Chang-Su Kim continuous time discrete time periodic (series) CTFS DTFS aperiodic (transform) CTFT DTFT Lowpass Filtering Blurring or Smoothing Original
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 informationGood Luck. EE 637 Final May 4, Spring Name: Instructions: This is a 120 minute exam containing five problems.
EE 637 Final May 4, Spring 200 Name: Instructions: This is a 20 minute exam containing five problems. Each problem is worth 20 points for a total score of 00 points You may only use your brain and a pencil
More informationImage Acquisition and Sampling Theory
Image Acquisition and Sampling Theory Electromagnetic Spectrum The wavelength required to see an object must be the same size of smaller than the object 2 Image Sensors 3 Sensor Strips 4 Digital Image
More informationComplex 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 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 informationDISCRETE FOURIER TRANSFORM
DD2423 Image Processing and Computer Vision DISCRETE FOURIER TRANSFORM Mårten Björkman Computer Vision and Active Perception School of Computer Science and Communication November 1, 2012 1 Terminology:
More informationNotes on Fourier Series and Integrals Fourier Series
Notes on Fourier Series and Integrals Fourier Series et f(x) be a piecewise linear function on [, ] (This means that f(x) may possess a finite number of finite discontinuities on the interval). Then f(x)
More informationFourier Series and Integrals
Fourier Series and Integrals Fourier Series et f(x) beapiece-wiselinearfunctionon[, ] (Thismeansthatf(x) maypossessa finite number of finite discontinuities on the interval). Then f(x) canbeexpandedina
More informationA system that is both linear and time-invariant is called linear time-invariant (LTI).
The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped
More informationContinuous and Discrete Time Signals and Systems
Continuous and Discrete Time Signals and Systems Mrinal Mandal University of Alberta, Edmonton, Canada and Amir Asif York University, Toronto, Canada CAMBRIDGE UNIVERSITY PRESS Contents Preface Parti Introduction
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationContinuous-time Fourier Methods
ELEC 321-001 SIGNALS and SYSTEMS Continuous-time Fourier Methods Chapter 6 1 Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity
More informationRandom signals II. ÚPGM FIT VUT Brno,
Random signals II. Jan Černocký ÚPGM FIT VUT Brno, cernocky@fit.vutbr.cz 1 Temporal estimate of autocorrelation coefficients for ergodic discrete-time random process. ˆR[k] = 1 N N 1 n=0 x[n]x[n + k],
More informationMusic 270a: Complex Exponentials and Spectrum Representation
Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential
More informationGBS765 Electron microscopy
GBS765 Electron microscopy Lecture 1 Waves and Fourier transforms 10/14/14 9:05 AM Some fundamental concepts: Periodicity! If there is some a, for a function f(x), such that f(x) = f(x + na) then function
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 5 FFT and Divide and Conquer Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 56 Outline DFT: evaluate a polynomial
More informationPS403 - Digital Signal processing
PS403 - Digital Signal processing III. DSP - Digital Fourier Series and Transforms Key Text: Digital Signal Processing with Computer Applications (2 nd Ed.) Paul A Lynn and Wolfgang Fuerst, (Publisher:
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 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 informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
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 informationFourier 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 information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
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 information2. Image Transforms. f (x)exp[ 2 jπ ux]dx (1) F(u)exp[2 jπ ux]du (2)
2. Image Transforms Transform theory plays a key role in image processing and will be applied during image enhancement, restoration etc. as described later in the course. Many image processing algorithms
More informationChapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter
Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.
More informationDigital Image Processing
Digital Image Processing Image Transforms Unitary Transforms and the 2D Discrete Fourier Transform DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON What is this
More informationFourier series: Any periodic signals can be viewed as weighted sum. different frequencies. view frequency as an
Image Enhancement in the Frequency Domain Fourier series: Any periodic signals can be viewed as weighted sum of sinusoidal signals with different frequencies Frequency Domain: view frequency as an independent
More informationDiscrete-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 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 informationMEDE2500 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 informationContinuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4
Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful
More information6.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 informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
More informationENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University
ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier
More information2 Frequency-Domain Analysis
2 requency-domain Analysis Electrical engineers live in the two worlds, so to speak, of time and frequency. requency-domain analysis is an extremely valuable tool to the communications engineer, more so
More informationFourier Transform for Continuous Functions
Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum
More informationEEL3135: Homework #3 Solutions
EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler
More informationSignal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5
Signal and systems p. 1/5 Signal and systems Linear Systems Luigi Palopoli palopoli@dit.unitn.it Wrap-Up Signal and systems p. 2/5 Signal and systems p. 3/5 Fourier Series We have see that is a signal
More informationDiscrete 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 informationDiscrete-time Fourier Series (DTFS)
Discrete-time Fourier Series (DTFS) Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 59 Opening remarks The Fourier series representation for discrete-time signals has some similarities with
More informationDISCRETE FOURIER TRANSFORM
DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains
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 informationOverview 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 informationEE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet
EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators
More informationEE 637 Final April 30, Spring Each problem is worth 20 points for a total score of 100 points
EE 637 Final April 30, Spring 2018 Name: Instructions: This is a 120 minute exam containing five problems. Each problem is worth 20 points for a total score of 100 points You may only use your brain and
More informationSeries FOURIER SERIES. Graham S McDonald. A self-contained Tutorial Module for learning the technique of Fourier series analysis
Series FOURIER SERIES Graham S McDonald A self-contained Tutorial Module for learning the technique of Fourier series analysis Table of contents Begin Tutorial c 24 g.s.mcdonald@salford.ac.uk 1. Theory
More informationECE 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 informationECE-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 information1.3 Frequency Analysis A Review of Complex Numbers
3 CHAPTER. ANALYSIS OF DISCRETE-TIME LINEAR TIME-INVARIANT SYSTEMS I y z R θ x R Figure.8. A complex number z can be represented in Cartesian coordinates x, y or polar coordinates R, θ..3 Frequency Analysis.3.
More informationConvolution Spatial Aliasing Frequency domain filtering fundamentals Applications Image smoothing Image sharpening
Frequency Domain Filtering Correspondence between Spatial and Frequency Filtering Fourier Transform Brief Introduction Sampling Theory 2 D Discrete Fourier Transform Convolution Spatial Aliasing Frequency
More informationFourier Series Example
Fourier Series Example Let us compute the Fourier series for the function on the interval [ π,π]. f(x) = x f is an odd function, so the a n are zero, and thus the Fourier series will be of the form f(x)
More informationVer 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)
Ver 88 E. Fourier Series and Transforms 4 Key: [A] easy... [E]hard Questions from RBH textbook: 4., 4.8. E. Fourier Series and Transforms Problem Sheet Lecture. [B] Using the geometric progression formula,
More informationLECTURE 12 Sections Introduction to the Fourier series of periodic signals
Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical
More informationEA2.3 - Electronics 2 1
In the previous lecture, I talked about the idea of complex frequency s, where s = σ + jω. Using such concept of complex frequency allows us to analyse signals and systems with better generality. In this
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 information