PS5solns

PS5solns - Alternatively, we can do this in the f domain,...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
Alternatively, we can do this in the f domain, x 1 ( t ) = Sinc ( t ) = X 1 ( j 2 πf ) = I [ - 1 2 , 1 2 ] ( f ). x 2 ( t ) = sin(2 π ( t - 1)) π ( t - 1) = 2 Sinc (2( t - 1)) = X 2 ( j 2 πf ) = I [ - 1 2 , 1 2 ] ( f ) e - j 2 πf . x ( t ) = x 1 ( t ) x 2 ( t ) = X ( j 2 πf ) = X 1 ( j 2 πf ) * X 2 ( j 2 πf ). Peforming the convolution as we did in the ω domain, we get X ( j 2 πf ) = 1 j 2 π (1 + e - j 2 πf ) - 3 2 < f < - 1 2 - 1 j 2 π (1 + e - j 2 πf ) 1 2 < f < 3 2 0 elsewhere Problem 2 4.4 ( a ) x 1 ( t ) = 1 2 π R -∞ [2 πδ ( ω ) + πδ ( ω - 4 π ) + πδ ( ω + 4 π )] e jωt = 1 + 1 2 e j 4 πt + 1 2 e - j 4 πt = 1 + cos(4 πt )
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem 6 ts = 0.1; fs = 0.05; % For b), ts = 0.05, fs = 0.02 N = 256; % 1/(ts*fs) = 200; % For b), N = 1024, 1/(ts*fs) = 1000 x = zeros(1,N); m = (1-0)/ts; % number of non-zero samples x(1:m) = 1; % now we have x as a function of the sample number y = fft(x)*ts; % the function fft() implements H[m]
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/06/2008 for the course ECE 130A taught by Professor Madhow during the Fall '07 term at UCSB.

Page1 / 14

PS5solns - Alternatively, we can do this in the f domain,...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online