Low Complexity Kolmogorov-Smirnov Modulation Classification

Details Low Complexity Kolmogorov-Smirnov Modulation Classification Low Complexity Kolmogorov-Smirnov Modulation Classification

2011-02-28

arxiv.org/abs/1102.5593v2

Computer Science

Information Theory

This paper is accepted by IEEE WCNC 2011

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Low Complexity Kolmogorov-Smirnov Modulation Classification does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Low Complexity Kolmogorov-Smirnov Modulation Classification, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low Complexity Kolmogorov-Smirnov Modulation Classification will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424526