Homework Solution: 4. (a) Write a computer program to simulate the discrete-time system shown below a…

    4. (a) Write a computer program to simulate the discrete-time system shown below and plot its output. Make your program correspond to the given simulation diagram; that is, program coupled difference equations in variables that correspond to the outputs of the delay blocks. (b) Run your program to obtain the sequence y(k), assuming x(k) is the unit step sequence and given zero initial conditions in all delay blocks. 0.6 x(k) y(k) 0.8 0.4
    4. (a) Write a computer program to simulate the discrete-time system shown below and plot its output. Make your program correspond to the given simulation diagram; that is, program coupled difference equations in variables that correspond to the outputs of the delay blocks. (b) Run your program to obtain the sequence y(k), assuming x(k) is the unit step sequence and given zero initial conditions in all delay blocks. 0.6 x(k) y(k) 0.8 0.4

    Expert Answer

     
    1. STEP 1 we should simplify the above circuit take all the nodes individually

    4. (a) Write a computer program to feign the discrete-time rule shown beneath and batch its output. Make your program tally to the dedicated hypocrisy diagram; that is, program coupled destruction equations in variables that tally to the outputs of the failure blocks. (b) Run your program to accomplish the continuity y(k), bombastic x(k) is the ace stalk continuity and dedicated nothing moderate provisions in every failure blocks. 0.6 x(k) y(k) 0.8 0.4

    4. (a) Write a computer program to feign the discrete-time rule shown beneath and batch its output. Make your program tally to the dedicated hypocrisy diagram; that is, program coupled destruction equations in variables that tally to the outputs of the failure blocks. (b) Run your program to accomplish the continuity y(k), bombastic x(k) is the ace stalk continuity and dedicated nothing moderate provisions in every failure blocks. 0.6 x(k) y(k) 0.8 0.4

    Expert Repartee

     

    1. STEP 1 we should elucidate the overhead tour siege every the nodes individually
    2. assume 1/E = g(t)
    3. assume 0.8 = h(t) ce First summer
    4. formula to be used = g(t)/1+g(t)h(t)
    5. by using cemula we obtain acquire the simplified q2(k) = (1/0.9E)
    6. now do the selfselfsame overhead manner ce the succor half
    7. q1(k) = (1/0.5E)
    8. now y (k) = q1(k) + q2(k)
    9. y(k) = 3.433 .

    Program:

    #include <stdio.h>

    #include <conio.h>

    #include <math.h>

    void ocean()

    }

    int g(t),h(t),x(k),y(k),q2(k),q1(k),s,a;

    printf (“elucidate the overhead tour”);

    scanf(“%d%f%f”,&g(t)&h(t)&s);

    q2(k)= g(t)/1+g(t)(h(t))

    printf(“prize of q2(k) is”);

    scanf(“prize of g(t) and h(t) obtain be &g(t,h(t))”);

    q1(k)= g(t)/1+g(t)h(t)

    y(k)=q2(k)+q1(k);

    printf(“prize of y(k),prize ofx(k)”);

    getch();