0% found this document useful (0 votes)
65 views6 pages

DSP Question Bank Overview

Important links
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
65 views6 pages

DSP Question Bank Overview

Important links
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

SRINIVASA INSTITUTE OF TECHNOLOGY &SCIENCE :: KADAPA

Digital Signal Processing


Question Bank
UNIT-1

2MARKS:

[Link] x(n) = {1, 2, 3, 4, 6, 7, 8, 9} and DTFT [x(n)] = X(ejω), then find X(ejω) at ω = 0.

[Link] the following signals and operations involved.

(i) 2x(2n) (ii) x(-n/2) (iii) 2x(-n) (iv) x(2n+3)

(a) Time shifting. (b) Time scaling. (c) Folding. (d) Amplitude scaling. (e) Time shifting.

[Link] the block diagram of digital signal processing system.

[Link] is the condition for z-transform to exist?

5. State the classification of discrete time signal.

[Link] causal system and also time invariant system.

10 MARKS:

[Link] to analyze the discrete system T[x(n)] = y(n) for linearity and shift invariance? Explain with a
suitable example.

[Link] the graphical representation and sequence form of a discrete time signal

x(n) = r(n+2) -r(n-3) - 5u(n-4) and also Evaluate the summation ,∑ x (n) where r(n) is unit ramp
n=0

sequence.
3. How to examine the discrete system having the rational system function H(z) for the causality and
stability? Explain with a suitable example.

4. (i) Frequency response.


(ii) Magnitude response and
(iii) Phase response of a discrete system having LCCDE.
(𝑛−1)/2(𝑛−1)=𝑥(𝑛)+1/2𝑥(𝑛−1).
5. Explain the classification of discrete-time signals
6. Determine the impulse response h(n) for the system described by the second order difference equation
y(n) – 2y(n-1) = x(n) + x(n-1).
7. Explain in detail about the classification of Discrete Time Systems.
8. a) Determine the convolution sum of following two sequences:
x(n) = {3,2,1,2}; h(n) = {1,2,1,2}
b) State and prove the conditions for causality & stability of an LTI system
UNIT-2

2 MARKS:

[Link] is the magnitude of a phase factor164W?

[Link] many number of complex adders and complex multipliers required to compute 64-Point DFT of a
sequence in direct DFT?

[Link] is decimation in frequency FFT?

[Link] any two properties of DFS.

[Link] the IDFT of X (K) = {1, 1, 1, 1}.

[Link] are the differences and similarities between DIF and DIT algorithms?

[Link] is zero padding? What are its uses?

10 MARKS:

[Link] the computational process of N-point DIT radix-2 FFT algorithm, hence draw the 8-point
butterfly structure by indicating the samples of input and output sequences

[Link] the 4-point IDFT of a sequence X(k) = {10, -2+2j, -2, -2-2j}.
3. Define IDFT of a N-point sequence X(k). Show that the sequence x(n) is periodic with a periodic of N
samples, if X(k) is a finite duration sequence with a duration of N samples over the range 0 ≤ k ≤ N-1.
Given that the N-point IDFT[X(k)] = x(n).
4. Apply DIF radix-2 FFT algorithm to compute the 8-Point DFT of a sequence
x(n) = {1, 0, -1, 0, 1, 0, -1, 0}.
[Link] X(k) = {36,−4+𝑗𝑗9.656,−4+𝑗𝑗4,−4+𝑗𝑗1.656,−4,−4−𝑗𝑗1.656,−4−𝑗𝑗4,−4−𝑗𝑗9.656},
find x(n).
[Link] and prove any two properties of DFT.
[Link] x(n) = {1,2,2,3,3,2,2,1}. Find X(k) using DIT FFT algorithm.
[Link] 8-poin DFT of the sequence x(n)= {1,1,1,1,1,1,0,0}
[Link] DFT of the sequence x(n)={1,2,3,4,4,3,2,1} using DITFFT algorithm
[Link] IDFT of the sequence x(n)={ 7,-0.707-j0.707,-j, 0.707-j0.707,1, 0.707+j0.707,j, -
0.707+j0.707}
11. Develop an 8-point DIF-FFT algorithm. Draw the signal flow graph. Determine the DFT of the
following sequence, x(n)= {1,1,1,0,0,1,1,1}
12. Explain about decimation in time FFT algorithm.
13. Explain about decimation in frequency FFT algorithm
14. Explain the radix 2 FFT – DIT algorithm for the computation of DFT of the given 8 points sequence.
[Link] the DFT of the sequence x(n) defined by:
x(n) = 1 for 2 ≤ n ≤ 6
= 0 for n = 0, 1 and 7.
16. Find the circular convolution using DFT and IDFT of the sequence 𝑥1 (𝑛) = {4,3,1,2} and 𝑥2 (𝑛) =
Use DIF algorithm. Give all intermediate results

{1,3,5,3}.

UNIT-3

2 MARKS:

[Link] the following:

(a) Impulse Invariant Transformation (b) Bilinear Transformation.

(i) It is many-to-one mapping; (ii) It is one-to-one mapping.

(iii) Relation between analog and digital frequency is linear.

(iv) Relation between analog and digital frequency is nonlinear.

(v) Aliasing problem, (vi) Frequency warping problem.

[Link] of the following statement is true for impulse invariant transformation?

(i) It is a one to one mapping.

(ii) Relation between analog and digital frequency is ω = ΩT.

(iii) Transform ⇒1aTze11as1−−→−.

(iv) Suffering from frequency warping.

[Link] are the different design techniques available for IIR filters?

[Link] is the main advantage of direct form II realization when compared to direct form I realization?

5. What are the advantages and disadvantages of Bilinear transformation

6. Using Bilinear transformation, find H(z) from H(s) = 2/ [(S+1) (S-1)] with T = 1 sec.

7. Explain cascade form structure for IIR systems

10 MARKS:

[Link] the various properties of Butterworth and Chebyshev IIR approximation methods.

[Link] a digital filter by converting the transfer function of analog filter H(s) into digital filter H(z) by
using impulse invariant transformation method with a sampling period of T = 0.1sec. Given.
2
H(s) = 2
s + 3 s+ 2

[Link] a digital low pass filter by using IIR Butterworth approximation and Bilinear transformation
method by taking the sampling period of T = 0.1sec to satisfy the following specifications.
0.6 ≤|(𝑗𝜔)|≤ 1.0; 0≤𝜔≤0.35𝜋
|(𝑗𝜔)| ≤ 0.1; 0.7𝜋≤𝜔≤𝜋

[Link] the system given by difference equation;


y(n) = -0.1y(n-1) + 0.71 y(n-2) + 0.7 x(n) - 0.252 x(n-2) in Cascade form and Parallel form.
[Link] Butterworth and Chebyshev Filters
[Link] in brief about the basic structures of IIR filters.
[Link] the direct form I , direct form-II ,cascade and parallel form realization for the system
y(n)= -0.1y(n-1)+0.2y(n-2)+3x(n)+3.6x(n-1)+0.6x(n-2)
7. Realize system with following difference equation y(n) = (3/4) y(n-1) – (1/8) y(n-2) + x(n) + (1/3)x(n-
1)
(a)direct form-I
(b)direct form-II
[Link] the discrete system y(n) = -0.1y(n-1)+0.2y(n-2)+3x(n)+3.6x(n-1)+0.6x(n-2)
Using,
(a) Cascade forms
(b) Parallel forms
[Link] the features of Chebyshev approximation.
[Link] a digital low pass IIR Chebysher filter for pass band cut off frequency of 1500 Hz, stop band
cut off frequency of 7500 Hz, attenuation in pass band 3dB and attenuation in stop band 15dB. Assume
suitable sampling frequency? Use Bilinear transformation.
11. Determine the order of low pass digital FIR filter using an appropriate window function for the
following specifications: Pass band cut off frequency fp = 150 Hz, stop band frequency fs = 250 Hz.
Pass band ripple Ap = 0.1dB stop band attenuation As = 40dB sampling frequency F = 100 Hz. Also
give the design procedure for the above problem.
[Link] an analog Butterworth filter that has a 2dB pass band attenuation at a frequency of 20
radians/sec and at least 10db stop band attenuation at 30 radians/sec?

UNIT-4

2 MARKS:

[Link] is linear phase design of FIR filters?

[Link] Hann window function over the range 0 to N – 1.

[Link] are the effects of windowing?

[Link] are the differences between IIR and FIR filters?

[Link] direct form structure for FIR systems.

10 MARKS:

1. What are the various window functions used in the design of FIR filters? Explain.
2. Draw the ideal and practical frequency response characteristics of band stop filter and obtain the
expression for the impulse response hd(n) from the frequency response of desired filter Hd(ejw).
3. Design a digital high pass filter through FIR method by considering 7 samples of impulse response
with a cutoff frequency of 0.8π rad/sample by using hamming window.
[Link] in brief about the different window functions used in FIR filter design.

Hd (e𝑗𝜔) = −𝑗3𝜔, −𝜋/4 ≤ 𝜔 ≤ 𝜋/4


[Link] a filter with

0 ,/4 ≤ |𝜔| ≤ 𝜋
Using Hamming window with N = 7.
6. Discuss the realization of FIR filter structures.
[Link] FIR filter with system function in cascade form
H (z) = 1 + (5/2) z-1+2z-2+2z-3
[Link] the FIR filter design using windowing technique.
[Link] FIR and IIR filters.

𝐻𝑑(𝑒𝑗𝜔)= 𝑒−𝑗3𝜔; − 1/4 𝜋 ≤ 𝜔 ≤ 1/4 𝜋


[Link] a filter with desired frequency response:

𝐻𝑑(𝑒𝑗𝜔) = 0; 1/4 𝜋< |𝜔| ≤ 𝜋


Using Hamming window with N = 7.
UNIT-5

2-MARKS:

[Link] are quantization errors?


[Link] is Interpolation?
[Link] is multirate DSP?
[Link] is quantization error?
[Link] is Multirate signal processing?
[Link] is the effect of up-sampling & down-sampling ?
[Link] are the advantages of Multirate signal processing?
[Link] Decimation.
[Link] are the applications of Multirate signal processing?
10 MARKS:

[Link] is multirate signal processing? What are applications? Explain in detail.


2. Evaluate the sequences
(i) y1(n) = x(2n) + x(n/2). (ii) y2(n) = x(2n) - x(n/2).
Given x(n)={1, 2, 3, 4, 5, 5, 6, 7, 8, 9}.
3. What is down sampling? Explain with a suitable example.
4. Evaluate the z-domains, X(z) and Y(z). Given y(n) = x(2n) and
x(n) = {1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 9}.
[Link] about Round-off effects in digital filters.
[Link] the following:
Decimation by a factor D.
(b)Interpolation by a factor I.
[Link] down sampling and up sampling with suitable example.
[Link] the help of block diagram explain the sampling rate conversion by arational factor `I/D'. Obtain
necessary expressions
9.(a) What is decimation and interpolation? Explain briefly with suitable sketches.

(b) What is aliasing? What is the need for anti- aliasing filter prior to down sampling

Common questions

Powered by AI

The main difference between DIT and DIF algorithms is the order in which the computations are performed. DIT begins its computation with the bit-reversed order of the input sequence, whereas DIF starts with the normal order but processes the higher stages first. DIT involves decomposing the discrete Fourier transform (DFT) process into smaller parts by separating the time domain, while DIF separates the frequency domain .

To determine the DFT of a sequence using the DIT FFT algorithm, start by reordering the sequence in bit-reversed order. Then, apply the recursive DIT process following a butterfly computation diagram, breaking the N-point DFT into two N/2-point DFTs. Continuously apply this process until the base case of 2-point DFTs is reached. Combine the results at each stage using appropriate twiddle factors, ensuring efficient computation and reducing the computational complexity from O(N^2) to O(N log N).

The choice of window function is critical in FIR filter design because it determines the trade-off between main lobe width and side lobe levels in the frequency response. Different windows offer various levels of stopband attenuation and control over transition band width. For example, the rectangular window has a narrow main lobe with high side lobes, whereas the Hamming window offers reduced side lobes but a wider main lobe. Thus, the window impacts overall filter characteristics, determining the filter's effectiveness in suppressing unwanted frequencies .

To determine the causality of a discrete system with a rational system function H(z), the system must meet the condition that its impulse response h(n) is zero for n < 0. For stability, all the poles of H(z) must lie within the unit circle in the z-plane. A suitable example involves examining the pole-zero plot of the system's transfer function. If the poles are inside the unit circle and the impulse response is causal, the system is stable and causal .

Quantization errors in digital filters arise from the finite precision representation of signal and filter coefficients. They result in noise and can significantly affect the filter's performance, especially in narrowband filters. In fixed-point implementations, quantization errors can cause limit cycles and affect filter stability. Round-off errors in coefficient calculations and signal value storage also contribute to cumulative errors. Understanding quantization is crucial in designing robust digital filters for high-fidelity applications .

The bilinear transformation is preferred over impulse invariant transformation because it eliminates the effects of aliasing that occur in impulse invariant transformation. Additionally, the bilinear transformation provides a one-to-one mapping and preserves the system's stability and causality. It also mitigates the frequency warping effect due to its nonlinear frequency mapping, making it suitable for transforming analog filters into digital filters .

FIR filters have finite impulse response, meaning they settle to zero in finite time, and are inherently stable. They can have exactly linear phase and are easier to implement with arbitrary frequency response. IIR filters have infinite impulse response, can be unstable if not properly designed, have more complex system structures, and generally require fewer coefficients to meet a particular specification compared to FIR filters. The choice between FIR and IIR depends on the application requirements such as phase linearity and computational efficiency .

Multirate signal processing allows for the manipulation of signals at different sampling rates and is beneficial for efficient utilization of computational resources. It is used in applications such as subband coding, where different frequency bands are processed separately for better compression. It also helps in implementing computationally efficient algorithms by reducing the sampling rate without significantly affecting the signal quality, which is useful in real-time signal processing applications like audio and video processing .

Using a Hamming window in FIR filter design helps to minimize the side lobes of the frequency response, thereby reducing leakage. However, it also widens the main lobe, which can decrease the filter's transition bandwidth. The Hamming window provides a good balance between main lobe width and side lobe levels, making it effective for designing filters with minimal spectral leakage but at the cost of having a wider transition band .

The impulse response h(n) for a system described by a second-order difference equation can be determined by expressing the equation in terms of input and output sequences and solving for the output sequence when the input is an unit impulse delta function δ(n). For example, if given y(n) - 2y(n-1) = x(n) + x(n-1), use initial conditions y(n) = 0 for n < 0 and x(n) = δ(n) to solve iteratively for y(n). This generates h(n), which is the system's impulse response .

You might also like