Signal Processing Homework Solutions | Convolution Problems and Fourier Transform
Explore solutions for signal processing problems including convolution and Fourier transform calculations for various sequences. Learn to determine output signals based on given input sequences.
Signal Processing Homework Solutions | Convolution Problems and Fourier Transform
E N D
Presentation Transcript
Problem 2.11 • Given: • Determine y[n] if • Solution: • Find transform of x[n] • Compute • Compute y[n] =
Problem 2.11 • Compute
Problem 2.29 • Given an LTI system: • h[n]= • Plot y[n], when: • x[n]=u[n], x[n]=u[n-4], x[n]=u[n]-u[n-4]
Problem 2.29 • Using Convolution: • (a) • (b) Use shift property on (a) y[n]=
Problem 2.29 • (c) Subtract (b) from (a) • y[n]={1,2,3,4,1,-2,-3,-4,-2,0,0….}u[n]
Problem 2.42 • Given • Find • Is it causal?
Problem 2.42 causal
Problem 2.55 • Given • +1+2+2++2 • +1+2+2++2 = 8 • +1+2+2++2 = -4
Problem 2.55 • Evaluate • Inverse Fourier transform:
Problem 2.55 • Evaluate • +1+2+2++2