What is the expression to compute yk(n) recursively? – McqOptions

MCQOPTIONS

1.	What is the expression to compute y_k(n) recursively?
A.	y<sub>k</sub>(n)=W<sub>N</sub><sup>-ky</sup><sub>k</sub>(n+1)+x(n)
B.	y<sub>k</sub>(n)=W<sub>N</sub><sup>-ky</sup><sub>k</sub>(n-1)+x(n)
C.	y<sub>k</sub>(n)=W<sub>N</sub>ky<sub>k</sub>(n+1)+x(n)
D.	None of the mentioned
Answer» C. y<sub>k</sub>(n)=W<sub>N</sub>ky<sub>k</sub>(n+1)+x(n)

Discussion

No Comment Found

Related MCQs

How many complex multiplications are need to be performed to calculate chirp z-transform?(M=N+L-1)
How many multiplications are required to calculate X(k) by chirp-z transform if x(n) is of length N?
If the contour is a circle of radius r and the z<sub>k</sub> are N equally spaced points, then what is the value of z<sub>k</sub>?
What is the equation to compute the values of the z-transform of x(n) at a set of points {zk}?
What is the expression to compute y<sub>k</sub>(n) recursively?
What is the system function of the filter with impulse response h<sub>k</sub>(n)?
If y<sub>k</sub>(n) is the convolution of the finite duration input sequence x(n) of length N, then what is the impulse response of the filter?
According to Goertzel Algorithm, if the computation of DFT is expressed as a linear filtering operation, then which of the following is true?
What is the transform that is suitable for evaluating the z-transform of a set of data on a variety of contours in the z-plane?
If the desired number of values of the DFT is less than log<sub>2</sub>N, a direct computation of the desired values is more efficient than FFT algorithm.