4 views

Uploaded by Mehta Sparsh

Dsp problems

- Mastering Basics of Digital Signal Processing-modified
- Discrete Fourier Transform
- Dsp
- LOWPASS FIR FILTER USING HAMMING WINDOW
- dft properies.pdf
- DSP-ICT3105- Lec01.pptx
- Dsp QB
- 346239258 Network Analysis Van Valkenburg Free eBook PDF
- TE.Electrical.09.pdf
- Realization of Narrowband Multistage Filters Using Low-Pass Branch of Complementary IIR Filter Pairs with Pipelining-Interleaving
- M.Tech PE, Courses R17 Course Structure & Syllabus.pdf
- Discrete Time Systems and Signal Processing - Lecture Notes, Study Material and Important Questions, Answers
- block lms
- IJETTCS-2013-10-16-045
- Srr320402 Digital Signal Processing
- 2 Simulation of 16QAM Systems
- Fourier Series and Spectra
- r05311101 Digital Signal Processing
- Filtros FIR - Ejemplos de Diseño
- Book Reviews Electronic & Power 1979

You are on page 1of 7

Unit 1 & 2

1. Define DFT and IDFT of a discrete time sequence. 2

2. Compare and contrast between DTFT and DFT 3

3. List properties of DFT and explain any four 6

4. Relationship between DFT,DTFT and Z-transform 6

5. Starting with DTFT spectra, derive the equation of DFT and also explain 6

how any discrete signal can be recovered from obtained DFT spectra.

6. What is zero padding? What are its uses? 2

7. What is FFT? Why FFT is needed? 2

DFT using Radix-2 FFT

9. Describe the following terms in the context of FFT 6

1.Twiddle factor

2.Butterfly operation

10. Design a low pass Butterworth filter using bilinear transformation 10

method for satisfying the following constraints:

Pass band w p = 0.162 rad, Stop band w s = 1.63 rad, Passband

ripple: 3dB, Stop band ripple: 30dB and sampling frequency 8 kHz.

11. Find the number of complex multiplications and complex additions 5

Required in the direct computation of 1024 point DFT. How many

complex multiplications and complex additions will be required using

FFT algorithm?

12. 3 5

For the analog transfer function H(S) = Determine H (Z),

( s+1 ) (s +2)

using bilinear transformation method. Assume T =1 sec.

13. What is meant by radix-2 FFT 1

14. Find the DFT of a sequence x(n)=u(n)-u(n-3) 5

15. What is DIT algorithm? Explain in detail 6

16. What is DIF algorithm? Explain in detail 6

17. What are the applications of FFT algorithm? Explain in detail 6

18. Distinguish between linear convolution and circular convolution of two 3

sequences

19. If x(n)={3,1,5,4 ,2,1,0,1} ,Find the X(K) using DIF FFT algorithm 8

20. What are the differences and similarities between DIF and DIT 2

algorithms?

21. Consider the finite length sequence x(n)= δ(n) + δ(n-5) . find its 10 point 6

DFT. Also find the sequence y(n) that has DFT given by

2k 2π

−j

10

e X (K )

22. Determine circular convolution of x(n)={1,2,1,2} and y(n)= {3,2,1,4} 6

using DFT and IDFT

23. Determine circular convolution of x(n)={1,-1,-2,3,} and y(n)={3,2,1,4} 4

using concentric circle method.

24. Find the four point DFT of sequence x(n) ={0,1,2,3} using radix-2 DIT 4

FFT algorithm

25. Consider a real time speech signal processing at 8kHz sampling rate. The 6

processing is done using frame based analysis where one frame consists

of 1024 samples. The processing requires 1024 point DFT and 1024

point IDFT and other operations. If the processor takes 1us for each real

multiplication, how much time is left for other operations in processing?

Assume that DFT and IDFT require same number of multiplication using

radix-2 FFT.

26. Obtain the direct form form-I, cascaded and parallel form structure for Each 8

the following systems.

3 1 1

(1) y(n)= y(n-1)- y(n-2)+x(n)+ x(n-1)

4 8 3

(2) y(n)=-0.1y(n-1)+0.72y(n-2)+0.7x(n)-0.25 x(n-2)

1 1

(3) y(n)= y(n-1) + y(n-2) +x(n)+x(n-1)

2 4

27. Obtain cascaded and parallel realization of system 6

2 (z+2)

H(z)=

z ( z−0.1 ) ( z+ 0.5 ) (z +0.4)

28. Obtain direct form I & II, cascade and parallel form structures for the 8

given system

y(n) = ½ y(n-1) + ¼ y(n-2) + x(n) + x(n-1)

29. Which types of structures are used to realize IIR systems? Explain any 6

one in detail.

30. Consider the filter having difference equation y(n)=0.9y(n-1) + bo x(n) 6

find (i) Is this filter is lowpass,highpass or bandpass? (ii) Determine

bo so that |H ( π )| =1. (iii) Determine the 3-dB cutoff frequency.

31. Describe bilinear transformation method of IIR filter design 6

32. How will you perform linear convolution from circular convolution? 2

33. What are the properties of twiddle factor? 4

34. Determine the DFT of the sequence x(n)= { 1,2,3,4} and also verify 8

result by finding IDFT of the obtained DFT.

35. Find the DFT of a sequence x(n)=u(n)-u(n-3) 4

36. 6 πn 4

Compute 16 point DFT of sequence x(n)= cos ( )

16

; 0≤ n ≤ 15

37. x(t) = 4 cos(100πt) is sampled at twice the nyquist rate for one full 6

period. Find out its DFT.

38. Determine DFT of x(n)= {1,2,3,4} and verify the answer by finding 8

IDFT using matrix method

39. Determine circular convolution of x(n)={1,-1,-2,3,} and y(n)={3,2,1,4} 5

using concentric circle method

40. X(n)={1,-1,-1,-1,1,1,1,-1} find 8 point DFT using (1) DIT radix-2 (2) Each 8

DIF radix-2 FFT algorithm

41. Which types of structures are used to realize IIR systems? Explain any 4

one in detail.

42. Write the steps in designing chebyshev filter? 2

43. Write down the steps for designing a Butterworth filter? 2

44. Explain with derivation Impulse Invariance approach for implementing 6

digital IIR filter. State some limitations of this approach and also briefly

discuss solution to overcome such limitations

46. −1 6

If x(n)= ¿ ,0≤n≤3. Find DFT of the sequence x(n) and of the

¿

¿

sequence x (n−2)4 .

47. If x(n)={3,1,5,4 ,2,1,0,1} ,Find the X(K) using DIT/DIF FFT algorithm Each 8

48. 6

Compute X(k) using decimation in time FFT algorithm, If x(n)= cos ( πn2 )

where N=4 using decimation in time FFT algorithm

49. If X(K)= {17,-1.12-j.7.12, j3, 3.121+j2.87 ,3, 3.12-j2.87 ,-j3 ,-1.12+j7.12} Find Each 8

x(n) by using decimation in time /Decimation in Frequency IFFT algorithm

50. Develop decimation in time FFT algorithm for evaluation DFT when 10

N=6=2*3,and evaluate the DFT for x(n)={2,1,3,1,4,1}

51. Develop decimation in time FFT algorithm for evaluation DFT when 10

N=6=3*2,and evaluate the DFT for x(n)={2,1,3,1,4,1}

52. x(t) = 4cos(100πt) is sampled at twice the nyquist rate for one full period. 8

Find out its DFT.

53. Explain inverse radix-2 FFT algorithm 6

54. Explain with example how number of multiplication is reduced in radix-2 DIT 5

FFT algorithm

55. Design a low pass Butterworth filter using bilinear transformation method 10

/Impulse invariant method for satisfying the following constraints:

Pass band w p = 0.162 rad, Stop band w s = 1.63 rad, Passband ripple :

3dB,Stop band ripple : 30dB and sampling frequency 8 kHz.

56. Design a low pass butterworth filter using bilinear transformation/ Impulse 10

invariant method for satisfying following constraints: Pass band 0-400 Hz,

Stop band 2.1-4 kHz, Pass band ripple 2dB, Stop band attenuation 20 dB and

sampling frequency 10 kHz,

57. Design a low pass butterworth filter using bilinear transformation/ Impulse 10

invariant method for satisfying following constraints:

0.75≤ |H (e jw )| ≤ 1 where 0≤ w ≤ 0.25π

|H (e jw )| ≤ 0.23 0.63π ≤ w ≤ π and sampling frequency is 8

kHz.

58. Derive the equation of finding filter order and cutoff frequency for a 6

Butterworth filter

59. Obtain cascaded and parallel realization of system 5

2 (z+2)

H(z)=

z ( z−0.1 ) ( z+ 0.5 ) (z +0.4)

60. Determine the system function of 2nd order Chebyshev-I lowpass filter. Suppose 4

Ωc & A p = 1 dB.

a0 =1 .1025 & a1 =1 .0977

61. Design a lowpass Chebyshev-I filter to satisfy : 8

4

Passband cutoff : Ωc =2 π ×10 rad/s ,Passband ripple A p = 1 dB,

A s =15 dB

a =0 . 2756 ， a1=0.7426 , a 2=1 . 4539 , a3 =0 .9528 )

( 0

62. 2 4

H a ( s )= 2

Transform s + 4 s+3 into a digital filter using the impulse

invariance/bilinear transformation method in which T=1

63. Obtain the direct form I & II structure for the following system 5

3 1 1

(4) y(n)= y(n-1)- y(n-2)+x(n)+ x(n-1)

4 8 3

64. Design low pass FIR filter for N=5 and w c =0.5 radian 10

65. Design a low pass butterworth filter using bilinear transformation/ 10

Impulse invariant method for satisfying following constraints:

0.75≤ |H (e jw )| ≤ 1 where 0≤ w ≤ 0.25π

|H (e )| ≤ 0.23

jw

0.63π ≤ w ≤ π and sampling frequency

is 8 kHz.

66. Design low pass filter for the following desired frequency response using 10

rectangular, hamming and hanning window.

π

H d ( e jw ) = e− jw 3 0≤ |w| ≤

3

π

=0 ≤ |w| ≤ π

3

67. Derive the transfer function equation for converting analog transformation to 4

digital transformation

68. Derive the equation of finding filter order and cutoff frequency for a 6

Butterworth filter.

69. Draw the structures of the following discrete time system defined by the 8

difference equation

y(n) -y(n-1) + y(n-2) = x(n) + x(n-1)

(i) Direct Form -I

(ii) Direct Form- II

(iii) Cascade Form

70. Explain with derivation Impulse Invariance approach for implementing digital 6

IIR filter. State some limitations of this approach and also briefly discuss

solution to overcome such limitations

71. 2 5

H a ( s )= 2

Transform s + 4 s+ 4 into a digital filter using the impulse

invariance/bilinear transformation method in which T=1

72. 3 5

For the analog transfer function H(S)= ,Determine H(Z) ,using

( s+1 ) (s +2)

bilinear transformation method. Assume T =1 sec.

73. Draw Direct form-I and Direct form-II realizations for any IIR system. 6

74. Draw the structures of the following discrete time system defined by the 8

difference equation

y(n) -y(n-1) + y(n-2) = x(n) + x(n-1)

(i) Direct Form -I

(ii) Direct Form- II

(iii) Cascade Form

Impulse invariant method for satisfying following constraints:

0.70≤ |H (e jw )| ≤ 1 where 0≤ w ≤ 0.25π

|H (e )| ≤ 0.30

jw

0.63π ≤ w ≤ π and sampling frequency

is 8 kHz

Unit 3 & 4

76. What is an FIR filter? What are the advantage and disadvantage of FIR filter? 6

77. What do you understand by linear phase FIR filter? What conditions are to be 6

satisfied by the impulse response of an FIR system to have a linear phase?

78. Explain Gibbs phenomenon. What are the effects of windowing? 6

79. Explain the procedure for designing FIR filter using windows. 6

80. Design low pass FIR filter for N=5 and w c =0.5 radian 8

81. Design low pass FIR filter for N=4 and w c =0.4 radian 8

82.

83. Design low pass filter for the following desired frequency response using 10

rectangular, hamming and hanning window.

π

H d ( e jw ) = e− jw 3 0≤ |w| ≤

3

π

=0 ≤ |w| ≤ π

3

84. Design high pass FIR filter for N=5 and w c =1.5 radian 8

85. Design high pass FIR filter for N=4 and w c =1.4 radian 8

86. Design band reject FIR filter for N=5, w c1 =0.5 radian and w c2 =0.75 10

radian using rectangular,Hamming and Hanning window.

87. Digital FIR lowpass filter for following constraints : 10

Ωsample =2 π×1 .5×104 ( rad /sec )

Ω p =2 π ×1 .5×103 (rad /sec )

Ωs =2 π×3×103 ( rad /sec )

A s=50 dB

88. Design a digital FIR high pass filter for following constraints 8

ω s =0 . 4 π , A s =60 dB

ω p =0 .6 π , R p =0. 5 dB

ω s1=0.2π , A s 1=60 dB ω p2 =0 . 65π , R p 2 =1 dB

ω p1=0.35π , R p 1=1 dB ω s2 =0 . 8π , A s2 =60 dB

90. Design a digital FIR bandstop filter 8

ω p1 =0.3π , R p 1=0.5 dB ω s2 =0 .6π , A s2 =40 dB

ωs1 =0. 4 π , A s 1 =40 dB ω p2 =0 .7π , R p 2 =0.5 dB

92. Design of linear phase FIR filter using frequency sampling method. 6

93. What are the architectural features of a digital signal processor that 6

distinguishes from microprocessor?

94. Explain Harvard Architecture for Digital Signal Processor with their key 6

features in detail

95. Enlist the silent features of TMS 320C67113 Processor. 6

96. Draw and explain functional block diagram of TMS3206713 8/10

97. Explain multiplier- Accumulator (MAC) hardware in DSP processors 6

1. Harvard architecture of DSP processor.

2. Hanning Window and Kaiser Window Functions

1.Twiddle factor

2.Butterfly operation

3.Decimation in time and decimation in frequency

Required in the direct computation of 1024 point DFT. How many

complex multiplications and complex additions will be required using

FFT algorithm?

101. Describe the advantages and disadvantages of FIR filter over IIR filter 6

102. Explain Harvard Architecture for Digital Signal Processor with their key 6

features in detail

103. What are the architectural features of a digital signal processor that 10

distinguishes from microprocessor? Explain Harvard Architecture

- Mastering Basics of Digital Signal Processing-modifiedUploaded byjameelahmad
- Discrete Fourier TransformUploaded byMahesh Abnave
- DspUploaded bytitus9605121
- LOWPASS FIR FILTER USING HAMMING WINDOWUploaded byDeepthi Prabhakaran
- dft properies.pdfUploaded byArchana Tiwari
- DSP-ICT3105- Lec01.pptxUploaded byJaber Al Nahian
- Dsp QBUploaded byMalleesvari Senthil Kumar
- 346239258 Network Analysis Van Valkenburg Free eBook PDFUploaded byNaveen Kumar
- TE.Electrical.09.pdfUploaded byAmit Dost
- Realization of Narrowband Multistage Filters Using Low-Pass Branch of Complementary IIR Filter Pairs with Pipelining-InterleavingUploaded bynst
- M.Tech PE, Courses R17 Course Structure & Syllabus.pdfUploaded bymanohar
- Discrete Time Systems and Signal Processing - Lecture Notes, Study Material and Important Questions, AnswersUploaded byM.V. TV
- block lmsUploaded byvpkkvinoth
- IJETTCS-2013-10-16-045Uploaded byAnonymous vQrJlEN
- Srr320402 Digital Signal ProcessingUploaded byandhracolleges
- 2 Simulation of 16QAM SystemsUploaded byKhaya Khoya
- Fourier Series and SpectraUploaded byHarshit Goyal
- r05311101 Digital Signal ProcessingUploaded bySrinivasa Rao G
- Filtros FIR - Ejemplos de DiseñoUploaded byGabriel Hi
- Book Reviews Electronic & Power 1979Uploaded byspawn1984
- Mat Lab IntroUploaded bySaeed Mahmood Gul Khan
- 2756_1Uploaded byjagadeesh jagade
- dspworkshop_part2_2009Uploaded byBulli Koteswararao
- Lecture 19Uploaded byAlamgir Ahmad Khattak
- Bput 5th semester syllabusUploaded bySaisankar Gochhayat
- VLSI Implementation of Cascaded Integrator Comb Filters for DSP ApplicationsUploaded byDr. Rozita teymourzadeh, CEng.
- bmsyllUploaded byanand_gudnavar
- 13vol4no2Uploaded byImad A Shaheen
- Filter StructuresUploaded byhari4singa
- Dual-Tone Multiple Frequency (DTMF) Detector ImplementationUploaded byVibhav Kumar

- dsp-for-matlab-and-labview_1.pdfUploaded byasamarah
- DIGITAL FILTERSUploaded byapi-19951707
- M.E. (Civil - Structures)Uploaded byPedro Daniel Perez Prieto
- FUNDAMENTALS OF EEG MEASUREMENTUploaded byfiziomar8
- Ch9(1)Handouts_3eUploaded byFelipe Dias
- Control Systems r13 mtechUploaded bySal Excel
- digfiltUploaded byapi-3774180
- Designing a FIR filterUploaded byAnirban Samanta
- Vlsi Dsp Fir FinalUploaded byDHRUV KHULLAR
- BE compUploaded byMayur Patil
- Concepts of fsdsdfSignal & Image ProcessingUploaded byPrahlad Reddy
- mtechvlsi230209Uploaded byJinu Madhavan
- Active Noise and Vibration Control System Designaccess_hereUploaded byRavi Khandelwal
- Selected Answers Ch 1-8Uploaded byJawahar Reddy VengaReddy
- Algreer 12Uploaded byDev Vishnu
- 06703776Uploaded byelamaran_vlsi
- DSP Lab ManualUploaded bySravanthi Rajigari
- Digital Power System ProtectionUploaded byVikash Kumar
- Frenso StateUploaded bytaruntejv
- Ehlers - Non Linear FiltersUploaded byGanugio Miriani
- Book - McCllelan - Signal Processing First 2003Uploaded byFiaz Khan
- Col10598 - Digital Signal Processing and Digital Filter Design (Draft) (C. Sidney Burrus)Uploaded bybubulescu
- BE ECE Curriculum-2004 Full TimeUploaded bySaravana Sams
- understanin_digital_signal_processing (1)Uploaded byjobinvcm
- Sem 6Uploaded bySanket Shetye
- CSE THIRD YEAR SYLLABUSUploaded byPRIYA RAJI
- Mitra AddEx Ch13Uploaded byHiron Bose
- QMFUploaded byffgg
- Dsp Tut SolutionsUploaded byDunfrey Aragão
- 08.508 DSP Lab Manual Part-AUploaded byAssini Hussain