介绍了 Ｐｒｏｎｙ算法及其优缺点。对 ＤＦＴ作了扩展，得到在单位圆内的各同心圆上 做Ｚ变换的快速算法，并利用扩展的ＤＦＴ提出了一种快速的Ｐｒｏｎｙ算法，改进了现有 Ｐｒｏｎｙ算法存在的计算速度慢、所占内存大、且涉及复矩阵运算的问题。从理论上作了 论证并用仿真信号和实际生物医学信号证实了方法的可行性和快速性。 Introduced the Prony algorithm and its advantages and disadvantages. The DFT is extended to get a fast algorithm of Z transform on each concentric circle in the unit circle. A fast Prony algorithm is proposed by using extended DFT to improve the existing calculation speed of Prony algorithm. Accounting for large memory, and involves complex matrix operation problems. It is theoretically proved and the feasibility and speed of the method are confirmed by simulation signals and real biomedical signals.