THE MULTIPLICATIVE COMPLEXITY AND ALGORITHM OF THE GENERALIZED DISCRETE FOURIER TRANSFORM(GFT)

被引：0
|
作者：
Y.H. Zeng(7th Department
机构：
来源：
Journal of Computational Mathematics | 1995年 / 04期
关键词：
DCT; II; THE MULTIPLICATIVE COMPLEXITY AND ALGORITHM OF THE GENERALIZED DISCRETE FOURIER TRANSFORM; Math; GFT;
D O I：
暂无
中图分类号：
O241 [数值分析];
学科分类号：
摘要：
In this paper, we have proved that the lower bound of the number of realmultiplications for computing a length 2t real GFT(a,b) (a = ±1/2, b = 0 or b =±1/2, a = 0) is 2t+1 - 2t - 2 and that for computing a length 2t real GFT(a,b)(a =±1/2, b = ±1/2) is 2t+1 - 2. Practical algorithms which meet the lower bounds ofmultiplications are given.
引用
收藏
页码：351 / 356
页数：6
相关论文
共 50 条
12345