MU Computer Engineering (Semester 7)
Digital Signal Processing
December 2014
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) Explain classification of Discrete systems.
5 M
1 (b) Prove that DFT is orthogonal transform.
5 M
1 (c) Explain image fidelity criteria.
5 M
1 (d) Unit step signal is a power signal. Justify.
5 M

2 (a) Check whether the following systems are linear/nonlinear and Time variant/Time invariant.
i) y(n)=ex(n)
ii) y(n)=n x(n)
10 M
2 (b) Find the Z-transforming signals and sketch ROC. \[ i) \ x(n) = \left ( \dfrac {1}{4} \right )^n u (n) \\ ii) \ x(n) = \left ( \dfrac {1}{2} \right )^n u(-n-1) \]
10 M

3 (a) Explain Decimation is time FFT algorithm with signal flow graph.
10 M
3 (b) Determine circular convolution of two sequences
x1(n)={1,2,3,1}
x2(n)={4,3,2,2}
10 M

4 (a) Explain region based image segmentation techniques.
10 M
4 (b) Explain image enhancement techniques in spatial domain.
10 M

5 (a) Explain various types of redundancies in an image. Specify techniques to remove redundancies.
10 M
5 (b) Construct improved gray scale quantization code for given data
{100, 110, 124, 124, 130, 110, 200, 210}
10 M

6 (a) Explain trimmed average filtering and median filtering with example.
10 M
6 (b) Compute DFT of the given image
10 M

Write short notes on any four:
7 (a) Hough transform
5 M
7 (b) Histogram Equalization
5 M
7 (c) Wiener filter
5 M
7 (d) Noise models
5 M
7 (e) Walsh Hadamard Transform.
5 M



More question papers from Digital Signal Processing
SPONSORED ADVERTISEMENTS