广西大学《数字信号处理》课件-Chapter5 Finite-Length Discrete Transform.pptVIP

下载本文档

4
0
约8.15千字
约 76页
2022-08-17 发布于四川
举报
版权申诉

广西大学《数字信号处理》课件-Chapter5 Finite-Length Discrete Transform.ppt

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

DSP group chap5 * Sect. 5.3.3 DTFT from DFT by Interpolation Let DSP group chap5 * Sect. 5.3.4 Sampling the DTFT DSP group chap5 * (a) M=N Sect.5.3.4 Sampling the DTFT (b) MN: (c) MN: x[n] is preserved to be unchanged. For a finite-length sequence x[n],0?n?M?1 For a infinite-length sequence x[n],0?n?M?1 DSP group chap5 * DTFT Real line Sampling No time aliasing IDFS MN 0? n ? 9 0? k ? 15 Sect. 5.3.4 Sampling the DTFT--- Length of sequence M is less than sampling point N y[n] x[n] DSP group chap5 * DTFT Real line Sampling time aliasing IDFS M ?N 0? n ? 9 0? k ? 5 Sect.5.3.4 Sampling the DTFT--- Length of sequence M is greater than sampling point N y[n] x[n] Problem: Is there any wrong in the above figures? DSP group chap5 * Problem1: if sequence x[n] is an infinite-length sequence, how can we get the numerical computation? Problem2: Since the DFT can be thought to be the sampling of DTFT, how can we obtain the DTFT X(e j?) from its samples X[k]? Sect.5.3.4 Sampling the DTFT The second problem See Section 5.3.3; The first problem help us to compute the numerical value of X(e j?) correctly. DSP group chap5 * Ex. 5.6 Find y[n] which is the IDFT of Y[k]. -------x[n] can be recovered from y[n] Solution: Sect.5.3.4 Sampling the DTFT Solution: -------x[n] cannot be recovered from y[n] Ex. 5.6-2 DSP group chap5 * Sect.5.3.4 Sampling the DTFT DSP group chap5 * Sect.5. 4 Circular convolution Read material in sect.2.3 “circular operation” Linear convolution Assume two length-N sequences, g[n],0?n?N?1, and h[n],0?n?N?1 Circular convolution DSP group chap5 * yC[n] = g[n] h[n] (5.52) N Denoted as Sect.5. 4 Circular convolution Computation: DSP group chap5 * ----The circular convolution is commutative, i.e. g[n] h[n] = h[n] g[n] (5.53a) N N Sect.5. 4 Circular convolution (g[n] h[n]) w[n] = g[n] (h[n] w[n]) (5.53b) N N N N Example: Determine the 4-point circular con