IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0333098.html

Automatic modulation classification method using fixed K-means algorithm for feature clustering processing

Author

Listed:
  • Li Yuan
  • Yang Chen

Abstract

The role played by communication technology in daily life is gradually increasing. However, there are problems such as complex types of signals, huge amount of data and noise interference, and the recognition accuracy of existing modulation classification methods is low. Therefore, the study proposes a signal automatic modulation classification model based on fixed K-mean algorithm and denoising autoencoder. The model uses fixed K-mean algorithm for feature classification and optimizes median filtering algorithm using dynamic thresholding. The classifier is used to improve the recognition accuracy of specific signals, and long short-term memory and data random corruption denoising are used to optimize the autoencoder. The experiments indicated that the signal classification accuracy of the model were 17.6% and 16.8% higher than the other two models, respectively. The computational complexity of the improved model decreased dramatically, but the average classification accuracy was only 1.6% lower than that before the improvement. The communication overhead and training efficiency were better than the other models, and the number of parameters of the model was 1/2 of that of the pre-improvement model. The memory occupancy and running time were reduced by 335KB and 33ms, respectively. Compared to the other two models, the model’s average classification accuracy at a signal-to-noise ratio of 0 was 18.4% and 19.7% higher, respectively. As a result, the improved model effectively increases signal recognition accuracy, enhances model robustness, and significantly reduces computational complexity while ensuring real-time signal processing for communication computing.

Suggested Citation

  • Li Yuan & Yang Chen, 2025. "Automatic modulation classification method using fixed K-means algorithm for feature clustering processing," PLOS ONE, Public Library of Science, vol. 20(10), pages 1-19, October.
  • Handle: RePEc:plo:pone00:0333098
    DOI: 10.1371/journal.pone.0333098
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0333098
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0333098&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0333098?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:plo:pone00:0333098. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.