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

MCQOPTIONS

1.	What is the expression to compute yk(n) recursively?
A.	yk(n)=WN-kyk(n+1)+x(n)
B.	yk(n)=WN-kyk(n-1)+x(n)
C.	yk(n)=WNkyk(n+1)+x(n)
D.	None of the mentioned
Answer» C.

Discussion

No Comment Found

Related MCQs

If the contour on which the z-transform is evaluated is as shown below, then which of the given condition is true?
If the contour is a circle of radius r and the zk are N equally spaced points, then what is the value of zk?
What is the expression to compute yk(n) recursively?
What is the system function of the filter with impulse response hk(n)?
If yk(n) is the convolution of the finite duration input sequence x(n) of length N, then what is the impulse response of the filter?
If the desired number of values of the DFT is less than log2N, a direct computation of the desired values is more efficient than FFT algorithm.