信号与系统 Chapter 3 Time Domain Analysis of the Discrete-Time Systems.ppt

信号与系统 Chapter 3 Time Domain Analysis of the Discrete-Time Systems.ppt

  1. 1、本文档共31页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
信号与系统 Chapter 3 Time Domain Analysis of the Discrete-Time Systems

Chapter 3 Time Domain Analysis of the Discrete-Time Systems ξ3.1The Difference Equation of Systems ξ3.1.1 Linear Constant-Coefficient Difference Equation Ex3.1.1: if one pair rabbit can born one pair rabbit in a month, more than two months old rabbit can born new one, if we have one pair rabbit in first month, How many pair rabbits we get in n months? y(k)+an-1y(k-1)+… +a0y(k-n)= bmf(k)+bm-1f(k-1)+…+b0f(k-m) Solution: y(n)-y(n-1)-y(n-2)=0 0 1 1 2 3 5 8 13 21 34 55 y(n)=2*y(n-2)+y(n-1)-y(n-2) y(0)=0;y(1)=1; ξ3.1.2 The Classic Solution of Differential Equation y(k)+a n-1 y(k-1)+…+a 1 y (k-n+1)+a 0 y(k-n)= b m f (k)+…+b 0 f(k-m) k=0 y(k)=yh (k)+y p (k) yh(k)+an-1yh(k-1)+…+a1yh(k-n+1)+a0yh(k-n)=0 λ(n)+an-1λ(n-1)+…+a1λ+a0=0 yp (k) a particular solution yh (k) a homogeneous solution Root: λ1, λ2,…λn λ1≠λ2 ≠ … ≠ λn: yh(k)=c1λ1k+c2λ2k+…+cnλnk yh(k)=c1λ1k+c2kλ1k+…+cnλnk λ1=λ2: Ex3.1.2: y(k)+3y(k-1)+2y(k-2)=f(k) f(k)=ε(k),y(0)=1;y(1)=0; y(k)=? Solution: {3/2(-1)k-2/3(-2)k+1/6} ε(k) 1 0 -1 4 -9 20 -41 84 Ex3.1.3: y(k)+3y(k-1)+2y(k-2)=f(k) +f(k-1) f(k)=(-2)kε(k),y(0)=0;y(1)=0; y(k)=? Solution: {2(-1)k-2(-2)k+K(-2)k} ε(k) 0 0 2 -10 34 -98 258 n=[0:6]; x=((-2).^n).*U(n); y=zeros(1,length(n)); y(1)=0; y(2)=0; for k=3:length(n) y(k)=x(k)+x(k-1)-3*y(k-1)-2*y(k-2); end y stem(n,y); ylabel(y(n)); 6 ξ3.2 Zero-Input Response of Discrete Systems ξ 3.2.1 Zero-Input Response of the Simple Systems f(k)=0: yx(k) : yh(k) y(k) +a n-1 y(k-1)+…+a 1 y (k-n+1)+a 0 y(k-n)= b m f (k)+…+b 0 f(k-m) y(k)-λy(k-1)=f(k) yx(k)=C λk =y(0)λk 1. First-Order Systems f(k)=0 pole: p=λ =λ * λ*… *λy(0) y(k)=y(0)λk 2. Second-Order Systems yx(k)=C1 λ1k +C2 λ2k y(k)+a1y(k-1)+a0y(k-2)=f(k) yx(k)=(C1 +C2k) λk y(k)= λy(k-1)

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档