Ch2_课件new_c_培训课件.pptVIP

  1. 1、本文档共76页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Ch2_课件new_c_培训课件.ppt

§2.5 The Sampling Process If the unit of sampling period T is in seconds The unit of normalized digital angular frequency ?0 is radians/sample The unit of normalized analog angular frequency ?0 is radians/second The unit of analog frequency f0 is hertz (Hz) Plots of these sequences (shown with circles) and their parent time functions are shown below: Note that each sequence has exactly the same sample value for any given n The above phenomenon of a continuous-time signal of higher frequency acquiring the identity of a sinusoidal sequence of lower frequency after sampling is called aliasing Homework Problems 2.3, 2.4(b), 2.17, 2.21(a),(c), 2.22,2.41,2.43(只须做x[n] ),2.51 MATLAB Exercise M 2.1, M 2.2, M 2.4, M 2.6 In down-sampling by an integer factor M 1, every M-th samples of the input sequence are kept and M-1 in-between samples are removed: y[n]=x[nM] An example of the down-sampling operation ( Down-sampling factor M=3 ) The time-reversal operation on a finite- length sequence is obtained using the modulo operation Let 0,1,…,N-1 be a set of N positive integers and let m be any integer. The integer r obtained by evaluating modulo operation r= mN= m modulo N is called the residue,an integer with a value between 0 and N-1 r=m+lN where l is a positive or negative integer chosen to make m+lN an integer between 0 and N-1 〔2.3节内容衔接5.4节(圆周卷积)和5.5节(序列分类)〕 2.3 Operations on Finite-Length Sequences 2.3.1 Circular Time-Reversal Operation The circular time-reversal version {y[n]} of a length-N sequence {x[n]} defined for 0 ≤ n ≤ N-1 is given by { y[n]}={x[-nN]} Example – Consider {x[n]}={x[0], x[1], x[2], x[3], x[4]} Its circular time-reversed version is given by {y[n]}={x[-n5]} ( length N=5 ) ={x[0], x[4], x[3], x[2], x[1]} The circular shift operation for a finite- length sequence is defined using the modulo operation Let x[n] be a length-N sequenc

文档评论(0)

celkhn5460 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档