DocumentCode
3083217
Title
Low Complexity Feature-Based Modulation Classifier and Its Non-Asymptotic Analysis
Author
Rebeiz, Eric ; Cabric, Danijela
Author_Institution
Univ. of California Los Angeles, Los Angeles, CA, USA
fYear
2011
fDate
5-9 Dec. 2011
Firstpage
1
Lastpage
5
Abstract
In this paper, we propose a reduced-complexity modulation classifier using multi-cycle features extracted from the Spectral Correlation Function (SCF) in order to distinguish among QAM, BPSK, MSK and AM modulation schemes. We analytically derive SCF statistics of the noise and signal features used for classification for finite number of samples, and use Chebyshev inequality to upper bound the minimum number of spectral averages required to attain a predetermined correct classification probability. Both theoretical and simulation results show that the proposed classifier requires on the order of 50 spectral averages to achieve a correct classification probability of 0.9 at SNR = 5 dB. The algorithm and corresponding analysis presented in this paper can be extended to classify other modulation schemes.
Keywords
Chebyshev approximation; minimum shift keying; phase shift keying; quadrature amplitude modulation; AM modulation; BPSK; Chebyshev inequality; MSK; QAM; SCF statistics; low complexity feature; multicycle feature; nonasymptotic analysis; reduced-complexity modulation classifier; signal feature; spectral correlation function; Binary phase shift keying; Correlation; Probability density function; Quadrature amplitude modulation; Signal to noise ratio;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location
Houston, TX, USA
ISSN
1930-529X
Print_ISBN
978-1-4244-9266-4
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2011.6134309
Filename
6134309
Link To Document