In this study, an algorithm to blind and automatic modulation classification has been proposed. It well benefits combined machine leaning and signal feature extraction to recognize diverse range of modulation in low signal power to noise ratio (SNR). The presented algorithm contains four. First, it advantages spectrum analyzing to branching modulated signal based on regular and irregular spectrum character. Seconds, a nonlinear soft margin support vector (NS SVM) problem is applied to received signal, and its symbols are classified to correct and incorrect (support vectors) symbols. The NS SVM employment leads to discounting in physical layer noise effect on modulated signal. After that, a k-center clustering can find center of each class. finally, in correlation function estimation of scatter diagram is correlated with pre-saved ideal scatter diagram of modulations. The correlation outcome is classification result. For more evaluation, success rate, performance, and complexity in compare to many published methods are provided. The simulation prove that the proposed algorithm can classified the modulated signal in less SNR. For example, it can recognize 4-QAM in SNR=-4.2 dB, and 4-FSK in SNR=2.1 dB with %99 success rate. Moreover, due to using of kernel function in dual problem of NS SVM and feature base function, the proposed algorithm has low complexity and simple implementation in practical issues.
翻译:在本研究中,提出了盲人和自动调控分类的算法,这有利于将机器倾斜和信号特征提取结合起来,以识别低信号功率与噪音比率(SNR)中的不同调控范围。介绍的算法包含四种。首先,它有利于根据常规和异常频谱特性对分流信号进行频谱分析;第二,对收到的信号应用非线性软边支持矢量(NS SVM)问题,其符号被分类为正确和不正确(支持矢量)符号。NS SVM雇用导致对调控信号的物理层噪声效应进行折扣。此后,K中心群集可以找到每类的中枢。最后,在散射图的相关函数估计与预保存的理想调控波特性图的分解图相关。相关的结果是,对收到的信号应用了更多的评价、成功率、性能和复杂性与许多公布的方法。模拟证明,拟议的算法可以将调控的信号分解为较不正确的SNR。例如SNR=-4/4.2B的4-QAM-QAM=-DFS-DFS-DRLS-CLS-CLS-CS-B 和S-B的S-S-CLisal 和S-B的S-C-B的S-S-C-C-C-C-C-CLis-C-C-C-C-C-C-Lisal 成功率的S-C-B 和S-S-Lis-B的S-C-C-C-CLisal 和S-Lis-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-C-Lis-Lis-Lis-Lis-Lis-Lis-Lis-C-Lis-Lis-Lis-Lis-Lis-Lis-C-C-Lis-Lis-Lis-Lis-Lis-Lis-Lis-Lis-Lis-L