1.

a)
What does DTFS stand for, and what is its purpose?
In the context of Digital Signal Processing (DSP), DTFS stands for Discrete-Time Fourier Series. The
DTFS is used to represent periodic discrete-time signals as a sum of complex exponentials. This is
particularly useful for analyzing and processing signals in the frequency domain.

The purpose of DTFS is to decompose a periodic discrete-time signal into its frequency components,
making it easier to analyze and manipulate. This is similar to the Continuous-Time Fourier Series
(CTFS) but applied to discrete-time signals
b)
Differentiate DTFS and DTFT in terms of periodicity.
DTFS (Discrete-Time Fourier Series):

Periodicity: DTFS is used to analyze periodic discrete-time signals. It decomposes these signals into
a sum of complex exponentials, representing the signal in the frequency domain. Since the original
signal is periodic, the resulting DTFS coefficients are also periodic.

Applications: DTFS is primarily used for analyzing periodic signals, such as those found in
communication systems and signal processing.

DTFT (Discrete-Time Fourier Transform):

Periodicity: DTFT is used to analyze aperiodic discrete-time signals. It represents a discrete-time

signal as a continuous function of frequency, allowing us to understand the signal's frequency
content. Unlike DTFS, the resulting DTFT is not periodic.

Applications: DTFT is used for analyzing aperiodic signals, such as transient signals or non-
repeating signals in various signal processing applications
c)
What is the mathematical equation for time-shifting property with initial conditions
in Z-Transforms?
Z{x(n-k)}=Z^-k X(z)
d)
Compare DTFS and CTFS.

e)
Find the period of Discrete time periodic signal x(n) = cos (πn/3).
Why Fast Fourier Transform (FFT) is called as in-place algorithm?

f) The FFT is called an in-place algorithm because it transforms the input data sequence within the
same memory space, without requiring additional memory allocation. It reorders the data and
performs computations directly in the array of the original data. This in-place computation
improves memory efficiency and reduces the need for extra storage.
g) Find number of complex multiplications in 8-point FFT.
 12
Name the two types of commonly used FFT algorithms.
Cooley-Tukey Algorithm: This is the most common FFT algorithm, which recursively breaks
h) down a DFT into smaller DFTs.
Prime Factor Algorithm (PFA): This algorithm is used when the length of the DFT is a
product of co-prime numbers. It decomposes the DFT into smaller DFTs of prime length.

State and explain circular convolution property in Discrete Fourier Transform (DFT).
(DFT). The circular convolution property states that the DFT of the circular convolution of two
sequences is equal to the product of their individual DFTs. Mathematically, if x(n)x(n) and h(n)h(n)
i) are two sequences, their circular convolution y(n)y(n) is given by: $$ y(n) = x(n) \circledast h(n)
$$ where ⊛\circledast denotes circular convolution. In the frequency domain, this property can be
expressed as: $$ Y(k) = X(k) \cdot H(k) $$ where Y(k)Y(k), X(k)X(k), and H(k)H(k) are the DFTs
of y(n)y(n), x(n)x(n), and h(n)h(n), respectively. This property simplifies the convolution process
by transforming it into multiplication in the frequency domain.
List any four properties of DFT.
Linearity: The DFT of a sum of two sequences is equal to the sum of their individual DFTs. $$
\text{DFT}\{a \cdot x(n) + b \cdot y(n)\} = a \cdot X(k) + b \cdot Y(k) $$
Periodic Property: The DFT is periodic with a period equal to the length of the sequence NN.
$$ X(k) = X(k + N) $$
j)
Symmetry Property: For real-valued sequences, the DFT exhibits conjugate symmetry. $$
X(N-k) = \overline{X(k)} $$ where X(k)‾\overline{X(k)} denotes the complex conjugate.
Parseval's Theorem: The total energy in the time domain is equal to the total energy in the
frequency domain. $$ \sum_{n=0}^{N-1} |x(n)|^2 = \frac{1}{N} \sum_{k=0}^{N-1} |X(k)|^2
$$

k) Compare DTFS and CTFS.

l) Find the period of Discrete time periodic signal x(n)=cos (n/3).
m) Compare Energy and Power density spectrums.

n) Show that Discrete Time Fourier Transform is periodic.

o) Show the analysis and synthesis equations of Discrete Time
p) What are the advantages of Fast Fourier Transform (FFT)?
q) How many complex multiplications are required in DFT and FFT algorithms?
r) Name the two types of commonly used FFT algorithms.
s) Define DFT and IDFT mathematically.
t) Name few properties of DFT.
1. a) A signal x[n]={1,1,1,1} is zero-padded to length N=8.Compute the DTFT of the original sequence.

2. a) What is DTFT and derive the Energy density spectrum of aperiodic sequence?
b) Solve the difference equation

5 1
𝑦(𝑛) = 𝑥(𝑛) + 𝑦(𝑛 − 1) − 𝑦(𝑛 − 2)
6 6

for the unit step input sequence. Assume that initial conditions 𝑦(−1) = 𝑦(−2) = 1 . Make use of Z-
Transform.

3. By means of DFT and IDFT, Determine the sequence, x3(n) corresponding to the circular convolution
of x1(n) ={1,1,2,1} and x2(n) ={1,2,3,4}.
4. a) What is a twiddle factor? State and prove its symmetry and periodicity properties.
b) Compute the 4-point DFT of the sequence using DIT-FFT radix 2 algorithm for x(n) = {1, 2, 3, 4}.
6. a) What is DTFS and derive the power density spectrum of periodic sequence?
b) 5 1
Solve the difference equation, 𝑦(𝑛) = 𝑥(𝑛) + 𝑦(𝑛 − 1) − 𝑦(𝑛 − 2)
6 6
for the unit step input sequence. Assume that initial conditions 𝑦(−1) = 𝑦(−2) = 1 . Make use of Z
Transform.
7. a) Find the frequency response and plot magnitude, phase spectra for the sequence,
1 0, 1, 2, 3, 4
𝑥(𝑛) = {
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
b) Find the unit sample response of a causal LTI system using Z- Transform.
𝑦(𝑛) = 𝑦(𝑛 − 1) + 𝑦(𝑛 − 2) + 𝑥(𝑛 − 1)
8. a) State and prove any two properties of Discrete Fourier Transform.
b) Find circular convolution of the sequences x1(n)={1,-1,-2,3,-1} and x2(n)={1,2,3} using concentric
circle method.
9. Compute 8-point DFT of the sequence given below using DIT and DIF algorithms.
1 0≤𝑛≤7
𝑥(𝑛) = {
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

m. Compare Energy and Power density spectrums.