Discrete Fourier transform
|
|
- Gerard Hodges
- 6 years ago
- Views:
Transcription
1 Discrete Fourier transform Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania January 2, 216 Signal and Information Processing Discrete Fourier transform 1
2 Discrete complex exponentials Discrete complex exponentials Discrete Fourier transform (DFT), definitions and examples Units of the DFT DFT inverse Properties of the DFT Signal and Information Processing Discrete Fourier transform 2
3 Discrete Complex exponentials Discrete complex exponential of discrete frequency k and duration e k (n) = 1 e j2πkn/ = 1 exp(j2πkn/) The complex exponential is explicitly given by e j2πkn/ = cos(2πkn/) + j sin(2πkn/) Real part is a discrete cosine and imaginary part a discrete sine ( Re e j2πkn/ ), with k = 2 and = ( Im e j2πkn/ ), with k = 2 and = Signal and Information Processing Discrete Fourier transform 3
4 Equivalent frequencies Theorem If k l = the signals e k (n) and e l (n) coincide for all n, i.e., e k (n) = ej2πkn/ = ej2πln/ = e l (n) Exponentials with frequencies k and l are equivalent if k l = Signal and Information Processing Discrete Fourier transform 4
5 Orthogonality Theorem Complex exponentials with nonequivalent frequencies are orthogonal. I.e. e k, e l = when k l <. E.g., when k =,... 1, or k = /2 + 1,..., /2. Signals of canonical sets are unrelated. Different rates of change Also note that the energy is e k 2 = e k, e k = 1 Exponentials with frequencies k =, 1,..., 1 are orthonormal e k, e l = δ(l k) They are an orthonormal basis of signal space with samples Signal and Information Processing Discrete Fourier transform 5
6 Conjugate frequencies Theorem Opposite frequencies k and k yield conjugate signals: e k = e k (n) Proof. Just use the definitions to write the chain of equalities e k (n) = ej2π( k)n/ = e j2πkn/ = [ ] e j2πkn/ = ek(n) Opposite frequencies Same real part. Opposite imaginary part The cosine is the same, the sine changes sign Signal and Information Processing Discrete Fourier transform 6
7 Physical meaning Of the canonical frequencies, only /2 + 1 are distinct., 1,..., /2 1 /2 1,..., / ,..., /2 + 1 Frequencies and /2 have no counterpart. Others have conjugates Canonical set /2 + 1,..., 1,, 1,..., /2 easier to interpret Reasonable Can t have more than /2 oscillations in samples With sampling frequency f s and signal duration T = T s = /f s Discrete frequency k frequency f = k T = k = k T s f s Frequencies from to /2 f s /2 have physical meaning egative frequencies are conjugates of the positive frequencies Signal and Information Processing Discrete Fourier transform 7
8 Discrete Fourier transform Discrete complex exponentials Discrete Fourier transform (DFT), definitions and examples Units of the DFT DFT inverse Properties of the DFT Signal and Information Processing Discrete Fourier transform 8
9 Definition of discrete Fourier transform (DFT) Signal x of duration with elements x(n) for n =,..., 1 X is the discrete Fourier transform (DFT) of x if for all k Z X (k) := 1 x(n)e j2πkn/ = 1 x(n) exp( j2πkn/) n= We write X = F(x). All values of X depend on all values of x n= The argument k of the DFT is referred to as frequency DFT is complex even if signal is real X (k) = X R (k) + jx I (k) It is customary to focus on magnitude X (k) = [ ] 1/2 [ ] 1/2 XR(k) 2 + XI 2 (k) = X (k)x (k) Signal and Information Processing Discrete Fourier transform 9
10 DFT elements as inner products Discrete complex exponential (freq. k) e k (n) = 1 e j2πkn/ Can rewrite DFT as X (k) = x(n)e k (n) = x(n)ek(n) n= n= And from the definition of inner product X (k) = x, e k DFT element X (k) inner product of x(n) with e k (n) Projection of x(n) onto complex exponential of frequency k How much of the signal x is an oscillation of frequency k Signal and Information Processing Discrete Fourier transform 1
11 DFT of a square pulse (derivation) The unit energy square pulse is the signal M (n) that takes values M (n) = 1 M if n < M M (n) 1/ M M (n) = if M n M 1 1 t Since only the first M 1 elements of M (n) are not null, the DFT is X (k) = 1 n= M (n)e j2πkn/ = 1 M 1 n= 1 M e j2πkn/ X (k) = sum of first M components of exponential of frequency k Can reduce to simpler expression but who cares? It s just a sum Signal and Information Processing Discrete Fourier transform 11
12 DFT of a square pulse (illustration) Square pulse of length M = 2 and overall signal duration = 32 X (k) = 1 1 n= 1 e j2πkn/ = 1 ( 1 + e j2πk/) 2 2 E.g., X (k) = 2 2 at k =, ±,... and X (k) = at k =, ±3/2, Modulus X (k) of the DFT of square pulse, duration = 32, pulse length M = Frequency index k = 32, 31,..., 64 = [ 32, 64] This DFT is periodic with period true in general Signal and Information Processing Discrete Fourier transform 12
13 Periodicity of the DFT Consider frequencies k and k +. The DFT at k + is X (k + ) := 1 n= x(n)e j2π(k+)n/ Complex exponentials of freqs. k and k + are equivalent. Then X (k + ) := 1 n= x(n)e j2πkn/ = X (k) DFT values apart are equivalent DFT has period Suffices to look at consecutive frequencies canonical sets Computation k [, 1] Interpretation k [ /2, /2] (actually, + 1 freqs.) Related by chop and shift [ /2, 1] [/2, 1] Signal and Information Processing Discrete Fourier transform 13
14 Canonical set k [, 1] DFT of the square pulse highlighting frequencies k [, 1] Modulus X (k) of the DFT of square pulse, duration = 32, pulse length M = Frequency index k = 32, 31,..., 64 = [ 32, 64] Frequencies larger than /2 have no clear physical meaning Signal and Information Processing Discrete Fourier transform 14
15 Canonical set k [ /2, /2] DFT of the square pulse highlighting frequencies k [ /2, /2] egative freq. k has the same interpretation as positive freq. k One redundant element X ( /2) = X (/2). Just convenient Modulus X (k) of the DFT of square pulse, duration = 32, pulse length M = Frequency index k = 32, 31,..., 64 = [ 32, 64] Obtain frequencies k [ /2, 1] from frequencies [/2, 1] Signal and Information Processing Discrete Fourier transform 15
16 Pulses of different length The DFT X gives information on how fast the signal x changes.1 DFT modulus of square pulse, duration = 256, pulse length M = Frequency index k = 128, 127,..., 128 = [ 128, 128] DFT modulus of square pulse, duration = 256, pulse length M = For length M = 2 have weight at high frequencies Length M = 4 concentrates weight at lower frequencies Pulse of length M = 2 changes more than a pulse of length M = 4 Frequency index k = 128, 127,..., 128 = [ 128, 128] Signal and Information Processing Discrete Fourier transform 16
17 More DFTs of pulses of different length The lengthier the pulse the less it changes DFT concentrates at zero freq. DFT modulus of square pulse, duration = 256, pulse length M = Frequency index k = 128, 127,..., 128 = [ 128, 128] DFT modules of square pulse, duration = 256, pulse length M = Frequency index k = 128, 127,..., 128 = [ 128, 128] DFT modulus of square pulse, duration = 256, pulse length M = Frequency index k = 128, 127,..., 128 = [ 128, 128] DFT modulus of square pulse, duration = 256, pulse length M = Frequency index k = 128, 127,..., 128 = [ 128, 128] Signal and Information Processing Discrete Fourier transform 17
18 DFT of a delta function The delta function is δ() = 1 and δ(n) =, else. Then, the DFT is X (k) = 1 δ(n)e j2πkn/ = 1 δ()e j2πk/ = 1 n= Delta function x(n) = δ(n) DFT of delta function X (k) = 1/ 1 1/ Time index n =, 1,..., 15 = [, 15] DFT Frequency index k =, 1,..., 15 = [, 15] Only the values k [, 15] shown. DFT defined for all k but periodic Observe that the energy is conserved X 2 = δ 2 = 1 Signal and Information Processing Discrete Fourier transform 18
19 DFT of a shifted delta function For shifted delta δ(n n ) = 1 and δ(n n ) = otherwise. Thus X (k) = 1 δ(n n )e j2πkn/ = 1 δ(n n )e j2πkn / n= Of course δ(n n ) = δ() = 1, implying that X (k) = 1 e j2πkn / = e n (k) Complex exponential of frequency n (below, = 16 and n = 1) Shifted delta function x(n) = δ(n n ) DFT X (k) = 1 e j2πkn / = e n (k) Time index n =, 1,..., 15 = [, 15] DFT 1/ -1/ Frequency index k =, 1,..., 15 = [, 15] Signal and Information Processing Discrete Fourier transform 19
20 DFT of a complex exponential Complex exponential of freq. k x(n) = 1 e j2πk n/ = e k (n) Use inner product form of DFT definition X (k) = e k, e k Orthonormality of complex exponentials e k, e k = δ(k k ) Complex exponential x(n) = 1 e j2πk n/ = e k (n) DFT is shifted delta function X (k) = δ(k k ) 1/ -1/ Time index n =, 1,..., 15 = [, 15] DFT Frequency index n =, 1,..., 15 = [, 15] DFT of exponential e k(n) is shifted delta X (k) = δ(k k ) Signal and Information Processing Discrete Fourier transform 2
21 DFT of a constant Constant function x(n) = 1/ (it has unit energy) and k = Complex exponential with frequency k = x(n) = e Use inner product form of DFT definition X (k) = e, e k Complex exponential orthonormality e, e k = δ(k ) = δ(k) Constant function x(n) = 1/ DFT of constant is delta function X (k) = δ(k) 1/ Time index n =, 1,..., 15 = [, 15] DFT Frequency index k =, 1,..., 15 = [, 15] DFT of constant x(n) = 1/ is delta function X (k) = δ(k) Signal and Information Processing Discrete Fourier transform 21
22 Observations DFT of a signal captures its rate of change Signals that change faster have more DFT weight at high frequencies DFT conserves energy (all have unit energy in our examples) Energy of DFT X = F(x) is the same as energy of the signal x Indeed, an important property we will show Duality of signal - transform pairs (signals and DFTs come in pairs) DFT of delta is a constant. DFT of constant is a delta DFT of exponential is shifted delta. DFT of shifted delta is exponential Indeed, a fact that follows from the form of the inverse DFT Signal and Information Processing Discrete Fourier transform 22
23 Units of the DFT Discrete complex exponentials Discrete Fourier transform (DFT), definitions and examples Units of the DFT DFT inverse Properties of the DFT Signal and Information Processing Discrete Fourier transform 23
24 Units Sampling time T s, sampling frequency f s, signal duration T = T s Discrete frequency k k oscillations in time T s = Period T s /k Discrete frequency k equivalent to real frequency f k = k T s = k f s In particular, k = /2 equivalent to f /2 = /2f s = f s 2 Set of frequencies k [ /2, /2] equivalent to real frequencies... That lie between f s /2 and f s /2 Are spaced by f s / (difference between frequencies f k and f k+1 ) Interval width given by sampling frequency. Resolution given by Signal and Information Processing Discrete Fourier transform 24
25 Units in DFT of a discrete complex exponential Complex exponential of frequency f = k f s / Discrete frequency k and DFT X (k) = δ(k k ) But frequency k corresponds to frequency f X (f ) = δ(f f ) k 2 k 1 - fs 2-2fs - fs fs 2fs f = k fs fs 2 k True only when frequency f = (k /)f s is a multiple of f s / Signal and Information Processing Discrete Fourier transform 25
26 Units in DFT of a square pulse Square pulse of length T = 4s observed during a total of T = 32s. Sampled every T s = 125ms Sample frequency f s = 8Hz Total number of samples = T /T s = 256 Maximum frequency k = /2 = 128 f k = f /2 = f s /2 = 4Hz Fequency resolution f s / = 8Hz/256 =.3125Hz Discrete index, duration = 256, pulse length M = Discrete frequency k [ 128, 128] Sampling frequency fs = 8Hz, duration T = 32s, length T = 4s Hz -3Hz -2Hz -1Hz 1Hz 2Hz 3Hz 4Hz Frequencies are, ±fs /, ±2fs /,..., ±fs /2 Signal and Information Processing Discrete Fourier transform 26
27 Units in DFT of a square pulse Interval between freqs. f s / = 8Hz/256 = 1/32 =.3125Hz 32 equally spaced frees for each 1Hz interval = 8 every.125 Hz. Sampling frequency fs = 8Hz, duration T = 32s, length T = 4s Hz -.625Hz -.5Hz -.375Hz -.25Hz Hz.25Hz.375Hz.5Hz.625Hz.75Hz Frequencies, ±.3125Hz, ±.625Hz,..., ±.75Hz Zeros of DFT are at frequencies.25hz,.5 Hz,.75 Hz,... Thus, zeros are at frequencies are 1/T, 2/T, 3/T,... Most (a lot) of the DFT energy is between freqs. 1/T and 1/T Signal and Information Processing Discrete Fourier transform 27
28 DFT inverse Discrete complex exponentials Discrete Fourier transform (DFT), definitions and examples Units of the DFT DFT inverse Properties of the DFT Signal and Information Processing Discrete Fourier transform 28
29 Definition of DFT inverse Given a Fourier transform X, the inverse (i)dft x = F 1 (X ) is x(n) := 1 X (k)e j2πkn/ = 1 X (k) exp(j2πkn/) k= k= Same as DFT but for sign in the exponent (also, sum over k, not n) Any summation over consecutive frequencies works as well. E.g., x(n) = 1 /2 k= /2+1 X (k)e j2πkn/ Because for a DFT X we know that it must be X (k + ) = X (k) Signal and Information Processing Discrete Fourier transform 29
30 idft is, indeed, the inverse of the DFT Theorem The inverse DFT of the DFT of x is the signal x F 1 [F(x)] = x Every signal x can be written as a sum of complex exponentials x(n) = 1 X (k)e j2πkn/ = 1 /2 k= k= /2+1 X (k)e j2πkn/ Coefficient multiplying e j2πkn/ is X (k) = kth element of DFT of x X (k) := 1 n= x(n)e j2πkn/ Signal and Information Processing Discrete Fourier transform 3
31 Proof of DFT inverse formula Proof. Let X = F(x) be the DFT of x. Let x = F 1 (X ) be the idft of X. We want to show that x x From the definition of the idft of X x(ñ) = 1 X (k)e j2πkñ/ k= From the definition of the DFT of x X (k) := 1 n= x(n)e j2πkn/ Substituting expression for X (k) into expression for x(ñ) yields x(ñ) = 1 [ 1 ] x(n)e j2πkn/ e j2πkñ/ k= n= Signal and Information Processing Discrete Fourier transform 31
32 Proof of DFT inverse formula Proof. Exchange summation order to sum first over k and then over n x(ñ) = n= [ x(n) k= Pulled x(n) out because it doesn t depend on k ] 1 e j2πkñ/ 1 e j2πkn/ Innermost sum is the inner product between eñ and e n. Orthonormality: k= 1 e j2πkñ/ 1 e j2πkn/ = δ(ñ n) Reducing to x(ñ) = x(n)δ(ñ n) = x(ñ) n= Last equation is true because only term n = ñ is not null in the sum Signal and Information Processing Discrete Fourier transform 32
33 Inverse DFT as inner product Discrete complex exponential (freq. n) e n (k) = 1 e j2πkn/ Rewrite idft as x(n) = X (k)e n (k) = X (k)e n(k) k= k= And from the definition of inner product x(n) = X, e n idft element X (k) inner product of X (k) with e n (k) Different from DFT, this is not the most useful interpretation Signal and Information Processing Discrete Fourier transform 33
34 Inverse DFT as successive approximations Signal as sum of exponentials x(n) = 1 /2 k= /2+1 X (k)e j2πkn/ Expand the sum inside out from k = to k = ±1, to k = ±2,... x(n) = X () e j2πn/ constant + X (1) e j2π1n/ + X ( 1) e j2π1n/ single oscillation + X (2) e j2π2n/ + X ( 2) e j2π2n/ double oscillation..... ( ) + X 2 1 e j2π( 2 1)n/ + X ( 2 )e + 1 j2π( ( ) 2 2 1)n/ 1 oscillation ( ) + X e j2π( 2 )n/ 2 2 oscillation Start with slow variations and progress on to add faster variations Signal and Information Processing Discrete Fourier transform 34
35 Reconstruction of square pulse Consider square pulse of duration = 256 and length M = 128 Reconstruct with frequency k = only (DC component) Pulse reconstruction with k= frequencies ( = 256, M = 128) Discrete time index n [, 255] Bound to be not very good Just the average signal value Signal and Information Processing Discrete Fourier transform 35
36 Reconstruction of square pulse Consider square pulse of duration = 256 and length M = 128 Reconstruct with frequencies k =, k = ±1, and k = ± Pulse reconstruction with k=2 frequencies ( = 256, M = 128) Discrete time index n [, 255] ot too bad, sort of looks like a pulse only 3 frequencies Signal and Information Processing Discrete Fourier transform 36
37 Reconstruction of square pulse Consider square pulse of duration = 256 and length M = 128 Reconstruct with frequencies up to k = Pulse reconstruction with k=4 frequencies ( = 256, M = 128) Discrete time index n [, 255] Starts to look like a good approximation Signal and Information Processing Discrete Fourier transform 37
38 Reconstruction of square pulse Consider square pulse of duration = 256 and length M = 128 Reconstruct with frequencies up to k = Pulse reconstruction with k=8 frequencies ( = 256, M = 128) Discrete time index n [, 255] Good approximation of the = 256 values with 9 DFT coefficients Signal and Information Processing Discrete Fourier transform 38
39 Reconstruction of square pulse Consider square pulse of duration = 256 and length M = 128 Reconstruct with frequencies up to k = Pulse reconstruction with k=16 frequencies ( = 256, M = 128) Discrete time index n [, 255] Compression Store k + 1 = 17 DFT values instead of = 128 samples Signal and Information Processing Discrete Fourier transform 39
40 Reconstruction of square pulse Consider square pulse of duration = 256 and length M = 128 Reconstruct with frequencies up to k = Pulse reconstruction with k=32 frequencies ( = 256, M = 128) Discrete time index n [, 255] Can tradeoff less compression for better signal accuracy Signal and Information Processing Discrete Fourier transform 4
41 Spectrum (re)shaping (1) Start with a signal x with elements x(n). Compute DFT X as X (k) := 1 n= x(n)e j2πkn/ (2) (Re)shape spectrum Transform DFT X into DFT Y (3) With DFT Y available, recover signal y with inverse DFT y(n) := 1 Y (k)e j2πkn/ k= x F X SS Y F 1 y Signal and Information Processing Discrete Fourier transform 41
42 Spectrum reshaping to remove noise An application of spectrum reshaping is to clean a noisy signal Signal with some underlying trend (good) and some noise (bad) 2. Original signal x(n). It moves randomly, but not that much Discrete time index n [, 128] Which is which? ot clear Let s look at the spectrum (DFT) Signal and Information Processing Discrete Fourier transform 42
43 Spectrum reshaping to remove noise An application of spectrum reshaping is to clean a noisy signal ow the trend (spikes) is clearly separated from the noise (the floor) DFT X (k) of original signal Frequency index k [ 64, 64] How do we remove the noise? Reshape the spectrum Signal and Information Processing Discrete Fourier transform 43
44 Spectrum reshaping to remove noise An application of spectrum reshaping is to clean a noisy signal Remove freqs. larger than 8 Y (k) = for k > 8, Y (k) = X (k) else DFT Y (k) of signal with reshaped spectrum Frequency index k [ 64, 64] How do we recover the trend? Inverse DFT Signal and Information Processing Discrete Fourier transform 44
45 Spectrum reshaping to remove noise An application of spectrum reshaping is to clean a noisy signal Inverse DFT of reshaped specturm Y (k) yields cleaned signal y(n) 2. Signal y(n) reconstructed from cleaned spectrum Discrete time index n [, 128] The trend now is clearly visible. oise has been removed Signal and Information Processing Discrete Fourier transform 45
46 Properties of the DFT Discrete complex exponentials Discrete Fourier transform (DFT), definitions and examples Units of the DFT DFT inverse Properties of the DFT Signal and Information Processing Discrete Fourier transform 46
47 Three important properties of DFTs DFTs of real signals (no imaginary part) are conjugate symmetric X ( k) = X (k) Signals of unit energy have transforms of unit energy More generically, the DFT preserves energy (Parseval s theorem) x(n) 2 = x 2 = X 2 = X (k) 2 n= k= The DFT operator is a linear operator F(ax + by) = af(x) + bf(y) Signal and Information Processing Discrete Fourier transform 47
48 Symmetry Theorem The DFT X = F(x) of a real signal x is conjugate symmetric X ( k) = X (k) Can recover all DFT components from those with freqs. k [, /2] What about components with freqs. k [ /2, 1]? Conjugates of those with freqs k [, /2] Other elements are equivalent to one in [ /2, /2] (periodicity) Signal and Information Processing Discrete Fourier transform 48
49 Proof of symmetry property Proof. Write the DFT X ( k) using its definition X ( k) = 1 n= x(n)e j2π( k)n/ When the signal is real, its conjugate is itself x(n) = x (n) Conjugating a complex exponential changing the exponent s sign Can then rewrite X ( k) = 1 x (n) (e j2πkn/) Sum and multiplication can change order with conjugation n= [ 1 ] X ( k) = x(n)e j2πkn/ = X (k) n= Signal and Information Processing Discrete Fourier transform 49
50 Energy conservation Theorem (Parseval) Let X = F(x) be the DFT of signal x. The energies of x and X are the same, i.e., x(n) 2 = x 2 = X 2 = X (k) 2 n= In energy of DFT, any set of consecutive freqs. would do. E.g., k= X 2 = X (k) 2 = k= /2 k= /2+1 X (k) 2 Signal and Information Processing Discrete Fourier transform 5
51 Proof of Parseval s Theorem Proof. From the definition of the energy of X X 2 = X (k)x (k) k= From the definition of the DFT of x X (k) := 1 n= x(n)e j2πkn/ Substitute expression for X (k) into one for X 2 (observe conjugation) [ X 2 1 ][ = x(n)e j2πkn/ 1 ] x (ñ)e +j2πkñ/ k= n= ñ= Signal and Information Processing Discrete Fourier transform 51
52 Proof of Parseval s Theorem Proof. Distribute product and exchange order of summations sum over k first X 2 = n= ñ= [ x(n)x (ñ) k= ] 1 e j2πkn/ 1 e +j2πkñ/ Pulled x(n) and x (ñ) out because they don t depend on k Innermost sum is the inner product between eñ and e n. Orthonormality: k= 1 e j2πkn/ 1 e +j2πkñ/ = eñ, e n = δ(ñ n) Thus X 2 = x(n)x (ñ)δ(ñ n) = x(n)x (n) = x 2 n= ñ= n= True because only terms n = ñ are not null in the sum Signal and Information Processing Discrete Fourier transform 52
53 Linearity Theorem The DFT of a linear combination of signals is the linear combination of the respective DFTs of the individual signals, F(ax + by) = af(x) + bf(y). In particular... Adding signals (z = x + y) Adding DFTs (Z = X + Y ) Scaling signals(y = ax) Scaling DFTs (Y = ax ) Signal and Information Processing Discrete Fourier transform 53
54 Proof of Linearity Proof. Let Z := F(ax + by). From the definition of the DFT we have Z(k) = 1 [ ] ax(n) + by(n) e j2πkn/ n= Expand the product, reorder terms, identify the DFTs of x and y Z(k) = a x(n)e j2πkn/ + b n= n= y(n)e j2πkn/ First sum is DFT X = F(x). Second sum is DFT Y = F(y) Z(k) = ax (k) + by (k) Signal and Information Processing Discrete Fourier transform 54
55 DFT of a discrete cosine DFT of discrete cosine of freq. k x(n) = 1 cos(2πk n/) Can write cosine as a sum of discrete complex exponentials x(n) = 1 [ 2 e j2πkn/ + e j2πkn/] = 1 [ ] e k(n) + e k(n) 2 From linearity of DFTs X = F(x) = 1 2 [ ] F(e k) + F(e k) DFT of complex exponential e k is delta function δ(k k ). Then X (k) = 1 2 [ ] δ(k k ) + δ(k + k ) A pair of deltas at positive and negative frequency k Signal and Information Processing Discrete Fourier transform 55
56 DFT of a discrete sine DFT of discrete sine of freq. k x(n) = 1 sin(2πk n/) Can write sine as a difference of discrete complex exponentials x(n) = 1 [ 2j e j2πkn/ e j2πkn/] = j 2 From linearity of DFTs X = F(x) = j 2 [ ] e k(n) e k(n) [ ] F(e k) F(e k) DFT of complex exponential e k is delta function δ(k k ). Then X (k) = j 2 [ ] δ(k + k ) δ(k k ) Pair of opposite complex deltas at positive and negative frequency k Signal and Information Processing Discrete Fourier transform 56
57 DFT of discrete cosine and discrete sine Cosine has real part only (top). Sine has imaginary part only (bottom) 1/2 1/2 /2 k k k /2 /2 k k k /2 1/2 k /2 k k k /2 /2 k /2 k -1/2 Cosine is symmetric around k =. Sine is antisymmetric around k =. Signal and Information Processing Discrete Fourier transform 57
58 DFT of discrete cosine and discrete sine (more) Real and imaginary parts are different but the moduli are the same 1/2 1/2 1/2 1/2 /2 k k k /2 /2 k k k /2 Cosine and sine are essentially the same signal (shifted versions) The moduli of their DFTs are identical Phase difference captured by phase of complex number X (±k ) Signal and Information Processing Discrete Fourier transform 58
Multidimensional Signal Processing
Multidimensional Signal Processing Mark Eisen, Alec Koppel, and Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Alejandro Ribeiro January 19, 2018 Let x : [0, N 1] C be a discrete signal of duration N and having elements x(n) for n [0, N 1]. The discrete Fourier transform (DFT) of
More informationTwo-Dimensional Signal Processing and Image De-noising
Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 12, 2018 Until now, we considered (one-dimensional) discrete signals of the form x : [0, N 1] C of
More informationFourier transform. Alejandro Ribeiro. February 1, 2018
Fourier transform Alejandro Ribeiro February 1, 2018 The discrete Fourier transform (DFT) is a computational tool to work with signals that are defined on a discrete time support and contain a finite number
More informationTwo-Dimensional Signal Processing and Image De-noising
Two-Dimensional Signal Processing and Image De-noising Alec Koppel, Mark Eisen, Alejandro Ribeiro March 14, 2016 Before we considered (one-dimensional) discrete signals of the form x : [0, N 1] C where
More informationEDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015
EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly
More informationSignal and Information Processing. Alejandro Ribeiro
Signal and Information Processing Alejandro Ribeiro April 26, 16 Contents 1 Principal Component Analysis 3 11 The DFT and idft as Hermitian Matrices 3 111 Properties of the DFT Matrix 4 112 The Product
More informationDiscrete sines, cosines, and complex exponentials
Discrete sines, cosines, and complex exponentials Alejandro Ribeiro January 15, 2015 Sines, cosines, and complex exponentials play a very important role in signal and information processing. The purpose
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 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 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 informationPrincipal Components Analysis
Principal Components Analysis Santiago Paternain, Aryan Mokhtari and Alejandro Ribeiro March 29, 2018 At this point we have already seen how the Discrete Fourier Transform and the Discrete Cosine Transform
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 informationThe Discrete Fourier Transform (DFT) Properties of the DFT DFT-Specic Properties Power spectrum estimate. Alex Sheremet.
4. April 2, 27 -order sequences Measurements produce sequences of numbers Measurement purpose: characterize a stochastic process. Example: Process: water surface elevation as a function of time Parameters:
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 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 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 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 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 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 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 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 informationEE 438 Supplementary Notes on Fourier Series and Linear Algebra.
EE 38 Supplementary Notes on Fourier Series and Linear Algebra. Discrete-Time Fourier Series. How to write a vector s as a sum where {g,...,g m } are pairwise orthogonal? s m a k g k, k Answer: project
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
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 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 informationFourier Transforms For additional information, see the classic book The Fourier Transform and its Applications by Ronald N. Bracewell (which is on the shelves of most radio astronomers) and the Wikipedia
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 informationThe Discrete-time Fourier Transform
The Discrete-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals: The
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationTutorial 2 - Learning about the Discrete Fourier Transform
Tutorial - Learning about the Discrete Fourier Transform This tutorial will be about the Discrete Fourier Transform basis, or the DFT basis in short. What is a basis? If we google define basis, we get:
More information[ ], [ ] [ ] [ ] = [ ] [ ] [ ]{ [ 1] [ 2]
4. he discrete Fourier transform (DF). Application goal We study the discrete Fourier transform (DF) and its applications: spectral analysis and linear operations as convolution and correlation. We use
More information1 Separation of Variables
Jim ambers ENERGY 281 Spring Quarter 27-8 ecture 2 Notes 1 Separation of Variables In the previous lecture, we learned how to derive a PDE that describes fluid flow. Now, we will learn a number of analytical
More informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
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 informationSignals & Systems. Lecture 4 Fourier Series Properties & Discrete-Time Fourier Series. Alp Ertürk
Signals & Systems Lecture 4 Fourier Series Properties & Discrete-Time Fourier Series Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation:
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
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 informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
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 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 informationA3. Frequency Representation of Continuous Time and Discrete Time Signals
A3. Frequency Representation of Continuous Time and Discrete Time Signals Objectives Define the magnitude and phase plots of continuous time sinusoidal signals Extend the magnitude and phase plots to discrete
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 informationReview of Concepts from Fourier & Filtering Theory. Fourier theory for finite sequences. convolution/filtering of infinite sequences filter cascades
Review of Concepts from Fourier & Filtering Theory precise definition of DWT requires a few basic concepts from Fourier analysis and theory of linear filters will start with discussion/review of: basic
More informationNotes 07 largely plagiarized by %khc
Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties
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 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 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 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 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 informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationChapter 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 information12.1 Fourier Transform of Discretely Sampled Data
494 Chapter 12. Fast Fourier Transform now is: The PSD-per-unit-time converges to finite values at all frequencies except those where h(t) has a discrete sine-wave (or cosine-wave) component of finite
More informationComputer Problems for Fourier Series and Transforms
Computer Problems for Fourier Series and Transforms 1. Square waves are frequently used in electronics and signal processing. An example is shown below. 1 π < x < 0 1 0 < x < π y(x) = 1 π < x < 2π... and
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 informationE The Fast Fourier Transform
Fourier Transform Methods in Finance By Umberto Cherubini Giovanni Della Lunga Sabrina Mulinacci Pietro Rossi Copyright 2010 John Wiley & Sons Ltd E The Fast Fourier Transform E.1 DISCRETE FOURIER TRASFORM
More informationSampling. Alejandro Ribeiro. February 8, 2018
Sampling Alejandro Ribeiro February 8, 2018 Signals exist in continuous time but it is not unusual for us to process them in discrete time. When we work in discrete time we say that we are doing discrete
More information5.1 The Discrete Time Fourier Transform
32 33 5 The Discrete Time ourier Transform ourier (or frequency domain) analysis the last Complete the introduction and the development of the methods of ourier analysis Learn frequency-domain methods
More informationCh.11 The Discrete-Time Fourier Transform (DTFT)
EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution
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 informationPower Spectral Density of Digital Modulation Schemes
Digital Communication, Continuation Course Power Spectral Density of Digital Modulation Schemes Mikael Olofsson Emil Björnson Department of Electrical Engineering ISY) Linköping University, SE-581 83 Linköping,
More informationLecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE
OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE EEE 43 DIGITAL SIGNAL PROCESSING (DSP) 2 DIFFERENCE EQUATIONS AND THE Z- TRANSFORM FALL 22 Yrd. Doç. Dr. Didem Kivanc Tureli didemk@ieee.org didem.kivanc@okan.edu.tr
More informationIn this Lecture. Frequency domain analysis
In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier
More informationSummary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!
Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship
More informationPart 3d: Spectra of Discrete-Time Signals
c D. Neuhoff and J. Fessler, June 9, 23, 2:8 student version) 3d. Part 3d: Spectra of DiscreteTime Signals Outline A. Definition of spectrum for discretetime signals B. Periodicity of discretetime sinusoids
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 informationSNR Calculation and Spectral Estimation [S&T Appendix A]
SR Calculation and Spectral Estimation [S&T Appendix A] or, How not to make a mess of an FFT Make sure the input is located in an FFT bin 1 Window the data! A Hann window works well. Compute the FFT 3
More informationLectures on Spectra of Discrete-Time Signals
Lectures on Spectra of Discrete-Time Signals Principal questions to be addressed: What, in a general sense, is the "spectrum" of a discrete-time signal? How does one assess the spectrum of a discrete-time
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
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 informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationDiscrete Fourier Transform
Last lecture I introduced the idea that any function defined on x 0,..., N 1 could be written a sum of sines and cosines. There are two different reasons why this is useful. The first is a general one,
More informationProblem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:
EE 438 Homework 4. Corrections in Problems 2(a)(iii) and (iv) and Problem 3(c): Sunday, 9/9, 10pm. EW DUE DATE: Monday, Sept 17 at 5pm (you see, that suggestion box does work!) Problem 1. Suppose we calculate
More informationIntroduction to Orthogonal Transforms. with Applications in Data Processing and Analysis
i Introduction to Orthogonal Transforms with Applications in Data Processing and Analysis ii Introduction to Orthogonal Transforms with Applications in Data Processing and Analysis June 8, 2009 i ii Contents
More informationIntroduction to Decision Sciences Lecture 6
Introduction to Decision Sciences Lecture 6 Andrew Nobel September 21, 2017 Functions Functions Given: Sets A and B, possibly different Definition: A function f : A B is a rule that assigns every element
More informationLecture 4 - Spectral Estimation
Lecture 4 - Spectral Estimation The Discrete Fourier Transform The Discrete Fourier Transform (DFT) is the equivalent of the continuous Fourier Transform for signals known only at N instants separated
More informationSignals and Systems Lecture (S2) Orthogonal Functions and Fourier Series March 17, 2008
Signals and Systems Lecture (S) Orthogonal Functions and Fourier Series March 17, 008 Today s Topics 1. Analogy between functions of time and vectors. Fourier series Take Away Periodic complex exponentials
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 informationIntroduction to Fourier Analysis Part 2. CS 510 Lecture #7 January 31, 2018
Introduction to Fourier Analysis Part 2 CS 510 Lecture #7 January 31, 2018 OpenCV on CS Dept. Machines 2/4/18 CSU CS 510, Ross Beveridge & Bruce Draper 2 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg
More informationLeast Squares Regression
Least Squares Regression Chemical Engineering 2450 - Numerical Methods Given N data points x i, y i, i 1 N, and a function that we wish to fit to these data points, fx, we define S as the sum of the squared
More informationProbability review. September 11, Stoch. Systems Analysis Introduction 1
Probability review Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ September 11, 2015 Stoch.
More informationLecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)
Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1
More informationMathematics of Imaging: Lecture 3
Mathematics of Imaging: Lecture 3 Linear Operators in Infinite Dimensions Consider the linear operator on the space of continuous functions defined on IR. J (f)(x) = x 0 f(s) ds Every function in the range
More informationAlgorithms of Scientific Computing
Algorithms of Scientific Computing Discrete Fourier Transform (DFT) Michael Bader Technical University of Munich Summer 2018 Fast Fourier Transform Outline Discrete Fourier transform Fast Fourier transform
More informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
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 informationThe Fourier spectral method (Amath Bretherton)
The Fourier spectral method (Amath 585 - Bretherton) 1 Introduction The Fourier spectral method (or more precisely, pseudospectral method) is a very accurate way to solve BVPs with smooth solutions on
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 informationIntroduction to Machine Learning
10-701 Introduction to Machine Learning PCA Slides based on 18-661 Fall 2018 PCA Raw data can be Complex, High-dimensional To understand a phenomenon we measure various related quantities If we knew what
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 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 informationThe Continuous-time Fourier
The Continuous-time Fourier Transform Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Outline Representation of Aperiodic signals:
More informationMath 115 ( ) Yum-Tong Siu 1. Derivation of the Poisson Kernel by Fourier Series and Convolution
Math 5 (006-007 Yum-Tong Siu. Derivation of the Poisson Kernel by Fourier Series and Convolution We are going to give a second derivation of the Poisson kernel by using Fourier series and convolution.
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 informationDiscrete-Time Fourier Transform
C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,
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 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 informationElec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis
Elec461 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis Dr. D. S. Taubman May 3, 011 In this last chapter of your notes, we are interested in the problem of nding the instantaneous
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More information