快速傅里叶变换 fast fourier transform

上传者: shineboy2007 | 上传时间: 2021-05-30 19:04:08 | 文件大小: 8KB | 文件类型: RAR
FFT is a fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. This algorithm is implemented in Java

文件下载

资源详情

[{"title":"( 10 个子文件 8KB ) 快速傅里叶变换 fast fourier transform","children":[{"title":"FFT","children":[{"title":".project <span style='color:#111;'> 379B </span>","children":null,"spread":false},{"title":"data5.dat <span style='color:#111;'> 35B </span>","children":null,"spread":false},{"title":"bin","children":[{"title":"fft","children":[{"title":"Test.class <span style='color:#111;'> 5.07KB </span>","children":null,"spread":false},{"title":"Complex.class <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"FFT.class <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"src","children":[{"title":"fft","children":[{"title":"Complex.java <span style='color:#111;'> 1.44KB </span>","children":null,"spread":false},{"title":"Test.java <span style='color:#111;'> 5.23KB </span>","children":null,"spread":false},{"title":"FFT.java <span style='color:#111;'> 1.01KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"result5.dat <span style='color:#111;'> 33B </span>","children":null,"spread":false},{"title":".classpath <span style='color:#111;'> 232B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

  • xjtu_gzh :
    还不错,可以用
    2014-04-15

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明