NPTEL Online Certificate Courses

Indian Institute of Technology, Kharagpur

Digital Image Processing Assignment Week 6

1. What is the time complexity of Fast Fourier Transform for an N- point Discreet Fourier Transform?
a. O(n2)
b. O(nlogn)
c. O(log 2n)
d. None of the above

2. Which of the following statement is true?

a. DFT and its inverse are periodic functions
b. Only DFT is periodic functions and not Inverse DFT
c. Only Inverse DFT is periodic functions and not DFT
d. None of the above

3. If 𝑥(𝑛) = 𝑥𝑅 (𝑛) + 𝑗 𝑥𝑙 (𝑛) is a complex sequence, whose Fourier Transform is can be ginen by
𝑋(𝜔) = 𝑋𝑅 (𝜔) + 𝑗 𝑋𝑙 (𝜔), then what is the value of 𝑋𝑅 (𝜔)?

a. ∑∞
𝑛=0[𝑥𝑅 (𝑛) cos(𝜔𝑛) − 𝑥𝑙 (𝑛) sin(𝜔𝑛)]
b. ∑∞
𝑛=0[𝑥𝑅 (𝑛) cos(𝜔𝑛) + 𝑥𝑙 (𝑛) sin(𝜔𝑛)]
c. ∑∞
𝑛=−∞[𝑥𝑅 (𝑛) cos(𝜔𝑛) + 𝑥𝑙 (𝑛) sin(𝜔𝑛)]
d. ∑∞
𝑛=−∞[𝑥𝑅 (𝑛) cos(𝜔𝑛) − 𝑥𝑙 (𝑛) sin(𝜔𝑛)]

4. What is the circular convolution of the sequences of 𝑥1 𝑎𝑛𝑑𝑥2, where 𝑥1(𝑛) = 𝑥2(𝑛) = {1,3,1}?

a. {1,2,3,2,1}
b. {7,7,11}
c. {1,6,1}
d. {1,8,1,11,1}

5. What is the Fourier transform of the signal 𝑥(𝑛) = 𝑎|𝑛| , |𝑎| < 1 ?
1+𝑎2
a.
1−2𝑎 cos 𝜔+𝑎 2
1−𝑎2
b. 1−2𝑎 cos 𝜔+𝑎 2
2𝑎
c. 1−2𝑎 cos 𝜔+𝑎 2

d. None of the above

6. Fast Fourier Tranform can be used to calculate
1) DFT 2) IDFT 3) Direct Z transform 4) In direct Z transform

a. 1, 2 and 3 are correct

b. 1 and 4 are correct
c. 1 and 2 are correct
d. All the four are correct

7. Discrete cosine transforms (DCTs) express a function or a signal in terms of

a. Sum of cosine functions oscillating at frequencies incresing monotonically
b. Sum of cosine functions oscillating at different frequencies
c. Sum of cosine functions at different sampling intervals
d. Sum of cosine functions oscillating at same sampling intervals

8. Which of the two dimensional transform kernels are separable and symmetric?
a. Discrete Cosine Transform (DCT)
b. Discrete Fourier Transform (DFT)
c. Discrete Walsh Transformation (DWT)
d. All of the above

9. Which of the following statement(s) is(are) true with respect to Hadamard Transform?
1) Forward and Inverse transforms are identical.
2) Hadamard kernels are separable and symmetric.

a. Statement 1 and 2 are both true.

b. Statement 1 is only true.
c. Statement 2 is only true.
d. None of the statement 1 or 2 is true.

10. Which of the following is (are) the property(ies) of two dimension Fourier transform.
a. Separability
b. Asymmetry
c. Periodicity and non-conjugate property
d. All of the above
 Solutions:
1 b) O(nlogn): There are 2n computation per stage and there are log n stages. Hence complexity
should be O(nlogn)

2 a) DFT and its inverse are periodic functions: Follow the definition of DFT to prove that X(k+N)
= X(K) where X(k) are DFT coefficients. Same goes for IDFT.

3 b) ∑∞ ∞
𝑛=−∞[𝑥𝑅 (𝑛) cos(𝜔𝑛) + 𝑥𝑙 (𝑛) sin(𝜔𝑛)]: 𝑿(𝜔) = ∑𝑛=−∞ 𝑥(𝑛)𝑒
(−𝑗𝜔𝑛) ]. Replace

x(n) as given in definition to obtain the result.

4 b) {7,7,11}: Follow the circular method to obtain the circular convolution of the given two
series.

𝑛 −𝑛 1
5 d) None of the above: X(𝜔) = ∑∞
𝑛=−0[𝑎 𝑒 −𝑗𝜔𝑛 ] + ∑0𝑛=−∞[𝑎 𝑒 𝑗𝜔𝑛 ] = 1−𝑎𝑒 −𝑗𝜔 +
1
1−𝑎𝑒 𝑗𝜔

6 c) 1 and 2 are correct: FFT is a computationally efficient method to compute DFT or its inverse.

7 b) Sum of cosine functions oscillating at different frequencies: By definition, a discrete cosine

transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions
oscillating at different frequencies.

8 d) All of the above: Follows from the definitions of the respective transforms.

9 a) Statement 1 and 2 are both true: Follows from the properties of Hadamard Transform.

10 a) Separability: Fourier transform has the properties of Symmetry and Complex conjugation
besides being Separable. It does not have any periodic properties.