0% found this document useful (0 votes)
76 views2 pages

Solution SAS 2023 12

The document contains 10 questions about concepts in digital signal processing including the discrete Fourier transform (DFT), discrete-time Fourier transform (DTFT), and circular convolution. The key points covered are: 1) The 2x2 DFT matrix and its properties. 2) The DTFT of a cosine signal. 3) Calculating the circular convolution of two sequences. 4) Relations between group delay and phase delay. 5) Evaluating the DFT of a sequence. 6) The convolution property relating the DFT of two sequences. 7) The inverse DTFT of a rectangular pulse. 8) Finding the DFT of a given sequence. 9) Another example of

Uploaded by

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

Solution SAS 2023 12

The document contains 10 questions about concepts in digital signal processing including the discrete Fourier transform (DFT), discrete-time Fourier transform (DTFT), and circular convolution. The key points covered are: 1) The 2x2 DFT matrix and its properties. 2) The DTFT of a cosine signal. 3) Calculating the circular convolution of two sequences. 4) Relations between group delay and phase delay. 5) Evaluating the DFT of a sequence. 6) The convolution property relating the DFT of two sequences. 7) The inverse DTFT of a rectangular pulse. 8) Finding the DFT of a given sequence. 9) Another example of

Uploaded by

PALANIAPPAN C
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

2𝜋

1. The 2 × 2 DFT matrix is given as follows. 𝑊2 = 𝑒 −𝑗 2 = 𝑒 −𝑗𝜋 = −1. The DFT matrix
is
1 1 1 1
[ ]=[ ]
1 𝑊2−1 1 −1
Ans a
2. The DTFT of cos(Ω0 𝑛) is
𝜋𝛿(Ω − Ω0 ) + 𝜋𝛿(Ω + Ω0 )
Ans b
𝜋𝑛
3. Given 𝑥(𝑛) = cos ( 2 ) = {1,0, −1,0} for 0 ≤ 𝑛 ≤ 3 and ℎ(𝑛) = {−1,2, −3,4}. Let ⨀
denote element-wise product and sum. The circular convolution of 𝑥(𝑛) and ℎ(𝑛) is
evaluated as follows
𝑌(0) = {−1,2, −3,4}⨀{1,0, −1,0} = 2
𝑌(1) = {−1,2, −3,4}⨀{0,1,0, −1} = −2
𝑌(2) = {−1,2, −3,4}⨀{−1,0,1,0} = −2
𝑌(3) = {−1,2, −3,4}⨀{0, −1,0,1} = 2
The output is 𝑦(𝑛) = { 2, −2, −2,2}
Ans a
4. Given phase response 𝜙(𝜔). Its group and phase delays, respectively, at 𝜔 = 𝜔0 are
given as
𝑑𝜙(𝜔) 𝜙(𝜔0 )
− | ,−
𝑑𝜔 𝜔=𝜔 𝜔0
0

Ans c
5. The DFT is given as
{2,3,2,3,2,3,2,3}
3 3
2𝑛𝑘 𝑘 2𝑛𝑘
𝑗2𝜋 𝑗2𝜋
𝑋(𝑘) = 2 ∑ 𝑒 8 + 3𝑒 8 ∑ 𝑒 𝑗2𝜋 8
𝑛=0 𝑛=0
3 3
𝑗𝜋𝑘 𝜋𝑘 𝑗𝜋𝑘
𝑛
= 2∑𝑒 2 + 3𝑒 𝑗 4 ∑ 𝑒 2
𝑛

𝑛=0 𝑛=0
3
𝜋𝑘 𝑗𝜋𝑘
= (2 + 3𝑒 𝑗 4 ) ∑ 𝑒 2
𝑛

𝑛=0
𝜋𝑘 1 − 𝑒 𝑗2𝜋𝑘
= (2 + 3𝑒 𝑗 4 ) 𝜋𝑘 if 𝑘 = 0,4 and 0 otherwise
𝑗
1−𝑒 2
𝜋𝑘
𝑗
= (2 + 3𝑒 4 ) × 4 if 𝑘 = 0,4 and 0 otherwise
Therefore, 𝑋(0) = 5 × 4 = 20, 𝑋(4) = (2 − 3) × 4 = −4
𝑋(𝑘) = {20,0,0,0, −4,0,0,0}

Ans b
6. The DFT of 𝑥1 (𝑛)𝑥2 (𝑛) is
1
𝑋 (𝑘) ⊛ 𝑋2 (𝑘)
𝑁 1
Ans b
7. Given 𝑋(Ω) = 1, |Ω| ≤ 𝑊 and 0 for 𝑊 < |Ω| ≤ 𝜋. As shown in lectures, its inverse
DTFT is
sin(𝑊𝑛)
𝜋𝑛
Ans b
8. The 8 −pt of {2,0,0,0,3,0,0,0} is
4𝑘
𝑋(𝑘) = 2 + 3𝑒 −𝑗2𝜋 8 = 2 + 3𝑒 −𝑗𝜋𝑘 = {5, −1,5, −1,5, −1,5, −1}
Ans d
𝜋𝑛
9. Given 𝑥(𝑛) = sin ( 2 ) = {0,1,0, −1} for 0 ≤ 𝑛 ≤ 3. ℎ(𝑛) = {4,2,1,3}. Let ⨀ denote
element wise product and sum. The circular convolution of 𝑥(𝑛) and ℎ(𝑛) is evaluated
as follows
𝑦(0) = {4,2,1,3}⨀{0, −1,0,1} = 1
𝑦(0) = {4,2,1,3}⨀{1,0, −1,0} = 3
𝑦(0) = {4,2,1,3}⨀{0,1,0, −1} = −1
𝑦(0) = {4,2,1,3}⨀{−1,0,1,0} = −3
Hence, 𝑦(𝑛) = {1,3, −1, −3}
Ans c
10. Given 𝑥(𝑛) has DFT 𝑋(𝑘), then 𝑋(𝑛) has DFT
𝑁𝑥(−𝑘 mod 𝑁)
Ans a

You might also like