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

Determination of Weak Knock Characteristics for Two-Stroke Spark Ignition UAV Engines Based on Mallat Decomposition Algorithm

Author

Listed:
  • Jing Sheng
  • Yuping Zeng
  • Guoman Liu
  • Rui Liu

Abstract

Two-stroke spark ignition (SI) unmanned aerial vehicle (UAV) engines do not allow heavy knock and require a certain knock safety margin. However, weak knock can help the engine increase power output and reduce fuel consumption. To accurately extract the knock characteristics of engine vibration signals under the condition of weak knock, a signal feature extraction method based on the Mallat decomposition algorithm was proposed. Mallat decomposition algorithm can decompose the signal into two parts: a low-frequency signal and a high-frequency noise signal. The decomposed high-frequency noise is eliminated, and the low-frequency signal is retained as the characteristic domain signal. Simulation results show the effectiveness of the proposed algorithm. The engine vibration signal of a two-stroke SI UAV engine was decomposed into the low-frequency signal and the high-frequency signal by the Mallat decomposition algorithm. The low-frequency signal is taken as the knock characteristic domain signal component, and the wavelet packet energy method is used to verify the correctness of the obtained signal component. The relative energy parameter is calculated by using the knock characteristic domain signal component, which can be used as the determination index of knock intensity. This method provides a reference for the weak knock control of two-stroke SI UAV engines.

Suggested Citation

  • Jing Sheng & Yuping Zeng & Guoman Liu & Rui Liu, 2021. "Determination of Weak Knock Characteristics for Two-Stroke Spark Ignition UAV Engines Based on Mallat Decomposition Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-11, February.
  • Handle: RePEc:hin:jnlmpe:1250327
    DOI: 10.1155/2021/1250327
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/1250327.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/1250327.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/1250327?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:1250327. 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.