Categories

# EE6403 Question Bank Discrete Time Systems and Signal Processing

EE6403 Question Bank Discrete Time Systems and Signal Processing Regulation 2013 Anna University free download.

## Sample EE6403 Question Bank:

1.What is DFT?

It is a finite duration discrete frequency sequence, which is obtained by sampling one period of Fourier transform. Sampling is done at N equally spaced points over the period extending from w=0 to 2л.

2. Define N point DFT.

The DFT of discrete sequence x(n) is denoted by X(K). It is given by, Here
k=0,1,2…N-1 Since this summation is taken for N points, it is called as N-point DFT.

3. What is DFT of unit impulse δ(n)?

The DFT of unit impulse δ(n) is unity.

4. List the properties of DFT.

Linearity, Periodicity, Circular symmetry, symmetry, Time shift, Frequency shift, complex conjugate, convolution, correlation and Parseval‘s theorem.

5. State Linearity property of DFT.

DFT of linear combination of two or more signals is equal to the sum of linear combination of DFT of individual signal.

6. When a sequence is called circularly even?

The N point discrete time sequence is circularly even if it is symmetric about the point zero on the circle.

7. What is the condition of a sequence to be circularly odd?

An N point sequence is called circularly odd it if is antisymmetric about point zero
on the circle.

8. Why the result of circular and linear convolution is not same?

Circular convolution contains same number of samples as that of x (n) and h (n), while in linear convolution, number of samples in the result (N) are, N=L+M-1 Where L= Number of samples in x (n) M=Number of samples in h (n)

9. What is circular time shift of sequence?

Shifting the sequence in time domain by ‗1‘ samples is equivalent to multiplying the sequence in frequency domain by WNkl

 Subject Name Discrete Time Systems and Signal Processing Subject Code EE6403 Regulation 2013