Scribd
Upload
93 views5 pages

2 Marks

The document contains 20 questions related to signals and systems, discrete time signals, discrete Fourier transforms, and digital filters. Some of the key questions answered include: - A discrete time signal with the input-output relation y[n]= rnx[n] is time-variant. - The number of multiplication terms required for DFT by the expressional method is n^2, while for FFT the number is N/2 log N. - The order of a Butterworth filter is given by N=log (λ /€) 1/2/log (1/k) 1⁄2. - The transfer function of the Butterworth filter is given by H (jΏ) =1

Uploaded by

Surya arasu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
93 views5 pages

2 Marks

The document contains 20 questions related to signals and systems, discrete time signals, discrete Fourier transforms, and digital filters. Some of the key questions answered include: - A discrete time signal with the input-output relation y[n]= rnx[n] is time-variant. - The number of multiplication terms required for DFT by the expressional method is n^2, while for FFT the number is N/2 log N. - The order of a Butterworth filter is given by N=log (λ /€) 1/2/log (1/k) 1⁄2. - The transfer function of the Butterworth filter is given by H (jΏ) =1

Uploaded by

Surya arasu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

1.

Is a discrete time signal described by the input output relation y[n]= rnx[n]
time invariant.
Ans:
A signal is said to be time invariant if R{x[n-k]}= y[n-k] R{x [n-k]} =R(x[n]) /
x[n]→x[n-k]
=rnx [n-k] ---------------- (1)
Y [n-k] =y[n] / n→n-k
=rn-kx [n-k] ------------------- (2)
Equations (1) ≠Equation (2)
Hence the signal is time variant.

2. Determine the convolution sum of two sequences x (n) = {3, 2, 1, 2} and


h (n) = {1, 2, 1, 2} Ans:
y(n) = {3,8,8,12,9,4,4}
Find the convolution of the signals x(n) = 1 n=-2,0,1
= 2 n=-1
= 0 elsewhere.
Ans:
y(n) = {1,1,0,1,-2,0,-1}

3. Detemine the solution of the difference equation


y(n) = 5/6 y(n-1) – 1/6 y(n-2) + x(n) for x(n) = 2n u(n)
Ans:
y(n) = -(1/2)n u(n) + 2/3(1/3)n u(n)+8/5 2nu(n)

4. Determine the response y(n), n>=0 of the system described by the second
order difference equation y(n) – 4y(n-1) + 4y(n-2) = x(n) – x(n-1) when the
input is x(n) = (-1)n u(n) and the initial condition are y(-1) = y(-2)=1.
Ans:
y(n) = (7/9-5/3n)2n u(n) +2/9(-1)n u(n)

5. How many multiplication terms are required for doing DFT by


expressional method and FFT METHOD?
Ans:
Expression –n2 FFT N /2 log N

IIR and FIR filters

6. Write the expression for order of Butterworth filter? Ans:


The expression is N=log (λ /€) 1/2/log (1/k) ½
7. Write the expression for the order of chebyshev filter? Ans:
N=cosh-1(λ /e)/cosh-1(1/k)

8. State the equation for finding the poles in chebyshev filter.


Ans:
sk=acos¢k+jbsin¢k,where ¢k=∏/2+(2k-1)/2n)∏

9. State the steps to design digital IIR filter using bilinear method
Ans:
Substitute s by 2/T (z-1/z+1), where T=2/Ώ (tan (w/2) in h(s) to get h (z)

10. Give the bilinear transform equation between s plane and z plane.
Ans:
s=2/T (z-1/z+1)

11. By impulse invariant method obtain the digital filter transfer function and
the differential equation of the analog filter h(s) =1/s+1
Ans:
H (z) =1/1-e-Tz-1
Y/x(s) =1/s+1
Cross multiplying and taking inverse lap lace we get, D/dt(y(t)+y(t)=x(t)

12. Give the Butterworth filter transfer function and its magnitude
characteristics for different orders of filter.
Ans:
The transfer function of the Butterworth filter is given by
H (jΏ) =1/1+j (Ώ/Ώc) N

13. Give the magnitude function of Butterworth filter.


Ans:
The magnitude function of Butterworth filter is
2N 1/2
|h(jΏ)=1/[1+(Ώ/Ώc) ]
,N=1,2,3,4,….
Part B

14. Determine the DFT of the sequence x(n) =1/4, for 0<=n <=2
0, otherwise
Ans: The N point DFT of the sequence x(n) is defined as
N-1
-j2πnk/N
x(k)= ∑ x(n)e
n=0
K=0,1,2,3,…N-1
x(n) = (1/4,1/4,1/4)
X(k) = ¼ e-j2πk/3
[1+2cos(2πk/3)] where k= 0,1,……….,N-1

15. Derive the DFT of the sample data sequence x(n) = {1,1,2,2,3,3}and
compute the corresponding amplitude and phase spectrum.
Ans: The N point DFT of the sequence x(n) is defined as
N-1
-j2πnk/N
X(k)= ∑ x(n)e
n=0
X(0) = 12
X(1) = -1.5 + j2.598
X(2) = -1.5 + j0.866
X(3) = 0
X(4) = -1.5 – j0.866
X(5) =-1.5-j2.598
K=0,1,2,3,…N-1
X(k) = {12, -1.5 + j2.598, -1.5 + j0.866,0, -1.5 – j0.866, -1.5-j2.598}
|X(k)|={12,2.999,1.732,0,1.732,2.999}
∟X(k)={0,- π/3,- π/6,0, π/6, π/3}

16. Given x(n) = {0,1,2,3,4,5,6,7} find X(k) using DIT FFT


algorithm.
Ans: Given N = 8
0
WNk = e-j(2π/N)k
W81
W82
W83
W8
=1
=0.707-j0.707
= -j
= -0.707-j0.707
Using butterfly diagram
X(k) = {28,-4+j9.656,-4+j4,-4+j1.656,-4,-4-j1.656,-4-j4,-4-j9.656}

17. Given X(k) = {28,-4+j9.656,-4+j4,-4+j1.656,-4,-4-j1.656,-4-j4,-4-j9.656} ,find


x(n) using inverse DIT FFT algorithm.
Ans:
WNk = ej(2π/N)k
8
W0=1
1
W82 =0.707+j0.707
W83 = j
W8 = -0.707+j0.707
x(n) = {0,1,2,3,4,5,6,7}

18. Find the inverse DFT of X(k) = {1,2,3,4} Ans: The inverse DFT is defined as
N-1
j2πnk/N
x(n)=(1/N ) ∑ x(k)e
k=0
n=0,1,2,3,…N-1
x(0) = 5/2
x(1) = -1/2-j1/2 x(2) = -1/2
x(3) = -1/2+j1/2
x(n) = {5/2, -1/2-j1/2, -1/2, -1/2+j1/2}

19. Consider the transfer function H(Z)=H1(Z)H2(Z) where H1(Z) =1/1- a1Z-1
H2(z) =1/ 1-a2Z-1
Find the o/p Round of noise power Assume a1=0.5 and a2= 0.6 and find o.p
round off noise power.
Draw the round of Noise Model. By using residue method find σ01
By using residue method find σ
02 = σ 01 2+ σ 02 2
2 –2b (5.43)
Ans:
12

20. Find the inverse DFT of X(k) = {3,4,5,6} Ans: The inverse DFT is defined as
N-1
j2πnk/N
x(n)=(1/N ) ∑ x(k)e
k=0
n=0,1,2,3,…N-1

You might also like