| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To increase the speed of a linear Fourier transform algorithm for scalar computers. <P>SOLUTION: A linear Fourier transform program is provided with steps of; decomposing a data length N of linear data into a product N1×N2×...×Nm of factors; defining the data length N as P×Q and calculating the first one of Q-1 twiddle factors for multiplication to Fourier transform of each of P linear data out of twiddle factors required for multiplication to Fourier transform results of P linear data having a length Q while varying P and Q and storing calculated twiddle factors in a table; and using the table where the calculated twiddle factors are stored, to perform Fourier transform of data in m times of phases. <P>COPYRIGHT: (C)2005,JPO&NCIPI</p> |
