Envelope Power Function (IEPF) (包络幂函数)is obtained by solving the roots of a polynomial, a linear sum of a set of Chebyshev polynomials of the first kind and the second kind. The second procedure, called Stepwise Refinement Algorithm (SRA), is a highly precise and fast computation method for arbitrary N by using Inverse Fast Fourier Transform (IFFT), the Chirp Z-Transform (CZT) and a newly introduced relationship between the IEPF peak and its most adjacent oversampled sample

若能收集到该词条相关资料的跟帖者给予奖励，根据收集资料的水平给予10～200不等的论坛币，当然也可以谈谈自己的观点、其应用领域、上传资料、相关软件介绍等等，请大家尽量不要复制一些搜索引擎很容易收集到的资料。

     我每天都会发送不等数量的词条，所以诚邀不同统计背景的各路大侠发表评论。

     欢迎大家多多跟帖！要数量也要质量哟