Fast algorithm based on IFFT for computing fractional Lubich coefficient of digital fractional differentiator
Author:
Affiliation:

College of Electronic and Information Engineering,Sichuan University,Chengdu Sichuan 610064,China

Funding:

Ethical statement:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
    Abstract:

    The Lubich coefficient is investigated from the point of view of signal processing, and the frequency characteristics of Lubich coefficient are analyzed. A fast algorithm based on Inverse Fast Fourier Transform (IFFT) for computing Lubich coefficient is designed. The Lubich coefficient directly solved by IFFT algorithm is not accurate. The Gibbs effect exists in the frequency domain with low order operations, and the new algorithm can reduce this effect effectively by zero-frequency assignment. The numerical simulation results show that, compared with Lubich accuracy coefficient, the Lubich approximation coefficients computed by the new algorithm have better performance in constructing the digital fractional differentiator with a certain proper fraction operation order range, and the new algorithm has low computational complexity and high efficiency.

    Reference
    Related
    Cited by
Get Citation

周宇,袁晓,张月荣.基于IFFT的Lubich数字分数微分器系数的快速算法[J]. Journal of Terahertz Science and Electronic Information Technology ,2022,20(6):608~617

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
History
  • Received:May 13,2021
  • Revised:May 30,2021
  • Adopted:
  • Online: July 11,2022
  • Published: