Unit I - Discrete Fourier Transform Part - A
Unit I - Discrete Fourier Transform Part - A
Unit I - Discrete Fourier Transform Part - A
PART A
21.Define Z-transform
Z- transform can be defined as
X(Z)= x(n)z-n
n=-
ii)TIME SHIFTING
if x(n)X(Z)
then Z
x(n-k)(Z-K)X(Z)
iii)SCALING IN Z-DOMAIN
if x(n)X(Z)
then anx(n)X(a-1Z)
iv)TIME REVERSAL
if x(n) X(Z)
then x(-n) X(Z-1)
v)DIFFERTIATION IN Z DOMAIN
nx(n)-Zdz X(Z)
vi)CONVOLUTION OF TWO SEQUENCES
if x1(n)X1(Z) and x2(n)x2(Z)
then x1(n)*x2(n)X(Z)=X1(Z).X2(Z)
vii)CORRELATION
if x1(n)X1(Z) and x2(n)X2(Z)
then
rx1x2(l=x1(n) x2(nl)Rx1x2(Z)=X1(Z) .X2(Z-1)
n=-
26. Define DFT and IDFT (or) What are the analysis and synthesis equations of DFT?
DFT(Analysis Equation)
N-1
X(k)= x(n) Wnk , WN = e-j2/N
n=0
IDFT(Synthesis Equation)
N-1
x(n)= 1/N X(k) W-nk , WN = e-j2/N
k=0
29.How to obtain the output sequence of linear convolution through circular convolution?
Consider two finite duration sequences x(n) and h(n) of duration L samples and M samples. The
linear convolution of these two sequences produces an output sequence of duration L+M-1
samples, whereas , the circular convolution of x(n) and h(n) give N samples where
N=max(L,M).In order to obtain the number of samples in circular convolution equal to L+M-1,
both x(n) and h(n) must be appended with appropriate number of zero valued samples. In other
words by increasing the length of the sequences x(n) and h(n) to L+M-1 points and then
circularly convolving the resulting sequences we obtain the same result as that of linear
convolution.
32. What are the two methods used for the sectional convolution?
The two methods used for the sectional convolution are
1)the overlap-add method and 2)overlap-save method.
37. How many multiplications and additions are required to compute N point DFT using
redix-2 FFT?
The number of multiplications and additions required to compute N point DFT using radix-2
FFT are N log2 N and N/2 log2 N respectively,.
Linear convolution
1.If x(n) is a sequence of L number of samples and h(n) with M number of samples, after
convolution y(n) will have N=L+M-1 samples.
2.It can be used to find the response of a linear filter.
3.Zero padding is not necessary to find the response of a linear filter.
Circular convolution
1.If x(n) is a sequence of L number of samples and h(n) with M samples, after convolution y(n)
will have N=max(L,M) samples.
2.It cannot be used to find the response of a filter.
3.Zero padding is necessary to find the response of a filter.
45.What are the differences and similarities between DIF and DIT algorithms?
Differences:
1)The input is bit reversed while the output is in natural order for DIT, whereas for DIF the
output is bit reversed while the input is in natural order.
2)The DIF butterfly is slightly different from the DIT butterfly, the difference being that the
complex multiplication takes place after the add-subtract operation in DIF.
Similarities:
Both algorithms require same number of operations to compute the DFT. Both algorithms can be
done in place and both need to perform bit reversal at some place during the computation.
46. What is the advantage of direct form 2 over direct form 1 structure?
The direct form 2 structure has reduced memory requirement compared to
direct form 1 structure.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: