An improved fast implementation method for FFT pruning algorithm

For the application of increasing the FFT´s spectrum resolution by zero padding, this paper proposes an improved fast implementation method for FFT pruning algorithm, in which only part spectral of the whole FFT´s spectral need to be calculated. According to the structural characteristics of input data and output data, the proposed method in this paper utilizes the data copying and assistant matrix to decrease the computational complexity and enhance the implementary flexibility of the FFT pruning algorithm. The simulations show that: With the method proposed in this paper, there is no limitation to the length of the input and output data, the spectrum at any index can be easily obtained, and the computational consumption is effectively decreased.