Scribd Logo
Upload

Welcome to Scribd!

  • 57 views

    Assignment1 1

    Uploaded by

    ARUOS Soura
    The document contains 10 questions about linear time-invariant systems and signal processing concepts such as sampling, convolution, and Fourier series. The questions cover topics like determining if a system is time-invariant, computing convolution, sampling analog signals, sketching signals, and determining Fourier series coefficients.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Assignment1 1

    Uploaded by

    ARUOS Soura
    57 views3 pages
    The document contains 10 questions about linear time-invariant systems and signal processing concepts such as sampling, convolution, and Fourier series. The questions cover topics like determining if a system is time-invariant, computing convolution, sampling analog signals, sketching signals, and determining Fourier series coefficients.

    Original Title

    assignment1_1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 10 questions about linear time-invariant systems and signal processing concepts such as sampling, convolution, and Fourier series. The questions cover topics like determining if a system is time-invariant, computing convolution, sampling analog signals, sketching signals, and determining Fourier series coefficients.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    57 views3 pages

    Assignment1 1

    Uploaded by

    ARUOS Soura
    The document contains 10 questions about linear time-invariant systems and signal processing concepts such as sampling, convolution, and Fourier series. The questions cover topics like determining if a system is time-invariant, computing convolution, sampling analog signals, sketching signals, and determining Fourier series coefficients.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Assignment1 Questions

    1. Is it true that the series interconnection of two linear, time-invariant systems is itself a linear, time-invariant system? Justify
    your answer.
    n
    2. Consider the signal x[n]  cos( ) . After what value of n the signal will repeat itself ? Suppose the fundamental frequency of x[n]
    4

    is increase by radians, how does the answer change?
    2

    3. Consider a signal x ( t )  sin( t ) . Suppose we need to convert this into its discrete representation. We keep the sampling
    7
    frequency to be f s  2f m . Let the first sample is taken at t=0. Can this signal be reconstructed from its sampled discrete
    version?

    4. Consider a system S with input x[n] and output y[n] related by :


    y[n]  x[n]{g[n]  g[n  1]},
    1. If g[n]  1 for all n, show that S is time-invariant
    2. If g[n]  n , show that S is not time invariant
    3. If g[n]  1  (1) , show that S is time invariant
    n
    5. Compute and plot the convolution, y[n]  x[n]  h[n] , where,
    1
    x[ n ]  ( )  n u[  n  1] and h[n]  u[n  1]
    3

    1 ,0  n  7
    6. Let, x[ n ]  
    0 ,8  n  9

    be a periodic signal with fundamental period N=10 and Fourier series coefficients 𝑎𝑘 . Also, let,
    g[n]  x[n]  x[n  1]

    a. Show that g[n] has a fundamental period of 10.


    b. Determine the Fourier series coefficients of g[n].

    7. Consider an analog sinusoidal signal denoted by


    𝑥𝑎 𝑡 = 3 cos 2000𝜋𝑡 + 5 𝑠𝑖𝑛 6000𝜋𝑡 + 10 cos 12000𝜋𝑡
    (a) What is the Nyquist Rate?
    (b) To discretize, say sampling frequency (𝐹𝑆 ) as 5KHz has been taken. Compute the discrete signal and comment accordingly
    if there any changes occur in the signal.
    8. A discrete signal x(n) is shown in Fig.1. Sketch and label each of the following signals, where u(n) is unit step function.
    a) 𝑦 𝑛 = 𝑥 𝑛 𝑢(1 − 𝑛)
    b) 𝑦 𝑛 = 𝑥 𝑛 [𝑢 𝑛 + 2 − 𝑢(𝑛)]

    9. Given the linear systems


    a) 𝑦 𝑛 = 2𝑥(𝑛 − 5)
    b) 𝑦 𝑛 = 2𝑥(3𝑛)
    determine whether each of the above systems is time invariant.

    10 . Compute the convolution y(n) = x(n) * h(n) when,


    𝑥 𝑛 = 𝛼𝑛𝑢 𝑛 ; 0 < 𝛼 < 1
    h 𝑛 = 𝛽𝑛 𝑢 𝑛 ; 0 < 𝛽 < 1
    Assume that α and β are not equal.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy