Scribd
Upload
593 views4 pages

AddEx Ch5

The document provides 10 examples of calculations involving discrete Fourier transforms (DFTs) of finite-length sequences. Example 1 analyzes the properties of 4 length-8 sequences based on their DFT properties. Example 2 determines the 7-point DFT H[k] of a sequence h[n] based on its relation to the DFT G[k] of another sequence g[n]. Example 3 similarly determines h[n] based on its relation to G[k].

Uploaded by

manish
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
593 views4 pages

AddEx Ch5

The document provides 10 examples of calculations involving discrete Fourier transforms (DFTs) of finite-length sequences. Example 1 analyzes the properties of 4 length-8 sequences based on their DFT properties. Example 2 determines the 7-point DFT H[k] of a sequence h[n] based on its relation to the DFT G[k] of another sequence g[n]. Example 3 similarly determines h[n] based on its relation to G[k].

Uploaded by

manish
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/ 4

Additional Examples of Chapter 5:

Finite-Length Discrete Transforms


Example E5.1: Consider the following length-8 sequences defined for 0 n 7 :
(a) {x1[n]} = {1 1 1 0 0 0 1 1}, (b) {x2 [n]} = {1 1 0 0 0 0 1 1},

(c) {x3[n]} = {0 1 1 0 0 0 1 1}, (d) {x 4[n]} = {0 1 1 0 0 0 1 1}.


Answer: (a) x1[n8 ] = [1 1 1 0 0 0 1 1] = x1[n]. Thus, x1[n] is a periodic even
sequence, and hence it has a real-valued 8-point DFT.

(b) x 2[n8 ] = [1 1 1 0 0 0 0 1]. Thus, x 2[n] is neither a periodic even or a


periodic odd sequence. Hence, its 8-point DFT is a complex sequence.
(c) x 3[n8 ] = [0 1 1 0 0 0 1 1] = x3 [n]. Thus, x 3[n] is a periodic odd
sequence, and hence it has an imaginary-valued 8-point DFT.
(d) x 4 [n8 ] = [0 1 1 0 0 0 1 1] = x 4[n]. Thus, x 4 [n] is a periodic even sequence,
and hence it has a real-valued 8-point DFT.
______________________________________________________________________________
Example E5.2: Let G[k] and H[k] denote the 7-point DFTs of two length-7 sequences, g[n]
and h[n], 0 n 6, respectively. If
G[k] = {1+ j2, 2 + j3, 1 j2, 0, 8 + j4, 3 + j, 2 + j5}
and h[n] = g[n 37 ], determine H[k] without computing the IDFT g[n].
Answer:

H[k] = DFT{h[n]} = DFT{g[{n 3 > 7 ]} = W73k G[k] = e

6k
7 G[k]

6
12
24
30
36

j
j
j
j
j
7
7
7
7

= 1 + j2, e
(2 + j3), e
(1 j2), 0, e
(8 + j4), e
(3 + j2), e 7 (2 + j5)

______________________________________________________________________________
Example E5.3: Let G[k] and H[k] denote the 7-point DFTs of two length-7 sequences, g[n] and
h[n], 0 n 6, respectively. If g[n] = {3.1, 2.4, 4.5, 6, 1, 3, 7} and
G[k] = H[k 4 7 ], determine h[n] without computing the DFT G[k].
Answer:

8 n
j
4n
h[n] = IDFT {H[k]} = IDFT{G[< k 4 > 7 ]}= W7 g[n] = e 7 g[n]
j8/ 7
j16/ 7
j24/ 7
j32/ 7
j40 / 7
j42 / 7

= 3.1, 2.4 e

, 4.5e

, 6e

, 3e

, 7e

].

______________________________________________________________________________
Example E5.4: Let X[k], 0 k 13, be a 14-point DFT of a length-14 real sequence x[n]. The
first 8 samples are given by X[0] = 12, X[1] = 1+j3, X[2] = 3+j4, X[3] = 1j5, X[4] = 2+j2,
X[5] = 6+j3, X[6] = 2j3, X[7] = 10. Determine the remaining samples of X[k]. Evaluate the
following functions of x[n] without computing the IDFT of X[k]:
-1-

Additional Examples of Chapter 5:


Finite-Length Discrete Transforms
(a) x[0], (b) x[7], (c)

13

13

13

n= 0 x[n], (d) n= 0 e j(4 n / 7) x[n], and (e) n= 0 x[n]

Answer: X[8] = X *[ 814 ] = X *[6] = 2 + j3, X[9] = X *[ 914 ] = X * [5] = 6 j3,


X[10] = X *[1014 ] = X *[4] = 2 j2, X[11] = X *[1114 ] = X *[3] = 1+ j5,

X[12] = X *[ 1214 ] = X *[2] = 3 j4, X[13] = X * [1314 ] = X *[1] = 1 j3.


13

(a) x[0] =

1
32
X[k] =
= 2.2857,

14 k =0
14

(b) x[7] =

1
12
k
(1) X[k] = = 0.8571,

14 k =0
14

13

(c)

13

x[n] = X[0] = 12,

n =0

4 n
4 n
x[n]. Then DFT{g[n]} = DFT{W14
x[n]} = X[k 414 ]
(d) Let g[n] = e j(4 n /7) x[n] = W14
= [X[10] X[11] X[12] X[13] X[0] X[1] X[2] X[3] X[4] X[5] X[6] X[7] X[8] X[9]]

Thus,

13

13

n =0

n =0

g[n] = e j(4 n / 7)x[n] = X[10] = 2


13

j2,

13

1
498
2
X[k] =
= 35.5714.

14
14
k =0
n =0
______________________________________________________________________________

(e) Using Parseval's relation,

x[n] =

Example E5.5: Consider the sequence x[n] defined for 0 n 11,


{x[n]} = {3, 1, 2, 4, 3, 2, 0, 1, 4, 6, 2, 5},
with a 12-point DFT given by X[k], 0 k 11. Evaluate the following functions of X[k]
without computing the DFT:
11
11
11
(a) X[0], (b) X[6], (c) k = 0 X[k], (d) k = 0 e j(2 k / 3) X[k], and (e) k = 0 X[k] 2 .
Answer: (a) X[0] =
11

(c)
11

11

x[n] = 13, (b) X[6] =

n =0

X[k] = 12 x[0] = 36,

k= 0

11

(1)n x[n] = 13,

n =0

(d) The inverse DFT of e j(4 k /6 )X[k] is x[n 412 ] . Thus,

e j(4 k / 6) X[k] = 12 x[< 0 4 >12 ] = 12 x[8] = 48.

k= 0

(e) From Parseval's relation,

11

X[k]

k= 0

11

= 12

x[n] 2 = 1500.

n= 0

______________________________________________________________________________
-2-

Additional Examples of Chapter 5:


Finite-Length Discrete Transforms
Example E5.6: The even samples of the 11-point DFT of a length-11 real sequence are given
by X[0] = 4, X[2] = 1 + j3, X[4] = 2 + j5, X[6] = 9 j6, X[8] = 5 j8, and X[10] = 3 j2.
Determine the missing odd samples.
Answer: Since x[n] is a real sequence, its DFT satisfies X[k] = X *[k N ] where N = 11 in
this case. Therefore, X[1] = X *[111] = X *[10] = 3 + j2,
X[3] = X *[311] = X *[8] = 5 + j8, X[5] = X *[511] = X *[6] = 9 + j6,
X[7] = X *[ 711 ] = X *[4] = 2 j5, X[9] = X *[ 911 ] = X *[2] = 1 j3.
______________________________________________________________________________
Example E5.7: The following 6 samples of the 11-point DFT X[k], 0 k 10, are given: X[0]
= 12, X[2] 3.2 j2, X[3] = 5.3 j4.1, X[5] = 6.5 + j9, X[7] = 4.1 + j0.2, and X[10] = 3.1 +
j5.2. Determine the remaining 5 samples.
Answer: The N-point DFT X[k] of a length-N real sequence x[n] satisfy X[k] = X *[k N ].
Here N = 11. Hence, the remaining 5 samples are X[1] = X *[111] = X *[10] = 3.1 j5.2,
X[4] = X *[ 411] = X *[7] = 4.1 j0.2, X[6] = X *[ 611] = X *[5] = 6.5 j9,
X[8] = X *[811] = X *[3] = 5.3+ j4.1, X[9] = X *[911 ] = X *[2] = 3.2 + j2.
______________________________________________________________________________
Example E5.8: A length-10 sequence x[n], 0 n 9, has a real-valued 10-point DFT X[k],
0 k 9. The first 6 samples of x[n] are given by: x[0] = 2.5, x[1] = 0.7 j0.08, x[2] = 3.25
+ j1.12, x[3] = 2.1 + j4.6, x[4] = 2.87 + j2, and x[5] = 5. Determine the remaining 4 samples.
Answer: A length-N periodic even sequence x[n] satisfying x[n] = x *[nN ] has a real-valued
N- point DFT X[k]. Here N = 10. Hence, the remaining 4 samples of x[n] are given by
x[6] = x *[610 ] = x *[4] = 2.87 j2, x[7] = x *[710 ] = x *[3] = 2.1 j 4.6,
x[8] = x *[810 ] = x * [2] = 3.25 j1.12, and x[9] = x *[910 ] = x *[1] = 0.7+ j0.08.
______________________________________________________________________________
Example E5.9: The 8-point DFT of a length-8 complex-valued sequence v[n] = x[n] + jy[n] is
given by
{V[k]} = {2 + j3, 1+ j5, 4 + j7, 2 + j6, 1 j3, 4 j, 3 + j8, j6}.
Without computing the IDFT of V[k], determine the 8-point DFTs X[k] and Y[k] of the real
sequences x[n] and y[n], respectively.
Answer: v[n] = x[n] + j y[n]. Hence, X[k] =

1
{V[k]+ V * k8 ]} is the 8-point DFT of x[n],
2

1
{V[k] V * k8 ]} is the 8-point DFT of y[n]. Now,
2j
V *[ k8 ] = [2 j3, j6, 3 j8, 4 + j, 1 + j3, 2 j6, 4 j7, 1 j5].
Therefore,
X[k] = [0.2, 0.5 j0.5, 0.5 j0.5, 3 + j3.5, 1, 3 j3.5, 0.5 + j0.5, 0.5 + j0.5]
Y[k] = [3, 5.5 j0.5, 7.5 + j3.5, 2.5 + j 3, 2.5 j, 7.5 j3.5, 5.5 + j0.5]
______________________________________________________________________________
and Y[k] =

-3-

Additional Examples of Chapter 5:


Finite-Length Discrete Transforms
Example E5.10: Determine the 4-point DFTs of the following length-4 sequences, 0 n 3,
defined for by computing a single DFT: {g[n]} = {2, 1, 3, 4}, {h[n]} = {1, 2, 3, 2}.
Answer: v[n] = g[n] + jh[n] = [2 + j, 1+ j2, 3 j3, 4 + j2]. Therefore,
V[0] 1 1 1 1 2 + j j2
V[1] 1 j 1 j 1+ j2 1 + j7
=

, i.e., {V[k]} = [j2, 1 + j7, 10 j6, 1 + j].


=

V[2] 1 1 1 1 3 j3 10 j6

V[3] 1 j 1 j 4 + j 2 1+ j

Thus, {V *[k 4 ]} = [ j2, 1 j, 10 + j6, 1 j 7].


1
Therefore, G[k] = {V[k] + V *[ k 4 ]}= [0, 1+ j3, 10, 1 j3] and
2
1
H[k] = {V[k] V *[k 4 ]} = [2, 4, 6, 4]..
2j
______________________________________________________________________________

-4-

You might also like