arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.5593cs.ITcs.LGmath.IT
收藏

Low Complexity Kolmogorov-Smirnov Modulation Classification

Institute of Network Coding, CUHK(香港中文大学网络编码研究所);State Key Laboratory of Rail Traffic Control and Safety, BJTU(北京交通大学轨道交通控制与安全国家重点实验室)

Fanggang Wang, Rongtao Xu, Zhangdui Zhong

英文摘要:

Kolmogorov-Smirnov (K-S) test-a non-parametric method to measure the goodness of fit, is applied for automatic modulation classification (AMC) in this paper. The basic procedure involves computing the empirical cumulative distribution function (ECDF) of some decision statistic derived from the received signal, and comparing it with the CDFs of the signal under each candidate modulation format. The K-S-based modulation classifier is first developed for AWGN channel, then it is applied to OFDM-SDMA systems to cancel multiuser interference. Regarding the complexity issue of K-S modulation classification, we propose a low-complexity method based on the robustness of the K-S classifier. Extensive simulation results demonstrate that compared with the traditional cumulant-based classifiers, the proposed K-S classifier offers superior classification performance and requires less number of signal samples (thus is fast).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑