A NON-LINEAR STORAGE SCHEME FOR FFT ALGORITHM

In the SIMD computer using hypercube-type multistage interconnection network, thefact that BPC permutation cannot pass the network is an important problem that affects performance. A non-linear storage scheme for FFT algorithm is presented in this paper. Using this scheme, the bit-reverse permutation at the end of this algorithm can pass the indirect binary n-cube network. There fore, a new method is given, which makes BPC permutation pass n-cube type network by means of a non-linear storage scheme. The advantages of this method are simple and easy to implement.