Q2: Given a discrete sequence x(n) = [1,-1,2,4, 1, 3,-1,1] and its spectrum X(k): i. Show that: X(k) = G(k)+WH(k) k = 0,1,2,3,4,5,6,7 where G(k) = DFT[g(n)] and H(k) = DFT[h(n)], g(n) and h(n) are even and odd components of x(n) respectively. ii. Compute G(k) and H(k) using the method of computation of DFTS of two real sequences.

Power System Analysis and Design (MindTap Course List)
6th Edition
ISBN:9781305632134
Author:J. Duncan Glover, Thomas Overbye, Mulukutla S. Sarma
Publisher:J. Duncan Glover, Thomas Overbye, Mulukutla S. Sarma
Chapter6: Power Flows
Section: Chapter Questions
Problem 6.16P
icon
Related questions
Question
Q2: Given a discrete sequence x(n) = [1,-1,2,4, 1, 3,-1,1] and its spectrum X(k):
i. Show that:
X(k) = G(k)+WH(k)
k = 0,1,2,3,4,5,6,7
where G(k) = DFT[g(n)] and H(k) = DFT[h(n)], g(n) and h(n) are even and odd components
of x(n) respectively.
ii. Compute G(k) and H(k) using the method of computation of DFTS of two real sequences.
Transcribed Image Text:Q2: Given a discrete sequence x(n) = [1,-1,2,4, 1, 3,-1,1] and its spectrum X(k): i. Show that: X(k) = G(k)+WH(k) k = 0,1,2,3,4,5,6,7 where G(k) = DFT[g(n)] and H(k) = DFT[h(n)], g(n) and h(n) are even and odd components of x(n) respectively. ii. Compute G(k) and H(k) using the method of computation of DFTS of two real sequences.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Power System Analysis and Design (MindTap Course …
Power System Analysis and Design (MindTap Course …
Electrical Engineering
ISBN:
9781305632134
Author:
J. Duncan Glover, Thomas Overbye, Mulukutla S. Sarma
Publisher:
Cengage Learning