该文讨论解有限长序列卷积反演的３种方法。一种为时域迭代算法，它根据待求序列长度决定迭代次数，且不存在迭代收敛问题。另一种方法适合于卷积长度、ＦＦＴ点数大约是原卷积序列长度的两倍这种情形，它比经典ＦＦＴ方法节约３３％的计算量。第３种方法与第２种类似，也可节约１５％计算量。与其它方法相比，该文的方法简单易行，运算量少。 This paper discusses three methods of solving finite-sequence convolution inversion. One is the iterative algorithm in the time domain, which determines the number of iterations according to the length of the desired sequence, and there is no iterative convergence problem. Another approach, which is suitable for convolution lengths, is about twice as long as the length of the original convolution sequence, saving 33% of the computational complexity of the classical FFT method. The third method is similar to the second one, but it also saves 15% of the computation. Compared with other methods, the method of this paper is simple and easy, with less computation.