|
|||||
|
|
| Agarwal-Cooley嵌套的快速褶积算法 | |
| 引用本文： | 易宗富. Agarwal-Cooley嵌套的快速褶积算法[J]. 西南石油大学学报(自然科学版), 1986, 8(3): 34-42. DOI: 10.3863/j.issn.1000-2634.1986.03.004 |
| 作者姓名： | 易宗富 |
| 摘 要： | 本文根据Agarwal-Cooley嵌夸算法，设计不具有实用价值的180点快速褶积算法，该算法与快速付立叶变换(FFT)方法比较，、具有运算速度快的优点，因为它不需要使用三角函数和进行复数运算。 |
HIGH-SPEED CONVOLUTION ALGORITHM ON AGARWAL-COOLEY!NLAY |
|
| Yi Zong-fu. HIGH-SPEED CONVOLUTION ALGORITHM ON AGARWAL-COOLEY!NLAY[J]. Journal of Southwest Petroleum University(Seience & Technology Edition), 1986, 8(3): 34-42. DOI: 10.3863/j.issn.1000-2634.1986.03.004 | |
| Authors: | Yi Zong-fu |
| Abstract: | Based otl Agarwal-Cooley inlaying algorithm,.the high-speed convolu-tion algorithm of 180 points with practical value has been designed inthis paper.The algorithm takes less time than Fast Fourier Transform(FFT)，because it doesn't need to use trigonometic function and complexnumber in operation. |
| Keywords: | |
| 点击此处可从《西南石油大学学报(自然科学版)》浏览原始摘要信息 | |
| 点击此处可从《西南石油大学学报(自然科学版)》下载全文 | |