首页 | 官方网站   微博 | 高级检索  
     

—大点数圆卷积算法设计
引用本文:郑容.—大点数圆卷积算法设计[J].西北工业大学学报,1997,15(3):453-455.
作者姓名:郑容
作者单位:西北工业大学
摘    要:给出一种新的大点数基2长度的圆卷积算法。以往在计算圆卷积时常采用余数定理和多项式乘积,它可以对某些小点数圆卷积设计最少乘法次数的算法,并且结合这些算法可以构成具有较少乘法次数的大点数圆卷积算法。文中圆卷积计算被视为矩阵向量积。通过建立圆卷积矩阵中行向量之间和列向量之间的相关性可以压缩圆卷积矩阵,使矩阵向量积的乘法次数大大减少。这个过程对于基2长度的圆卷积矩阵可以重复进行下去,因此能够得到快速有效的基2圆卷积算法。

关 键 词:卷积,FFT,矩阵

Design of Large Point Circular Convolution Algorithm
Abstract:A new large point radix2 circular convolution algorithm is proposed in this paper. Conventionally Chinese remainder theorem and polynomial product are used to compute circular convolution because not only they result in minimum multiplication circular convolution algorithm for small point but also they can construct large point circular convolution algorithm with number of multiplications as small as possible. However, the programming of this conventional algorithm is complicated in structure. In this paper, a circular convolution can be viewed as a matrixvector product. The matrix can be shrunk via establishing correlation between row vectors and column vectors of the matrix. Thus number of multiplications of the matrixvector product is greatly reduced. The shrinking process can be reiterated for radix2 circular convolution which is then computed rapidly and efficiently by proposed algorithm.
Keywords:circular convolution  matrix
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号