The LNM-IIT, Jaipur, Rajasthan Digital Signal Processing (ECE326) End Term Date: 14/09/2020 1) State True/False: [6] a) A Discrete time aperiodic signal has continuous spectrum ranging from —co to +00. b) Uniform convergence condition is necessary condition for existence of Fourier transform of a given sequence, c) A Discrete time periodic signal carries finite energy. ) A rectangular window based filter is more successful to suppress spectrum ripples than a hamming based window. ©) Radix-4 butterfly has the complexity of 1 complex multiplication and 12 complex additions. £) A continuous time periodic signal is converted to digital signal only by Nyquist sampling 2) Do the following: a) Mention the analysis and synthesis expression for diserete time periodic signal 22] b) Calculate the energy of a given signal x(n) = (0.125) - “a@acrts) | 2] ©) Draw the circularly shifted sequence with k = 2 for given sequence +(n) = [4,2,1,3). [2] 4) Calculate complexity reduction using Divide and conquer algorithm for N = 5100 points stored in 170 rows and 30 columns. Q) ©) Using spectrum symmetry of Fourier transform, derive magnitude spectrum for a real and even sequence. (2) ) Mention the real and complex forward DCT expressions. (2) 3) Do the following: a) Calculate DFT matrix for N’ = 3 point. (4) b) Draw and explain the pole-zero plot for magnitude response and phase response for a system having single pole inside the unit circle. [4] c) Let an LTT system h(n) = (0.8)"u(n) exited with input x(n) = e", Calculate the output response y(n). (4) 4) Mention the transfer function, magnitude response and by value of a digital resonator. [4] ©) Mention the transfer function of a notch filter having notch at 2 frequency (Take by = 1). Mention the surviving signal at the output when an input signal -r(n) = 2cos(3) cos( #) passed through the notch filter. [4] ) Verify that "circular convolution in time domain makes E:T. pair with DFT domain multipli- cation” for given sequences «r(n) = [2,3, 1,4] and h(n) = (2,1 + 33,3). (4) g) Using Radix-4 DIF-FFT expressions, derive X(4K + 1) and X(4K + 3) expressions for split radix FFT algorithm. (4) The LNM-IT, Jaipur, Rajasthan4) Radix-4. a) Derive Decimation in Time algorithm for Radix-4. (41 b) Draw the FET structure for the above step i.e. Radix-4 DIT-FFT for N = 16 points. [4] ©) Using above steps, calculate FFT value for given sequence a(n) = [1,1,1,1,1,1,1,1,-1,-1,-1, -1, =, 1, —I]. Also mention the calculated value at each stage. [4] 5) FIR Filter. a) Filter A : Derive Digital filter for anti-symmetric h(n) with even length M. (4) b) Filter B : Let’s take an h(n) = (7,5,3,1,9,1,3,5, 7], mention H(w), H-(w) and phase of the system. (4) ©) Mention whether the derived filter will pass/stop the given signals. (4) + 2)(n) = cosmn * 22(n) =sin En Well Done ‘The LNM-IT, Jaipur, Rajasthan