Reviews of bearing vibration measurement using fast Fourier transform and enhanced fast Fourier transform algorithms

被引:48
|
作者
Lin, Hsiung-Cheng [1 ]
Ye, Yu-Chen [1 ]
机构
[1] Natl Chin Yi Univ Technol, Dept Elect Engn, 57,Sec 2,Zhongshan Rd, Taichung 41170, Taiwan
关键词
Vibration; fast Fourier transform; enhanced fast Fourier transform; harmonics; non-stationary; ROLLING ELEMENT BEARINGS; HILBERT-HUANG TRANSFORM; FAULT-DIAGNOSIS; DEFECTS;
D O I
10.1177/1687814018816751
中图分类号
O414.1 [热力学];
学科分类号
摘要
The rolling element bearing is one of the most critical components in a machine. Vibration signals resulting from these bearings imply important bearing defect information related to the machinery faults. Any defect in a bearing may cause a certain vibration with specific frequencies and amplitudes depending on the nature of the defect. Therefore, the vibration analysis plays a key role for fault detection, diagnosis, and prognosis to reach the reliability of the machines. Although fast Fourier transform for time-frequency analysis is still widely used in industry, it cannot extract enough frequencies without enough samples. If the real frequency does not match fast Fourier transform frequency grid exactly, the spectrum is spreading mostly among neighboring frequency bins. To resolve this drawback, the recent proposed enhanced fast Fourier transform algorithm was reported to improve this situation. This article reviews and compares both fast Fourier transform and enhanced fast Fourier transform for vibration signal analysis in both simulation and practical work. The comparative results verify that the enhanced fast Fourier transform can provide a better solution than traditional fast Fourier transform.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Bearing vibration detection and analysis using enhanced fast Fourier transform algorithm
    Lin, Hsiung-Cheng
    Ye, Yu-Chen
    Huang, Bo-Jyun
    Su, Jia-Lun
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2016, 8 (10) : 1 - 14
  • [2] TRUNCATED FAST FOURIER TRANSFORM ALGORITHMS
    Mateer, Todd D.
    [J]. 2011 IEEE DIGITAL SIGNAL PROCESSING WORKSHOP AND IEEE SIGNAL PROCESSING EDUCATION WORKSHOP (DSP/SPE), 2011, : 78 - 83
  • [3] Assessing fast Fourier transform algorithms
    Hirji, KF
    [J]. COMPUTATIONAL STATISTICS & DATA ANALYSIS, 1998, 27 (01) : 1 - 9
  • [4] Accuracy of the discrete Fourier transform and the fast Fourier transform
    Schatzman, JC
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1996, 17 (05): : 1150 - 1166
  • [5] The Fast Fourier transform
    Oberst, Ulrich
    [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2007, 46 (02) : 496 - 540
  • [6] Optimized fast algorithms for the quaternionic Fourier transform
    Felsberg, M
    Sommer, G
    [J]. COMPUTER ANALYSIS OF IMAGES AND PATTERNS, 1999, 1689 : 209 - 216
  • [7] Fast reduction a module polynomial and fast Vandermonde transform based on fast Fourier transform algorithms
    Krot, AM
    [J]. SIGNAL PROCESSING, SENSOR FUSION, AND TARGET RECOGNITION VII, 1998, 3374 : 505 - 514
  • [8] Fourier Analysis and the Fast Fourier Transform
    Salvat-Pujol, Francesc
    [J]. OPTICA PURA Y APLICADA, 2008, 41 (01): : 31 - 41
  • [9] FAST ALGORITHMS FOR THE DISCRETE W TRANSFORM AND FOR THE DISCRETE FOURIER-TRANSFORM
    WANG, ZD
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (04): : 803 - 816
  • [10] Some new parallel fast Fourier transform algorithms
    Zhong, CX
    Han, GQ
    Huang, MH
    [J]. PDCAT 2005: SIXTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS, 2005, : 624 - 627