TY - JOUR
T1 - A novel approach to dictionary construction for automatic modulation classification
AU - Dulek, B.
AU - Ozdemir, O.
AU - Varshney, P. K.
AU - Su, W.
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 2014/5
Y1 - 2014/5
N2 - In almost all the work carried out in the area of automatic modulation classification (AMC), the dictionary of all possible modulations that can occur is assumed to be fixed and given. In this paper, we consider the problem of discovering the unknown digital amplitude-phase modulations when the dictionary is not given. A deconvolution based framework is proposed to estimate the distribution of the transmitted symbols, which completely characterizes the underlying signal constellation. The method involves computation of the empirical characteristic function (ECF) from the received signal samples, and employing constrained least squares (CLS) filtering in the frequency domain to reveal the unknown symbol set. The decoding of the received signals can then be carried out based on the estimate of the signal constellation. The proposed method can be implemented efficiently using fast Fourier transform (FFT) algorithms. In addition, we show that the distribution estimate of the transmitted symbols can be refined if the signal constellation is known to satisfy certain symmetry and independence properties.
AB - In almost all the work carried out in the area of automatic modulation classification (AMC), the dictionary of all possible modulations that can occur is assumed to be fixed and given. In this paper, we consider the problem of discovering the unknown digital amplitude-phase modulations when the dictionary is not given. A deconvolution based framework is proposed to estimate the distribution of the transmitted symbols, which completely characterizes the underlying signal constellation. The method involves computation of the empirical characteristic function (ECF) from the received signal samples, and employing constrained least squares (CLS) filtering in the frequency domain to reveal the unknown symbol set. The decoding of the received signals can then be carried out based on the estimate of the signal constellation. The proposed method can be implemented efficiently using fast Fourier transform (FFT) algorithms. In addition, we show that the distribution estimate of the transmitted symbols can be refined if the signal constellation is known to satisfy certain symmetry and independence properties.
UR - http://www.scopus.com/inward/record.url?scp=84898805768&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84898805768&partnerID=8YFLogxK
U2 - 10.1016/j.jfranklin.2014.02.002
DO - 10.1016/j.jfranklin.2014.02.002
M3 - Article
AN - SCOPUS:84898805768
SN - 0016-0032
VL - 351
SP - 2991
EP - 3012
JO - Journal of the Franklin Institute
JF - Journal of the Franklin Institute
IS - 5
ER -