西南石油大学学报(自然科学版) ›› 1986, Vol. 8 ›› Issue (3): 34-42.DOI: 10.3863/j.issn.1000-2634.1986.03.004

• 数学 • 上一篇    下一篇

Agarwal-Cooley嵌套的快速褶积算法

易宗富
  

  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:1986-08-20 发布日期:1986-08-20
  • 通讯作者: 易宗富

HIGH-SPEED CONVOLUTION ALGORITHM ON AGARWAL-COOLEY!NLAY

Yi Zong-fu   

  • Received:1900-01-01 Revised:1900-01-01 Online:1986-08-20 Published:1986-08-20
  • Contact: Yi Zong-fu

摘要: 本文根据Agarwal-Cooley嵌夸算法,设计不具有实用价值的180点快速褶积算法,
该算法与快速付立叶变换(FFT)方法比较,、具有运算速度快的优点,因为它不需要使
用三角函数和进行复数运算。

Abstract: Based otl Agarwal-Cooley inlaying algorithm,.the high-speed convolu-
tion algorithm of 180 points with practical value has been designed in
this paper.The algorithm takes less time than Fast Fourier Transform
(FFT),because it doesn't need to use trigonometic function and complex
number in operation.