II Semester M.E. (Electronics & Communication Engg.) Degree Examination, January/February 2014 (2K9 Scheme) EL-214 : DSP ALGORITHMS AND ARCHITECTURE Time : 3 Hours
Max. Marks : 100
Instruction : Answer any five full questions. 1. a) Explain clearly the down sampling and upsampling in multirate signal processing. Show that decimator and interpolators are linear and time variant.
10
b) Design FIR filter filter using Hamming window for the desired frequency response ⎧ −j 3w , ⎪e H d (e jw ) = ⎨ ⎪ 0, ⎩
π ≤ | ω |≤ π 4 −π π ≤ω≤ 4 4
10
2. a) Derive the spectrum of the output of an interpolator and discuss aliasing effect.
10
b) Design direct form and polyphase structure of FIR interpolator using Z-transform for a factor of 4 and N = 12.
10
3. a) Derive alias free condition in two channel quadrature mirror filter bank.
10
b) Explain LMS and RLS algorithms and derive error equations. 4. a) Discuss the properties of wavelet transform.
10 10
b) Explain the decomposition of subbands in DWT and advantages of DWT over DFT. 10 5. a) Show that FIR differentiator is antisymmetric with N = 7.
10
b) Design Chebyshev IIR filter using IIT to satisfy the following specifications. i) Passband gain of 0.9 at 0.35 π radians 10 ii) Stop band attenuation of 0.24 at 0.5 π radians. P.T.O.
*JUP153*
JUP – 153 6. a) Compute circular convolution using DITFFT algorithms for x1(n) = δ(n) + δ(n − 1) + 2δ(n − 3) and
x2(n) = u(n) – u(n – 3).
10
b) Explain folding transformation in detail.
10
7. a) Explain DSP based modern radar system with block diagram and applications of radar signal processing. 10 b) Discuss image compression techniques using DCT and DWT. 8. a) Explain the internal architecture of DSP processor. b) Explain fast convolution algorithm and unfolding algorithm. ———————
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 ...