排序方式: 共有7条查询结果,搜索用时 15 毫秒
1
1.
By introducing a form of reorder for multidimensional data, we propose a unified fast algo-rithm that jointly employs one-dimensional W transform and multidimensional discrete polynomial trans-form to compute eleven types of multidimensional discrete orthogonal transforms, which contain three types of m-dimensional discrete cosine transforms ( m-D DCTs) ,four types of m-dimensional discrete W transforms ( m-D DWTs) ( m-dimensional Hartley transform as a special case), and four types of generalized discrete Fourier transforms ( m-D GDFTs). For real input, the number of multiplications for all eleven types of the m-D discrete orthogonal transforms needed by the proposed algorithm are only 1/m times that of the commonly used corresponding row-column methods, and for complex input, it is further reduced to 1/(2m) times. The number of additions required is also reduced considerably. Furthermore, the proposed algorithm has a simple computational structure and is also easy to be im-plemented on computer, and th 相似文献
2.
GFT及离散卷积的并行算法及其实现 总被引:1,自引:0,他引:1
一、GFT的计算 GFT是离散富里叶变换DFT的一种推广.它在许多方面有实际应用,其定义为: 设a,b为二个实数,x_n(n=0,1,…,N—1)为一实序列,称 X_k=sum from n=0 to N-1 x_nW_N~((n+a)(k+b)),k=0,1…,N-1,为具有时间参数a及频率参数b的广义DFT.简记为GFT(a,b),其中W_N=e~(-i2π/N)。可以证明其逆变换为 相似文献
3.
4.
在本文内,我们首先引进多元多项式变换的概念,详细研究这种变换成立的条件。我们将看到,当模M_1(Z_1),M_2(Z_2)是可约多项式时,我们建立了一系列充分必要条件,并且证明了这种变换具有循环卷积特性(CCP),然后简要的讨论了多元多项式变换在计算多维数字卷积中的应用。 相似文献
5.
离散傅里叶变换(DFT)在数字信号处理等许多领域中起着重要作用.本文采用一种新的傅里叶分析技术—算术傅里叶变换(AFT)来计算DFT.这种算法的乘法计算量仅为O(N);算法的计算过程简单,公式一致,克服了任意长度DFT传统快速算法(FFT)程序复杂、子进程多等缺点;算法易于并行,尤其适合VLSI设计;对于含较大素因子,特别是素数长度的DFT,其速度比传统的FFT方法快;算法为任意长度DFT的快速计算开辟了新的思路和途径. 相似文献
6.
7.
带状(块)Toeplitz方程组的快速并行算法 总被引:3,自引:0,他引:3
带状(块)Toeplitz方程组的快速并行算法成礼智,蒋增荣(国防科技大学)FASTANDPARALLELALGORITHMSFORSOLVINGBAND(BLOCK)TOEPLITZSYSTEMSOFEQUATIONS¥ChengLi-zhi;Ji... 相似文献
1