Anna University Coimbatore 2010 B.E Electronics & Communication Engineering -digital signal processing - Question Paper
ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE B.E. I B.TECH. DEGREE EXAMINATIONS : NOV I DEC 2010 REGULATIONS : 2007 & 2008 FIFTH SEMESTER 070290037/080290029 - DIGITAL SIGNAL PROCESSING (COMMON TO ECE I MEDICAL ELECTRONICS)
TIME: 3 Hours Max. Marks:-100
PART - A |
(20 x 2 = 40 MARKS) ANSWER ALL QUESTIONS |
1. Calculate the number of multiplications needed to compute DFT of 64 point sequence using direct method and FFT algorithm.
2. Draw a 2 point DIT - FFT butterfly structure.
3. What are the applications of FFT algorithm?
4. Define DFT pairs.
5. List any two advantages of FIR filters.
6. Mention some realization methods available to realize FIR filter.
7. Mention some design methods available to design FIR filter.
8. What are the desirable characteristics of window function?
9. Give the square magnitude function of Butterworth filter.
10. Give the expression for location of poles of normalized Butterworth filter.
11. Obtain the digital transfer function for the given analog transfer
function by using impulse invariant technique with
T = 1 sec.
l
12. How many multipliers, additions and delay elements are required to realize a system function having M zeros & N poles in direct form-l and direct form - II.
13. What are the three quantization errors due to finite word length registers in digital filters?
14. What are the different quantization methods?
15. What are the two kinds of limit cycle behavior in DSP?
16. Give the expression for signal to quantization noise ratio and calculate the improvement with an increase of 2 bits to the existing bits.
17. What are the classifications of digital signal processor?
18. What are the different stages in pipe lining?
19. List out the various registers used with ARAU.
20. Name some shift instructions in CSX.
PART - B
(5x12 = 60 MARKS)
ANSWER ANY FIVE QUESTIONS
. Find the output y(n) of a filter whose impulse response is h(n) = {1,1,1} and the input signal x(n) = {3,-1,0,1,3,2,0,1,2,-1} using overlap save method.
22. (a) Given x(n) = { 2"; 0 < n< 7} find X(K) using DIT - FFT algorithm,
(8)
(4)
(b) State and prove circular convolution property of DFT.
2
23. Determine the coefficients of a linear phase FIR filter of length N=15 has a symmetric unit sample response and a frequency response that satisfies the condition
24. Design a LPF using window technique to meet the following constraints.
0 < |U)| < u}
Use a Hamming window of length 7. Realize the designed filter with minimum number of multipliers.
25. Design a digital Butterworth filter that satisfy the constraints
0.707 < | Hi (e>")| <1 0 < o) < |
Using bilinear transformation technique with T = 1sec. Realize the designed filter with canonic form structure.
20 Design a digital Chebyshev filter to meet the constraints 0.707 < <1 0 < < 0.2 n
0 < |Hd()| <0.1 0.5 h < a) < 7i
By using bilinear transformation and assume sampling period T = 1 sec. Realize the designed filter with direct form - I structure.
27. Explain the characteristics of a limit cycle oscillation with respect to the system described by the difference equation
y(j0 = 0.95 y(n 1) + Calculate the dead band of the filter.
Explain the architecture of TMS320C50 with neat functional block diagram.
ENQ*****
4
|
Attachment: |
| Earning: Approval pending. |
