| 摘要 |
In a Fast Fourier Transform method, the elements of Fast Fourier Transform are arranged as a two-dimensional square and stored in areas of an array whose number of lines is twice that of columns. Positions of the columns having bit reversed column numbers are exchanged and the elements are linear vector stored so that the initial element of a column is always one position lower than the previous one. Then, the elements of such linear vector stored array are rearranged through exchange of columns having elements with bit reversed numbers and movement of the columns fully upward to made them flush.
|
