IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8882653.html
   My bibliography  Save this article

Gear Fault Diagnosis Based on VMD Sample Entropy and Discrete Hopfield Neural Network

Author

Listed:
  • Jiakai Ding
  • Dongming Xiao
  • Liangpei Huang
  • Xuejun Li

Abstract

The gear fault signal has some defects such as nonstationary nonlinearity. In order to increase the operating life of the gear, the gear operation is monitored. A gear fault diagnosis method based on variational mode decomposition (VMD) sample entropy and discrete Hopfield neural network (DHNN) is proposed. Firstly, the optimal VMD decomposition number is selected by the instantaneous frequency mean value. Then, the sample entropy value of each intrinsic mode function (IMF) is extracted to form the gear feature vectors. The gear feature vectors are coded and used as the memory prototype and memory starting point of DHNN, respectively. Finally, the coding vector is input into DHNN to realize fault pattern recognition. The newly defined coding rules have a significant impact on the accuracy of gear fault diagnosis. Driven by self-associative memory, the coding of gear fault is accurately classified by DHNN. The superiority of the VMD-DHNN method in gear fault diagnosis is verified by comparing with an advanced signal processing algorithm. The results show that the accuracy based on VMD sample entropy and DHNN is 91.67% of the gear fault diagnosis method. The experimental results show that the VMD method is better than the complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN) and empirical mode decomposition (EMD), and the effect of it in the diagnosis of gear fault diagnosis is emphasized.

Suggested Citation

  • Jiakai Ding & Dongming Xiao & Liangpei Huang & Xuejun Li, 2020. "Gear Fault Diagnosis Based on VMD Sample Entropy and Discrete Hopfield Neural Network," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-13, December.
  • Handle: RePEc:hin:jnlmpe:8882653
    DOI: 10.1155/2020/8882653
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/8882653.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/8882653.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/8882653?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:8882653. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.