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 l...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.展开更多
文摘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.
