摘要
任意长度ＧＦＴ的Ｗ变换算法付彬（湖南大学数学系）曾泳泓（国防科技大学七系）Ｗ－ＴＲＡＮＳＦＯＲＭＡＬＧＯＲＩＴＨＭＯＦＱＦＴＷＩＴＨＡＲＢＩＴＲＡＲＹＬＥＮＧＴＨ￥ＦｕＢｉｎ（ＨｕｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｓｈａ，Ｈｕａｎａ）ＺｅｎｇＹｏ...
Abstract In this paper, we put forward a fast discrete Fourier transform (GFT) algorithm of arbitrary length using w-transform. This algorithm places no restriction on transform length, and has less computation and simple structure. For length N = 2, the computation cost of real DPT (DFT is a special case of GFT) using this algorithm is the same as that of the fastest algorithms known so far. For N = 3, the computation cost of this algorithm is 50% less than that of Radix-3 new algorithm[5] in theory. On a vax-11/780 computer system, this algorithm runs about 6 times as fast as the Radix-3 new algorithm.
出处
《数值计算与计算机应用》
CSCD
北大核心
1994年第3期213-220,共8页
Journal on Numerical Methods and Computer Applications
基金
国防八五预研基金
