EE 6403 – DISCRETE TIME SYSTEMS AND SIGNAL PROCESSING

(April/ May 2017)

Regulations 2013

1) What are the energy and power of a discrete signal?

The energy of the DT signal x(n) denoted by E
E=∑∞
𝑛=−∞ |𝑥(𝑛)|
2

x(n) is called energy signal if 0< E < ∞

Power of a DT signal x(n) denoted by P

𝑙𝑖𝑚 1
Average power, P = N→ ∞ 2𝑁+1 E=∑𝑁
𝑛=−𝑁 |𝑥(𝑛)|
2

x(n) is power signal if , 0< P< ∞

2) State sampling theorem.

Let xa (t) is a band limited signal with xa (jΏ) = 0 for 1Ώ 1< Ώ m. Then xa (t) is uniquely
determined from its samples x(n) = xa (nT) if the sampling frequency F ≥ 2fm ie., Sampling
frequency must be atleast twice the highest frequency present in the signal.

3) Write the properties of Region of convergence

(i) ROC does not contain any poles
(ii) ROC of causal sequence is of the form 1z1> r
(iii) ROC of the left handed sequence is of the form 1z1< r
(iv) ROC must be a connected region

4) Find the convolution of the input signal {1,2,1} and its impulse response {1,1,1}
using Z transform.
x(n) = {1,2,1} (gn)
h(n) = {1,1,1} (gn)

X(z) = 1+2𝑧 −1+z-2

H(z) = 1+z-1 + z-2
Y(z) = x(z)H(z) = (1+2z-1 + z-2) (1+z-1 + z-2 )
= 1+z-1 + z-2 + 2z-1 + 2z-2 + 2z-3 +z-2 + z-3 + z-4
= 1+3z-1 + 4z-2 + 3z-3 + z-4
x(n) ∗ h(n) = {1,3,4,3,1}

5) Define twiddle factor write its magnitude and phase angle.

Twiddle Factor is given by

WN = 𝑒 −𝑗2𝜋/𝑁

Magnitude of the Twiddle Factor is given by |𝑒 −𝑗2𝜋/𝑁 |

 −2𝜋
Phase angle is given by 𝑁

6) Compute the number of multiplications and additions for 32 point DFT and FFT

No of multiplication in 32 point DFT = N2 = 32x32 = 1024

𝑁
No of multiplications in 32 point FFT = 2 log 2 N

32
= log 2 32
2

= 76 log 2 2 5
= 80

7) Write the advantages and disadvantages of digital filters.

Advantages
1) Digital filters performance is not influenced by component ageing, temperature and
Power supply variation.
2) Highly immune to noise of possess parameter stability.
3) Can be operated over wide range of frequencies.
4) Multiple filtering possible.

Disadvantage:
1) Quantization error arises due to finite word length in the representation of signals and
parameters.

8) Define pre warping Effect?

Ώ𝑇
In bilinear transformation, discrete time frequency is given as 𝜔 =2 tan-1 2
Relationship is highly nonlinear
It is called frequency warping
Frequency warping can be corrected by applying
Reverse characteristics before applying bilinear transformation
2 𝑁 𝜔
It is gn as Ω = 𝑇 tan 2 tan 𝑧 this effect is called prewar ping. It removes nonlinear
relationship in frequencies of analog and discrete time signal.

9) What is pipelining and how do we define its depth?

Pipelining a processor means breaking down its instruction into a series of
discrete pipeline stages which can be completed in sequence by specialized hardware.
The number of pipeline stages is referred to pipeline depth.

10) Write some commercial DSP processors.

TMS320C50, TMS320C54, TMS320C55, ADSP219X, TMS320C3X, TMS320C67X,
ADSP-21XXX
 EE6403 – Discrete Time Systems and Signal
Processing [Nov / Dec 2017]
Part A

1) State the parsevals theorem for DT signal.

If Z { x1(n)} = x1 (z) and Z {x2(n)} = x2(z)
1 1 -1
Then ∑∞ 𝑛=−∞ x1(n) x2(n) = 2𝜋𝑗 ∮ c x1 (u) x2 * 〔𝑢〕u d𝑢

2) What is meant by aliasing effect?

Let us consider a band limited signal x(t) having no frequency component for
1Ώ1 >Ώ m if we sample the signal x(t) with a sampling frequency F< 2fm, the
periodic continuation of X(jΏ) results in spectral overlap. Spectrum X(jΏ) cannot be
recovered using low pass filter. This effect is known as aliasing effect.

3) List the methods to find inverse Z transform.

(i) Long Division method
(ii) Partial Fraction expansion method
(iii) Residue method
(iv) Convolution method

4) Write the conditions to define stability in ROC .

A linear time invariant system with the system function H(z) is BIBO stable if and
only if the ROC for H(z) contains the unit circle.

5) Find the DFT or the signal x(n)=an

X(k) = ∑𝑁−1
𝑛=0 an e
–j2𝜋𝑘𝑛/𝑁
for 0≤ k≤ N-1

1−𝑎𝑁 𝑒 −𝑗2𝜋𝑘
=
1−𝑎𝑒 −𝑗2𝜋𝑘/𝑁

6) Draw the butterfly structure for 2 point DFT using DIT – FFT algorithm.

Flow graph of a two points DFT for decimation in time algorithm is

Xm(p) m+1 1(p) = Xm(p) + Xm(q)

Xm(q) m+1(q) = Xm(p) – Xm (q)

7) Draw the Direct form I structure for 3rd order system.

8) What is prewar ping effect?
Ώ𝑇
In bilinear transformation, discrete time frequency is given as 𝜔 =2 tan-1 2
Relationship is highly nonlinear
It is called frequency warping
Frequency warping can be corrected by applying
Reverse characteristics before applying bilinear transformation
2 𝑁 𝜔
It is gn as Ω = 𝑇 tan 2 tan 𝑧 this effect is called prewar ping. It removes nonlinear
relationship in frequencies of analog and discrete time signal.

9) Write the features of DSP processor.

(i) Architectural Features
(ii) Execution Speed
(iii) Type of arithmetic
(iv) Word length

10) List Some examples of commercial digital Signal Processor

TMS320C50, TMS320C54, TMS320C55, ADSP219X, TMS320C3X,

TMS320C67X, ADSP-21XX.