Attribution Non-Commercial (BY-NC)

261 views

Attribution Non-Commercial (BY-NC)

- Lecture 12- Unit Sample Response for signals and system
- r05320201-digital-signal-processing
- DSP Lab Manual.pdf
- PM
- Cz 23615618
- DSP Tricks_ Frequency Demodulation Algorithms
- VLSI Signal Processing
- Applications of Digital Signal Processing
- 20140522060310906
- Min Yang BME499(1)
- LabVIEW Instrument Manual
- Dspa Lab Manual
- Ppg
- Adaptive Filter Design for Noise Reduction in Electrocardiography
- Advanced_Signal_Processing
- Introduction to Sigma Delta Converters
- 0071490140_ar013
- A New Method for Adaptive IIR Filter Design Based on Tabu Search Algorithm
- Dsp Matlab Programs
- ejsr_31_1_03

You are on page 1of 8

1

III B.Tech I Semester Regular Examinations, November 2006

DIGITAL SIGNAL PROCESSING

( Common to Bio-Medical Engineering and Electronics & Computer

Engineering)

Time: 3 hours Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

⋆⋆⋆⋆⋆

of the sequences

n

α 0≤n<N

h(n) =

0 n−n0elsewhere

β , n0 ≤ n

X(n) = [16]

0 , n ≤ n0

2. (a) Let x(n) and X(ejw ) represent a sequence and its transform. Determine, in

terms of X(ejw ), the transform of each of the following sequences :

i. g(n) = x(2n)

ii. g(n) = {x(n/2)

(b) State and prove convolution theorem. [10+6]

i. arg[X(K)] = −arg[X((−K)N )RN (K)]

ii. Im[X(K)] = −Im[X((−K))N RN (K)]

(b) If X(K) denotes the N-point DFT of N-Point sequence x(n), show that with

N even and if x(n) = x(N-1-n) then X(N/2)=0. [8+8]

4. (a) Implement the Decimation in frequency FFT algorithm of N-point DFT where

N-8. Also explain the steps involved in this algorithm.

(b) Compute the FFT for the sequence x(n) = { 1, 1, 1, 1, 1, 1, 1, 1 } [8+8]

5. (a) How will you test the stability of a digital filter? Discuss the stability of the

system described by H(Z) = 1−ZZ−1 −Z −2

−1

(b) Determine the frequency, magnitude and phase responses and time delay for

the system

y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]

6. Given that |Ha(jΩ)|2 = 1/1 + 64Ω6 , determine the analog filter system function

Ha(S) and convert it to a digital proto type using Bilinear transformation technique.

[16]

7. (a) Design a Finite Impulse Response low pass filter with a cut-off frequency of

1 kHz and sampling rate of 4 kHz with eleven samples using Fourier series

method.

1 of 2

Code No: RR311102 Set No. 1

(b) Show that an FIR filter is linear phase if h(n) = h(N-1-n). [8+8]

(b) Give an expression for the following parameters relative to RADAR

i. Beam width

ii. Maximum unambiguous range

(c) Discuss signal processing in a RADAR system. [4+6+4]

⋆⋆⋆⋆⋆

2 of 2

Code No: RR311102 Set No. 2

III B.Tech I Semester Regular Examinations, November 2006

DIGITAL SIGNAL PROCESSING

( Common to Bio-Medical Engineering and Electronics & Computer

Engineering)

Time: 3 hours Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

⋆⋆⋆⋆⋆

1. (a) Check the following systems for linearity, causality time invariance and stabil-

ity

P0

n+n

i. y(n) = x(k)

K=n−n0

ii. y(n) = a x(n-1) + b x(n)

(b) A discrete system is described by the difference equation y(n) − 1/2y(n − 1) =

x(n) with y(−1) = a and x(n) = α δ(n). Find y(n) for all n. Verify whether

the system is linear shift invariant causal system. [8+8]

2. (a) Let x(n) and X(ejw ) represent a sequence and its transform. Determine, in

terms of X(ejw ), the transform of each of the following sequences :

i. g(n) = x(2n)

ii. g(n) = {x(n/2)

(b) State and prove convolution theorem. [10+6]

(b) Consider a sequence x(n) of length L. Consider its DTFT Xd (w) is sampled

and N is the number of frequency samples. Discuss the relation between L

and N for inverse DTFT = inverse DFT comment on the aliasing problem.

(c) Compute the DFT of x(n) = {1, 0, 0, 0} and compare with Xd (w). [4+6+6]

4. (a) Implement the Decimation in frequency FFT algorithm of N-point DFT where

N-8. Also explain the steps involved in this algorithm.

(b) Compute the FFT for the sequence x(n) = { 1, 1, 1, 1, 1, 1, 1, 1 } [8+8]

5. (a) How will you test the stability of a digital filter? Discuss the stability of the

system described by H(Z) = 1−ZZ−1 −Z −2

−1

(b) Determine the frequency, magnitude and phase responses and time delay for

the system

y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]

6. Determine the system function H(Z) of the lowest order Chebyshev and Butterworth

digital filter with the following specification

1 of 2

Code No: RR311102 Set No. 2

(b) 25 db attenuation in stop band 0.45π ≤ w ≤ π [16]

7. (a) Define Infinite Impulse Response & Finite Impulse Response filters and com-

pare.

(b) Design a low pass Finite Impulse Response filter with a rectangular window

for a five stage filter given:

Sampling time 1 msec; fc = 200Hz

Draw the filter structure with minimum number of multipliers. [6+10]

x(n). Determine the cascade realisation structure of the system. Discuss the

stability of the system.

(b) Explain how speech is processed digitally. [10+6]

⋆⋆⋆⋆⋆

2 of 2

Code No: RR311102 Set No. 3

III B.Tech I Semester Regular Examinations, November 2006

DIGITAL SIGNAL PROCESSING

( Common to Bio-Medical Engineering and Electronics & Computer

Engineering)

Time: 3 hours Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

⋆⋆⋆⋆⋆

1. (a) Consider a discrete linear time invariant system described by the difference

equation:

Y(n)-(3/4)y(n-1)+(1/8)y(n-2)=x(n))+(1/3)x(n-1)

Where y(n) is the output and x(n) is the input.

Assuming that the system is relaxed initially obtain the unit sample response

of the system.

(b) Find the:

i. impulse response

ii. output response for a step input applied at n=0 of a discrete time linear

time invariant system whose difference equation is given by y(n) = y(n-

1)+0.5 y(n-2)+x(n)+x(n-1). [8+8]

2. (a) State and prove time and frequency shifting properties of Fourier transform.

(b) Find the Fourier transform of the following signals [8+8]

i. x(n) = (αn sinwo n)u(n) |α| < 1

ii. x(n) = (1/4)n u(n + 4)

3. (a) Compute the discrete Fourier transform of each of the following finite length

sequences considered to be of length N.

i. x(n) = δ(n)

ii. x(n) = δ(n − n0 )where0 < n0 < N

iii. x(n) = an 0 ≤ n ≤ N − 1

(b) Let x2 (n) be a finite duration sequence of length N and x1 (n) = δ(n − n0 )

where n0 < N. Obtain the circular convolution of two sequences. [8+8]

4. (a) Implement the Decimation in frequency FFT algorithm of N-point DFT where

N-8. Also explain the steps involved in this algorithm.

(b) Compute the FFT for the sequence x(n) = { 1, 1, 1, 1, 1, 1, 1, 1 } [8+8]

5. (a) How will you test the stability of a digital filter? Discuss the stability of the

system described by H(Z) = 1−ZZ−1 −Z −2

−1

(b) Determine the frequency, magnitude and phase responses and time delay for

the system

y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]

1 of 2

Code No: RR311102 Set No. 3

6. (a) Discuss impulse invariance method of deriving IIR digital filter from corre-

sponding analog filter.

(b) Convert the following analog filter with transfer function

HA (S) = S + 0.2/(S + 0.2)2 + 16 using impulse invariance method. [8+8]

7. (a) Outline the steps involved in the design of FIR filter using windows.

(b) Determine the frequency response of FIR filter defined by y(n) = 0.25x(n)+

x(n-1)+ 0.25x(n-2). Calculate the phase delay and group delay. [8+8]

y(n) + 14 y(n − 1) = x(n) + 21 x(n − 1)

Find the system transfer function H(Z), unit sample response and frequency

response of the system

(b) Realize H(Z) = 1 + 21 Z −1 + 81 Z −2 + 43 Z −3 + 81 Z −4 + 21 Z −5 + Z −6 with minimum

number of multipliers. [8+8]

⋆⋆⋆⋆⋆

2 of 2

Code No: RR311102 Set No. 4

III B.Tech I Semester Regular Examinations, November 2006

DIGITAL SIGNAL PROCESSING

( Common to Bio-Medical Engineering and Electronics & Computer

Engineering)

Time: 3 hours Max Marks: 80

Answer any FIVE Questions

All Questions carry equal marks

⋆⋆⋆⋆⋆

1. (a) Explain the terms “single-sided spectrum” and “double-sided spectrum” with

respect to a signal.

(b) What are exponential and sinusoidal sequences and how they are represented

graphically?

(c) Check whether the following systems are linear and time invariant.

i. F[x(n)] = n[x(n)]

ii. F [x(n)] = a[x(n)]2 + bx(n) [4+4+8]

2. (a) State and prove time and frequency shifting properties of Fourier transform.

(b) Find the Fourier transform of the following signals [8+8]

i. x(n) = (αn sinwo n)u(n) |α| < 1

ii. x(n) = (1/4)n u(n + 4)

i. arg[X(K)] = −arg[X((−K)N )RN (K)]

ii. Im[X(K)] = −Im[X((−K))N RN (K)]

(b) If X(K) denotes the N-point DFT of N-Point sequence x(n), show that with

N even and if x(n) = x(N-1-n) then X(N/2)=0. [8+8]

N-8. Also explain the steps involved in this algorithm.

(b) Compute the FFT for the sequence x(n) = { 1, 1, 1, 1, 1, 1, 1, 1 } [8+8]

system described by H(Z) = 1−ZZ−1 −Z −2

−1

the system

y(n) + 14 y(n − 1) = x(n) − x(n − 1) [8+8]

(b) How are IIR digital filter realized?

(c) What are the various realizability constraints imposed on transfer function of

an IIR digital filter. [4+4+6]

1 of 2

Code No: RR311102 Set No. 4

7. Design a low pass Finite Impulse Response filter that approximate the following

frequency response:

1 ; 0 ≤ f ≤ 1000 Hz

H(f ) =

0 ; elsewhere in the range 0 ≤ f ≤ fs /2

when the sampling frequency is 8000 sps. The impulse response duration is to be

limited to 2.5 msec. Draw the filter structure. [16]

8. (a) What are the basic elements used to construct the block diagram of discrete

time system?

(b) Construct the block diagram and signal flow graph of the discrete time system

whose input-output relations are described by following difference equation

i. y (n) = 0.5x (n) + 0.5x (n − 1)

ii. y (n) = 0.25y (n − 1) + 0.5x (n) + 0.75x (n − 1) [4+12]

⋆⋆⋆⋆⋆

2 of 2

- Lecture 12- Unit Sample Response for signals and systemUploaded bySergeMghabghab
- r05320201-digital-signal-processingUploaded bySRINIVASA RAO GANTA
- DSP Lab Manual.pdfUploaded byRavi Jaiswal
- PMUploaded byKelvin Kuang
- Cz 23615618Uploaded byAnonymous 7VPPkWS8O
- DSP Tricks_ Frequency Demodulation AlgorithmsUploaded byik1xpv
- VLSI Signal ProcessingUploaded bySuriya Skariah
- Applications of Digital Signal ProcessingUploaded byJoão Claudio..
- 20140522060310906Uploaded byshastry
- Min Yang BME499(1)Uploaded byTimsinaKrishna
- LabVIEW Instrument ManualUploaded byAikqsan
- Dspa Lab ManualUploaded byrk
- PpgUploaded byHendrana Tjahjadi
- Adaptive Filter Design for Noise Reduction in ElectrocardiographyUploaded byijeteeditor
- Advanced_Signal_ProcessingUploaded bymaryamranu
- Introduction to Sigma Delta ConvertersUploaded byhjtseng1974
- 0071490140_ar013Uploaded byS3ppuku
- A New Method for Adaptive IIR Filter Design Based on Tabu Search AlgorithmUploaded byManiraj Mariarj
- Dsp Matlab ProgramsUploaded bySomendra Sahu
- ejsr_31_1_03Uploaded bylathavenky
- Design and implementation of Up-Mixing algorithms for Home.pptxUploaded byKiran Modini
- Detection of Noise in High Pass IIR Digital Filters.pdfUploaded byBilal Shahid
- Effective Extraction and Filtering of Frequency Components in Physiological Signals Using Sum-of-Sinusoids ModellingUploaded bySEP-Publisher
- I-1 DSP Review_2007Uploaded byPartha Banerjee
- FIR FiltersUploaded byArunShan
- Paper Morales PublicadoUploaded byLuis Javier Morales-Mendoza
- US20120163231.pdfUploaded byJustin Oommen
- Home Works 08Uploaded byorcunevren
- paper 186.docxUploaded byPS
- [doi 10.1109%2Facc.2008.4586900] Butterworth, Jeffrey A.; Pao, Lucy Y.; Abramovitch, Daniel Y. -- [IEEE 2008 American Control Conference (ACC '08) - Seattle, WA (2008.06.11-2008.06.13)] 2008 American .pdfUploaded bydimple

- AICTE Hand Book 2011-12Uploaded bySRINIVASA RAO GANTA
- JNTUH MCA Syllabus 2013Uploaded bySRINIVASA RAO GANTA
- JNTUH MBA Course structure and Syllabus 2013Uploaded bySRINIVASA RAO GANTA
- JNTUH M.TECH PEDS 2013 SyllabusUploaded bySRINIVASA RAO GANTA
- IP Addresses and SubnettingUploaded bySRINIVASA RAO GANTA
- Library Quality Criteria for NBA AccreditationUploaded bySRINIVASA RAO GANTA
- JNTUH Syllabus 2013 M.Tech EPSUploaded bySRINIVASA RAO GANTA
- JNTUH Syllabus 2013 m.tech Embedded SystemsUploaded bySRINIVASA RAO GANTA
- NET EXAM Paper 1Uploaded byshahid ahmed laskar
- Use Full Library TermsUploaded bySRINIVASA RAO GANTA
- JNTUH Syllabus 2013 M.Tech CSEUploaded bySRINIVASA RAO GANTA
- JNTUH Syllabus 2013 M.tech Communication SysUploaded bySRINIVASA RAO GANTA
- Reg Pay Degree 020110Uploaded bySRINIVASA RAO GANTA
- GkPaper I2012 Net Set WUploaded bySRINIVASA RAO GANTA
- JNTYH Syllabus 2013 M.Tech CAD CAMUploaded bySRINIVASA RAO GANTA
- JNTUH Syllabus 2013 Civil Engg Course StructureUploaded bySRINIVASA RAO GANTA
- The Ideal Library -the InformatoriumUploaded bySRINIVASA RAO GANTA
- Vbit Journals 2011-12Uploaded bySRINIVASA RAO GANTA
- J-59-12 (Library of Inf Sci)Uploaded bySRINIVASA RAO GANTA
- NET -59-12 (Library & Inf Sci)Uploaded bySRINIVASA RAO GANTA
- Librarian is Teaching or Non TeachingUploaded bySRINIVASA RAO GANTA
- Academic Conference and Case Chase Competition 12Uploaded bySRINIVASA RAO GANTA
- kvs librarypolicy2012Uploaded bySRINIVASA RAO GANTA
- ISBN Manual 2012Uploaded bySRINIVASA RAO GANTA
- TEQIP IIUploaded bySRINIVASA RAO GANTA
- Guidelines for Open Educational Resources (OER) in Higher Education,Uploaded bySRINIVASA RAO GANTA
- Good Handling PrinciplesUploaded bySRINIVASA RAO GANTA
- Dspace on windowsUploaded bySRINIVASA RAO GANTA
- Ready Reckoner Radar EwUploaded bySRINIVASA RAO GANTA
- PSoC Express First Touch DocumentationUploaded bySRINIVASA RAO GANTA

- Chinese Economics TermsUploaded byReuoir
- ICANTEK ICANDVR540RUploaded byTecnoSmart
- IAETSD-JARAS-Comparative Performance Analysis of NACA, NREL, EPPLER Airfoils for Wind Turbine Using Computational Fluid Dynamics (CFD)Uploaded byiaetsdiaetsd
- 08-08 Piercing the Corporate VeilUploaded byLeizza Ni Gui Dula
- Prohibited Acts and Penalties RA 9003Uploaded byPamela Cabungcal
- KEP ReportUploaded byStephen McGarry
- Www.sefindia.org __ View Topic - Plinth Beam Requirement for a BuildingUploaded byNouman Mohsin
- Stamp Act OdishaUploaded byRamesan Ck
- 16. Asset Privatization Trust Fund vs. CA 300 Scra 579Uploaded byalbemart
- Basic Circuit.docx 0Uploaded byClinton Joel
- AGPM 4 SP1 Operations GuideUploaded byEneko Etxebarria
- Dept of Public Works Highways PhilipinesUploaded bygopinathan_karutheda
- Building Trefftz Finite Elements for Electromagnetic ProblemsUploaded bykinny1974
- PCEF-AAA Interface Specification V1_0Uploaded bySusie Widodo
- BEKC 3533 Introduction to Control SystemUploaded byMike Posktova
- All PileUploaded byAstrid Aubry
- Escrow SWOTUploaded byAnubhav Agarwal
- Fundamentals of Shipping -Final Lesson PlanUploaded byRamalingam Chandrasekaran
- LinezolidUploaded bykhagendrakryadav
- Tw Manuals Essential Standard 4 TelehandlersUploaded bydomagoj
- Answers Of FEG 01Uploaded byApril Gomez
- European Guidelines Acne TreatmentUploaded byLeonardus Leonardus
- BABASA V. CAUploaded byHaniyyah Ftm
- ict learning theoryUploaded byapi-281219398
- Technical Brief - How to Create a Profit and Loss Statement in QlikViewUploaded byAdmire Mamvura
- work as call girl in jabalpur join an earn 7582073040ℰscℴℛt jabalpur Caℓℓ ℊiℛℓsUploaded bysdvfbgnhmjmnbvgc
- Corporate storytelling.pdfUploaded bySelma Delić
- Probability Boolean ExpressionsUploaded byCristina Gollandka
- How to Develop Security Master Plan MiniUploaded byLafaiete Alves F N
- ProDes Road MapUploaded byCognosfera