ECEN 644 HOMEWORK #5 SOLUTION SET

Similar documents
The Random Walk For Dummies

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

6.003 Homework #3 Solutions

Assignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.

ECEN 644 ADVANCED DIGITAL SIGNAL PROCESSING HOMEWORK #3 - SOLUTIONS

Frequency Response of FIR Filters

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

COMM 602: Digital Signal Processing

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

6.3 Testing Series With Positive Terms

Math 210A Homework 1

Algorithms and Data Structures 2014 Exercises and Solutions Week 13

Polynomial Functions and Their Graphs

TR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT

Matsubara-Green s Functions

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e)

INEQUALITIES BJORN POONEN

11.6 Absolute Convergence and the Ratio and Root Tests

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

FIR Filter Design: Part II

1 Generating functions for balls in boxes

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

radians A function f ( x ) is called periodic if it is defined for all real x and if there is some positive number P such that:

Chapter 6 Infinite Series

Sequences and Series of Functions

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Computing the output response of LTI Systems.

Chapter 7: The z-transform. Chih-Wei Liu

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Math 113, Calculus II Winter 2007 Final Exam Solutions

Ch3 Discrete Time Fourier Transform

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

Fall 2011, EE123 Digital Signal Processing

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Chapter 4. Fourier Series

Ma 530 Introduction to Power Series

SOLUTION SET VI FOR FALL [(n + 2)(n + 1)a n+2 a n 1 ]x n = 0,

Solutions to Final Exam Review Problems

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

2D DSP Basics: 2D Systems

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

CHAPTER 4 FOURIER SERIES

The Discrete Fourier Transform

Properties and Tests of Zeros of Polynomial Functions

A. Basics of Discrete Fourier Transform

Physics 116A Solutions to Homework Set #9 Winter 2012

2 Geometric interpretation of complex numbers

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

ANSWERS SOLUTIONS iiii i. and 1. Thus, we have. i i i. i, A.

Square-Congruence Modulo n

Z ß cos x + si x R du We start with the substitutio u = si(x), so du = cos(x). The itegral becomes but +u we should chage the limits to go with the ew

Machine Learning for Data Science (CS 4786)

Problem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =

1 Counting and Stirling Numbers

SOME TRIBONACCI IDENTITIES

Seunghee Ye Ma 8: Week 5 Oct 28

Section 11.8: Power Series

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Some remarks for codes and lattices over imaginary quadratic

1. Linearization of a nonlinear system given in the form of a system of ordinary differential equations

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

Please do NOT write in this box. Multiple Choice. Total

Frequentist Inference

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Complex Analysis Spring 2001 Homework I Solution

Infinite Sequences and Series

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Worksheet on Generating Functions

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

The Discrete-Time Fourier Transform (DTFT)

SCORE. Exam 2. MA 114 Exam 2 Fall 2017

Problem Set 2 Solutions

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Lecture 7: Properties of Random Samples

Chapter 8. DFT : The Discrete Fourier Transform

1. By using truth tables prove that, for all statements P and Q, the statement

Solutions to Math 347 Practice Problems for the final

Math 155 (Lecture 3)

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.

MAT1026 Calculus II Basic Convergence Tests for Series

Introductory Analysis I Fall 2014 Homework #7 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Bernoulli numbers and the Euler-Maclaurin summation formula

Expected Number of Level Crossings of Legendre Polynomials

Ma 530 Infinite Series I

MAT 271 Project: Partial Fractions for certain rational functions

Quantum Theory Assignment 3

4.1 Sigma Notation and Riemann Sums

Recurrence Relations

Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra

Machine Learning for Data Science (CS 4786)

MATH 1910 Workshop Solution

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

Solutions to Tutorial 5 (Week 6)

Transcription:

ECE 644 HOMEWORK #5 SOUTIO SET

7. x is a real valued sequece. The first five poits of its 8-poit DFT are: {0.5, 0.5 - j 0.308, 0, 0.5 - j 0.058, 0} To compute the 3 remaiig poits, we ca use the followig property for real valued sequeces: * X X X (page 468 i the boo) I our case =8 ad therefore we have the equatios for X 5, X 6 ad 7 * 5 8 3 3 X X X 0.5 j 0.058 0.5 j 0.058 * X : * 6 8 X X X 0 0 * * 7 8 X X X 0.5 j 0.308 0.5 j 0.308 * Hece the complete 8-poit DFT of x is: {0.5, 0.5 - j 0.308, 0, 0.5 - j 0.058, 0, 0.5 + j 0.058, 0, 0.5 + j 0.308}.

7.3 X,0, X as: is the -poit DFT of X x, 0. We defie the DFT X, 0 c, c, 0, c c From this defiitio, we ca represet X as the product of lowpass filter H where: H, 0 c, c, 0, c c X with the ideal Hece this leads to the coclusio that x, the iverse -poit DFT of lowpass versio of x. X, is a

7.7 X is the -poit DFT of the sequece DFTs of the two sequeces derived from x. We wat to determie the -poit x : xc x 0 cos, 0 xs x 0 si, 0 The DFT of x, X c c, is give by: 0 X c xcos exp j 0 Developig the cosie i the previous equality we get: 0 0 X c x exp j exp j exp j 0 0 0 xexp j xexp j 0 0 From the properties of the DFT, this expressio simply becomes: X X X c 0 mod 0 mod Operatig the same way for the sequece x we get the correspodig DFT s X : s X X X j j s 0 mod 0 mod

7.3 a) xp of is a periodic sequece with fudametal period. We have the -poit DFT DFT DFT x : x X ad the 3-poit DFT of x : x X p p We wat to fid a expressio for as W exp j. We ca the write: X 3 as a fuctio of X 0 X x W 3 3 3 0 X x W p p. 3. et s first defie 3 W If we develop the previous expressio for X 3 we get: 3 3 3 3 3 0 X x W x W x W 3 ( ) ( ) xw xw3 xw3 0 0 0 3 3 3 xw xw3 W xw3 W 0 0 0 0 3 3 3 3 3 x W W W W W xw 0 3 Fially the desired expressio is obtaied: 3 3 3 X W W X 3

7.3 We have to compute the -poit DFT of 4 sigals: a) x b) x, 0 0 0 c) x a, 0, eve x 0 0, eve h) a) x The -poit DFT of x is defied as: X exp j 0 (0) 0exp j Therefore: DFT x, 0 X, 0 b) x 0, 0 0 The -poit DFT of X 0 exp j 0 ( 0 ) 0 exp j ( 0 ) exp j Therefore: x, 0 is defied as: 0 0

DFT 0 x 0, 0 0 X exp j, 0 c) x a, 0 The -poit DFT of x a, 0 X a exp j 0 is defied as: a exp j 0 a exp j a exp j a a exp j Therefore: DFT a x a, 0 X, 0 a exp j, eve h) x 0 0, eve, eve The -poit DFT of x 0 is defied as: 0, eve X xexp j 0

If we assume odd, the - is eve ad we have: ( ) (4 ) ( ) X exp j exp j... exp j terms i.e., X ( ) exp j ( ) exp j exp j 4 exp j exp j exp j exp j exp j Therefore:, eve DFT x 0 X, 0 0, eve exp j

7.8 We are give a discrete-time sigal x a, 0, where a 0.95 ad 0. (a) Here we eed to compute ad plot we have: x The correspodig plot ca be foud below. x. Obviously from the give values of a ad, 0.95, 0 0, 0 0.8 0.6 x() 0.4 0. 0-5 -0-5 0 5 0 5 0 cos (b) We eed to show that X x x X xexp j which i our case becomes:. By defiitio, we have

exp X a j a exp j 0 a exp j a exp j (0) a exp j a exp j a exp j whe i st sum a cos a exp j exp j 0 cos x x The correspodig plot at, 0,,...,, ca be foud below. 00 0 5 0 X() 5 0-5 0 0.5.5.5 3 3.5 (c) We eed to compute c for 30 with c defied as: c X, 0,,...,

For 30, c becomes: c X, 0,,...,9 30 30 Usig (b), we ca derive the desired expressio for c for 30 : c x0 x cos, 0,,...,9 30 30 0.95 cos, 0,,..., 9 30 30 The correspodig plot ca be foud below. 0.6 =30 0.5 0.4 0.3 c 0. 0. 0-0. 0 5 0 5 0 5 30 (d) We eed to compute x with x defied as: x c exp j 0 Replacig c by its expaded expressio i the previous equality we get:

9 x X exp j 0 30 30 9 X exp j 30 0 30 9 X w 30 0 exp jw Therefore x is the iverse 30-poit DFT of the DFT of plot ca be foud below. x. The correspodig =30 0.9 0.8 0.7 0.6 x ~ () 0.5 0.4 0.3 0. 0. 0-5 -0-5 0 5 0 5 (e) We eed to compute x for 30 with x x x l, l For 30, x becomes: x x 30 l, l defied as:

From the correspodig plot below, we ca see that x of x. is a periodic/repeated versio =30 0.9 0.8 0.7 0.6 x ~ () 0.5 0.4 0.3 0. 0. 0-80 -60-40 -0 0 0 40 60 80 (f) Here we just have to replace by 5 istead of 30 i the previously obtaied equatio. This is trivial so just the ew plots are beig show.. =5 0.8 0.6 c 0.4 0. 0-0. 0 4 6 8 0 4

.5 =5.4.3. x ~ (). 0.9 0.8-0 -8-6 -4-0 4 6 8 0.5 =5.4.3. x ~ (). 0.9 0.8-40 -30-0 -0 0 0 0 30

8. To show that exp j, 0 is a th root of uity we just have to show that X for X exp j, 0. This is fairly obvious sice: exp j exp j. Hece, exp j, 0 is a th root of uity. ow if we cosider the sum used i the orthogoality property, we ca rewrite that sum as: l l exp j exp j exp j 0 0 If l, the terms i the sum represet the equally spaced uity roots o the uit circle which add to zero. Mathematical proof if 0 l : l exp j l exp j l exp j l exp j 0

If l, the sum adds up to : l 0 exp j exp j 0 0 0 A plot of the uitary roots for =4 is show below.

8.3 x is a real valued -poit sequece with. X x j 0 x is The -poit DFT of exp which, beig eve, ca be rewritte as: X xw x W, where W exp j 0 xw x W 0 0 ' ' X correspods to the odd harmoics of X, i.e., X X therefore: X x W x W ( ) ' ( ) 0 x W W x W W W 0 ad becausew W. We ca simplify further this expressio usig the fact that W : Fially we get the odd harmoics of ' X xw W x W W 0 X usig the followig formulae: ' X X x x W W 0

8.4 We wat to develop a method to compute a 4-poit DFT from three 8-poit DFTs. et Y deote the 4-poit DFT ad,, DFTs. We the have: 3 Y y W y W 0 0 Y Y Y deote the three 8-poit 3 We ca rewrite this sum as three sums that would tae values amog the sets {0, 3, 6,, }, {, 4, 7,, } ad {, 5, 8,, 3} respectively. 3 0,3,6,...,4,7,...,5,8,... Y y W y W y W 7 7 7 y 3W y 3 W W y 3 W W 0. 3 0. 3 0. 3 7 7 7 y 3W y 3 W W y 3 W W 0. 3 0. 3 0. 3 8 pt DFT 8 pt DFT Y Y W Y W 3 8 pt DFT With three 8-poit DFTs, Y, Y, Y, we ca create a 4-poit DFT Y usig the followig formulae: 3 Y Y Y W Y W 3

8.7 We wat to derive the radix- decimatio i time usig the steps 8..6 to 8..8 i the boo. Page 59 i the boo already gives some guidelies o how to proceed such as selectig M ad. ) The first step to follow (8..6) maes us compute the M-poit DFTs F l, q defied as: M mq F l, q x l, m W, 0 l ; 0 q M m0 M Therefore we have two -poit DFTs to compute for l 0 ad l. M mq M m0 m0 mq 0, 0, 0, F q x m W x m W mq m0,, F q x m W ) The secod step (8..7) cosists i computig a ew rectagular array G l, q defied as: lq G l, q W F l, q, 0 l ; 0 q M Therefore we have two rectagular arrays to compute for l 0 ad l. (0) q 0, 0, 0, G q W F q F q M q q mq M M m0 () () G, q W F, q W x, mw

3) The third ad last step (8..8) cosists i computig the -poit DFT X p, q defied as: lp X p, q G l, q W, 0 p ; 0 q M l0 Therefore we have two -poit DFTs to compute for p 0 ad p. (0) l 0,,, X q G l q W G l q l0 l0 0,, () l,,, l0 l0 G q G q q 0,, F q W F q X q G l q W G l q W l 0,, G q W G q W 0 G 0, q G, q as W q 0,, F q W F q F 0, q ad F, q here are the same as F ad F boo ad therefore we get the desired radix- decimatio i time: i equatio 8..6 of the X 0, q X F W F X q X F W F,,0