II Semester M.E. (Electronics and Communication) Degree Examination, June/July 2015 (Y2K9 Scheme) EL 214 : DSP ALGORITHMS AND ARCHITECTURE Time : 3 Hours
Max. Marks : 100
Instructions : Answer any five full questions. Assume missing data suitably and state them. 1. a) Compute four point circular convolution of sequence n
x1(n) = s(n) – s(n – 2) and x2(n) = ⎜⎛ 1 ⎟⎞ using DIF-FFT and DIT-IFFT. ⎝2⎠ b) Find the range of values of ‘a’ and ‘b’ for stability of LTI system with impulse response ⎧⎪a n ; n ≥ 0 h(n) = ⎨ ⎪⎩bn ; n < 0
6
c) Find inverse ‘z’ transform of x(z ) = ROC.
9
z 8z 2 − 5z + 1
and mention the different 5
2. a) Design a band stop filter to reject frequencies in the range 1 to 2 rad/sec. Using rectangular window with N = 7. Realise the structure of the filter.
10
b) Design a Chebystev digital filter using bilinear transformation for following specification 0.707 ≤ H(ω) ≤ 1
H(ω) ≤ 0.2
0 ≤ ω ≤ 0.2π
10
0.4π ≤ ω ≤ π
3. a) Show that the decimeter is linear and time invariant.
7
b) Obtain the steady state noise power due to quantization when the binary sequence is represented by ‘b’ bits.
7
c) For a digital system y(n) = 0.9 y(n – 1) + x(n) with x(n) = 0 and y(–1) = 12. Find the dead band of the system.
6
P.T.O.
*ME062*
ME – 062 4. a) Explain the architecture and salient features of a DSP processor.
10
b) Compare the architectural features of TMS 320 series and ADSP2 series of DSP processors.
10
5. a) Explain the different types of representation of DSP algorithm with examples. 10 b) Explain minimum cycle mean algorithm used to compute the iteration bound in DSP algorithm. 10 6. a) Explain life time analysis procedure used to compute minimum number of registers required to implement DSP algorithm in hardware.
10
b) Explain system modelling, system identification and adaptive equalisation in adaptive filters. 10 7. a) Give the expression for more wavelet and mention any four properties of wavelet transform.
10
b) Explain the minimum mean square error method for obtaining optional filter coefficients. 8. Write short notes on :
10
(10+10)
1) Application of DSP in RADAR 2) DSP algorithm used in video application. _______________________
b) Describe with examples sampling period reduction and parallel processing in. applications of unfolding. 10. 8. a) Describe with an example any one shortest ...
with high communication complexity, it is natural to use a. Network-on-Chip (NoC) to implement the communication. We address two key optimization problems ...
Network-on-Chip (NoC) to implement the communication. ... A key observation is that for DSP systems the traffic be- ...... Computer Communications, 2001.
... the apps below to open or edit this item. pdf-1595\communication-system-design-using-dsp-algo ... s320c30-applications-of-communications-theory-b.pdf.
2 af2 For More Question Papers Visit - www.pediawikiblog.com. For More Question Papers Visit - www.pediawikiblog.com. www.pediawikiblog.com. Page 2 of 2. DSP Algorithms & Architecture July 2016 (2010 Scheme).pdf. DSP Algorithms & Architecture July 20
Active Noise Control Systems: Algorithms and DSP Implementations (Wiley Series in Telecommunications and Signal Processing)
Download at => https://pdfkulonline13e1.blogspot.com/0471134244
Active Noise Control Systems: Algorithms and DSP Implement
Active Noise Control Systems: Algorithms and DSP Implementations (Wiley Series in Telecommunications and Signal Processing)
Download at => https://pdfkulonline13e1.blogspot.com/0471134244
Active Noise Control Systems: Algorithms and DSP Implement
Active Noise Control Systems: Algorithms and DSP Implementations (Wiley Series in Telecommunications and Signal Processing)
Download at => https://pdfkulonline13e1.blogspot.com/0471134244
Active Noise Control Systems: Algorithms and DSP Implement
it suitable for high security access control application. The three main .... Development Environment ... interface which speeds up development time and reduces.
HD. THD γ β α. +. +. = ⢠Hamming distance is a measure of dissimilarity between two binary templates. ⢠A threshold is set to decide if the two templates are ...
In the 1950s and 1960s several computer scientists independently studied .... individual learning and species evolution a ect one another (e.g., 1, 2, 13, 37 ... In recent years, algorithms that have been termed \genetic algorithms" have ..... Bedau
... in the population. 3. Apply selection and genetic operators (crossover and mutation) to the population to .... an environment|aspects that change too quickly for evolution to track genetically. Although ...... Princeton University Press, Princeto
In the 1950s and 1960s several computer scientists independently studied ... ther developed by Holland and his students and colleagues at the University of .... If if the environment is stable so that the best things to learn remain constant, then th
Compare Matrix Form FFT with Matlab Functions . ...... but the Maple computer algebra system for example returns ?1 for this. % values so this function returns -1 ...
Because of this, the bilinear z-transform is well suited to the task of converting classic analog filter into a digital IIR model which preserves the shape of the magnitude frequency response of the parent analog system. 3.5.2 Design of Digital Filte
In the 1950s and 1960s several computer scientists independently studied .... logical arms races, host-parasite co-evolution, symbiosis, and resource ow in ...
dsp architecture design essentials contains important information and a detailed explanation about dsp architecture design essentials, its contents of the ...