数字信号处理A-Mitra课件 Ch113.pdfVIP

  • 6
  • 0
  • 约2.44万字
  • 约 6页
  • 2017-04-21 发布于浙江
  • 举报
Cooley-Tukey FFT Algorithms Cooley-Tukey FFT Algorithms ? Using these index mappings we can write ? Consider a length-N sequence x[n] with an N ?1 nk N-point DFT X[k] where N = N1N2 X[k] = ∑ x[n]WN as n=0 ? Represent the indices n and k as

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档