DTFT, DFT and FFT

1. Let () = ( ) (), () = 2 () ( ) be the Fourier Transform

2
of (). Then ( 0 ) is
(a)

(c) 4

(d)

(b) 2

4
3

[GATE 2005: 1 Mark]

Soln. Given

() = ( ) ()

And () = () = ( )

()

Or, () = [( ) ] () = ( ) ()

Taking Fourier Transform

( ) = ()
=

= ( )

( ) = ( ) = + + ( ) +

()

2. A signal () = sin(0 + ) is the input to a linear time-invariant system

having a frequency response ( ). If the output of the system (
0 ), then the most general form of ( ) will be
(a) 0 0 + for any arbitrary real
(b) 0 0 + 2 for any arbitrary integer k
(c) 0 0 + 2 for any arbitrary integer k
(d) 0 0
[GATE 2005 : 2 Marks]
Soln. Given
() = ( )
Taking Fourier Transform

( ) = ( )
Or, ( ) =
Thus

( )
( )

( ) =

For LTI discrete time system phase and frequency of ( ) are

periodic with period . So in general form

() = +
Option (b)

3. A 5-point sequence [] is given as

[3] = 1, [2] = 1, [1] = 0, [0] = 5, [1] = 1
Let ( ) denote the discrete-time Fourier Transform of []. The value
of

( )

(c) 16
(d) 5 + 10
[GATE 2007 : 2 Marks]

(a) 5
(b) 10

Soln. Discrete Fourier Transform (DTFT) when is given by

() =
( )

For n = 0, we get

[] =
( ) .

=
( )

( ) = [] =

Option (b)

4. {()} is real-valued periodic sequence with a period N. () and ()

form N-point Discrete Fourier Transform (DFT) pairs. The DFT Y(k) of the
sequence
1

1
() = () ( + )

=0

(a) |()|2
1

1
() () ( + )

=0

1
() () ( + )

=0

(d) 0
[GATE 2008 : 2 Marks]
Soln. Given

() = () ( + )

() is the correlation of a signal () with itself.

The Fourier Transform of auto correlation function is |()|
Option (b)

5. The 4-point discrete Fourier Transform (DFT) of a discrete time sequence

{1, 0, 2, 3} is
(a) [0, 2 + 2, 2, 2 2]
(c) [6, 1 3, 2, 1 + 3]
(b) [2, 2 + 2, 6, 2 2]
(d) [6, 1 + 3, 0, 1 3]
[GATE 2009 : 2 Marks]
Soln. Given discrete time sequence
[] = {, , , } =

[] = [] /

= , , ( )

For N = 4

[] = [] /

= , ,

Now

[] = [] = [] + [] + [] + []
=

= +++=

[] = []

= [] + [] + [] + []/

= + + = +

[] = [] = [] + [] + [] + []
=

= ++=

[] = [] / = [] + []/ + [] + []/
=

= + =
Thus

[, + , , ]

Option (d)

6. For an N-point FFT algorithm with = 2 , which one of the following

statements is TRUE?
(a) It is not possible to construct is signal flow graph with both input and
output in normal order
(b) The number of butterflies in the mth state is N/m
(c) In-place computation requires storage of only 2N node data
(d) Computation of a butterfly requires only one complex multiplication
[GATE 2010 : 1 Mark]
Soln. For an N-point FFT algorithm.
Butterfly operate on one pair of samples and involves two complex
additions and one complex multiplication
Option (d)

7. The first six points of the 8-point DFT of a real valued sequence are 5, 1
3, 0, 3 4, and 3 + 4. The last two points of the DFT are respectively
(a) 0, 1 3
(c) 1 + 3, 5
(b) 0, 1 + 3
(d) 1 3, 5
[GATE 2011 : 2 Marks]
Soln. Given that the sequence is real valued with 8 points.
i.e.
() = [(), (), (), (), (), (), (), ()]
= [, ( ), , ( ), , ( + ), , ]
If the sequence [] is real then [] is conjugate symmetric
i.e.

[] = [ ]
[] = [ ] = [] =

thus

[] = [ ] = [] = +
Option (b)

8. Consider a discrete time periodic signal [] = sin ( ). Let ak be the

5
complex. Fourier series coefficients of []. The coefficients { } are nonzero when = 1, where m is any integer. The value of B is ______.
[GATE 2014 : 2 Marks]
Soln. Given

() = [ ]

Find the value of B

() = [ ]

Time period of

() =

[ ] =

So, exist for =

[] is a discrete time signal its Fourier series coefficients exist after
each time interval value
. .

= , , ,
= =

Answer: B = 10