In this paper，the method of computing DFT with Z-transform is discussed. The amount of additions and multiplications operating N=2^t point DFT is remarkably decreased compared with the Cooley-Tukey's radix-2 FFT algorithm. The implementation of this algorithm on IBM-PC is discussed. The comparison of this two algorithms running time is given.