Skip to content

Advertisement

  • Research
  • Open Access

Automatic modulation classification of digital modulations in presence of HF noise

EURASIP Journal on Advances in Signal Processing20122012:238

https://doi.org/10.1186/1687-6180-2012-238

  • Received: 13 March 2012
  • Accepted: 18 October 2012
  • Published:

Abstract

Designing an automatic modulation classifier (AMC) for high frequency (HF) band is a research challenge. This is due to the recent observation that noise distribution in HF band is changing over time. Existing AMCs are often designed for one type of noise distribution, e.g., additive white Gaussian noise. This means their performance is severely compromised in the presence of HF noise. Therefore, an AMC capable of mitigating the time-varying nature of HF noise is required. This article presents a robust AMC method for the classification of FSK, PSK, OQPSK, QAM, and amplitude-phase shift keying modulations in presence of HF noise using feature-based methods. Here, extracted features are insensitive to symbol synchronization and carrier frequency and phase offsets. The proposed AMC method is simple to implement as it uses decision-tree approach with pre-computed thresholds for signal classification. In addition, it is capable to classify type and order of modulation in both Gaussian and non-Gaussian environments.

Keywords

  • Automatic modulation classification
  • Feature-based classification
  • Bi-kappa noise
  • HF communications

Introduction

State-of-the-art digital communications and signal processing techniques have caused a major resurgence in high frequency (HF) communication systems by reducing equipment size, improving communication reliability, and shortening the deployment time. Therefore, these systems provide a cost effective and versatile solution for long-haul communications which can be used in a wide variety of civilian and military scenarios, e.g., nation-wide emergency communication during natural disaster, war-zone communications, electronic surveillance, remote area monitoring, etc. Numerous scenario-specific standardized waveforms exist for HF radios depending on the required data rate and available transmit bandwidth[1]. An HF radio capable of communicating using all the standardized waveforms is desirable as it brings interoperability, flexibility, and cost efficiency. A software-defined radio (SDR) allows an HF radio to communicate using multiple standards. An automatic modulation classifier (AMC) is an essential part of a multi-standard communication system as it allows blind detection of the modulation schemes present in the received signal. However, designing an AMC for HF systems is not a trivial task, as the transmit signal is severely distorted due to ionospheric effects, multipath propagation, and non-Gaussian time-varying noise[24]. The non-Gaussian and time-varying nature of HF noise is a recent observation[3]. It has been noted in[4] that the HF noise follows Gaussian (G) or Bi-kappa (BK) distributions depending on day time. A BK distribution function is defined mathematically as ‎[3]
p x , k = { 1 2 π σ 1 + x 2 k σ 2 k k > 0 1 2 π σ k = 0 1 2 π σ 1 x 2 k σ 2 k k < 0
(1)

where σ and k are the shaping parameter and tuning factor, respectively. Practical values of these parameters are σ = 46, k = 1.1 and σ = 20, k=1[3].

Till now, designing AMC algorithms in presence of non-Gaussian noise has not received sufficient attention. The reason is that Gaussianity assumption often matches the observed statistical characteristics of channel noise. However, for HF channel the case is different as the noise is better described by a model fluctuating between G and BK distributions. Therefore, this new noise model must be considered during the development of an AMC for HF band. Existing AMC methods (that assume G noise only) are grouped into two categories: likelihood based (LB) and feature based (FB) methods. LB methods have two steps: calculating the likelihood function of the received signal for all candidate modulations, and then using maximum likelihood ratio test for decision-making ‎[5]. In FB methods, features are first extracted from the received signal and then applied to a classifier in order to recognize the modulation type and possibly its order.

Figure1 shows the block diagram of FB methods in an SDR. The front-end of SDR is the signal detection block which identifies a signal transmission ‎[6]. This block is followed by an AMC which contains a feature extractor and a classifier.An overwhelming number of proposed features exist in AMC literature. Some of the most popular features include instantaneous amplitude, phase, and frequency ‎[79], statistical features such as higher order moments and cumulants ‎[1013], wavelets ‎[1418], spectral peaks ‎[19], etc. The classifier block makes use of extracted features to identify signal modulation by applying a fixed threshold, or alternatively using a pattern recognition technique, such as artificial neural networks ‎[2022] or support vector machines ‎[18]. If the feature set is carefully selected, FB methods are more robust and offer low processing complexity. For more details about AMC methods with a comprehensive literature review, the reader is referred to[5, 23].
Figure 1
Figure 1

AMC-based receiver architecture using FB methods.

Attempts to classify signals in HF noise have been reported in the literature. In ‎[2426], entropic distance feature has been exploited for a classification of constant envelope digital signals, such as PSK and FSK modulations. In[26], this feature has been further explored for signals propagating via multiple ionospheric modes with co-channel interference and non-Gaussian noise for different types of PSK and FSK modulations. The basic idea of entropic distance is to compress the received signal using a compression algorithm and use the compression ratio as entropy measure of the received signal of an unknown modulation type. Therefore, normalized entropic distance can be used to classify different modulation schemes. It is also demonstrated in[24, 26] that entropic distance is a useful feature in separating narrow band as well as wide band FSK modulations. Its robustness against parameters variations such as quantization resolution, signal length, and compression algorithm is also verified.

Motivated by the observations noted in ‎[4], effect of BK distribution on AMC design has been investigated in ‎[27, 28]. The results in ‎[27] show that the performance of an AMC algorithm designed for G noise model significantly deteriorates in presence of BK noise, specifically at low signal-to-noise ratio (SNR). In addition, the investigation in ‎[28] shows that it is possible to design features that are reasonably robust in presence of HF noise.

The objective in this article is to develop a new decision tree-based AMC algorithm well-suited for the classification of most popular single carrier modulations used in HF communication systems, i.e., 2FSK, 4FSK, 8FSK, 2PSK, 4PSK, 8PSK, 16QAM, 32QAM, 64QAM, 16 amplitude-phase shift keying (APSK), and 32APSK ‎[1]. APSK is a digital modulation scheme that can be considered as a class of QAM in which symbols are always placed on equidistant concentric circles in the constellation diagram. This modulation scheme is known to have fewer problems with nonlinear amplifiers due to its constellation shape[29].

To achieve the above objective, the following features are considered: the maximum value of power spectral density (PSD) of normalized-centered instantaneous amplitude, the maximum value of magnitude of discrete fourier transform (DFT) of k th power of received signal (Γ k ), and number of points in pre-defined ranges of partitioned signal constellation magnitude. The first feature is well known in the literature[79]. The second feature with k = 2, 4 has previously been proposed in ‎[30] for blind estimation of frequency offset of PSK and QAM signals and in[31] for the classification of MPSK modulations. The third feature is new; it is based on counting the number of points of the magnitude of received signal constellation in a certain predefined range. This feature has a desirable property in that its value remains almost constant even when the noise model gets changed from Gaussian distribution to BK distribution. Another important property of this feature is its low computational cost, as it only requires addition and comparison operations. It is worth noting that all three features are insensitive to symbol synchronization and carrier frequency and phase offsets.

The rest of the article is organized as follows. A unified mathematical model for all the modulation schemes under consideration is presented in Section 2. The proposed AMC and its computational complexity are detailed out in Section 3. Simulation results are presented and discussed in Section 4. Finally, conclusions are drawn in Section 5.

Signal model

The general form of received signal encompassing all modulation schemes under consideration is given by ‎[32]
r t = Re α e j 2 π φ e j 2 f t C t e j 2 π f c t t 0 + n t
(2)
where C(t) is the complex envelope of the modulated signal, n(t) is a band-limited noise, fc is the carrier frequency, α is the channel amplitude, φ is the phase offset, Δf is the carrier frequency offset, and Re{.} denotes the real part. The complex envelope is characterized by the constellation points C i , signal power P, and pulse shaping function p(t). For N symbols with periodicity T, the general form of the complex envelope can be expressed as
C t = Σ i = 1 N C i p t i T
(3)
In practice, p(t) is often root-raised cosine with roll-off factor (ρ) ranging between 0.2 and 0.5[3336]. For FSK modulation, rectangular pulse shape is commonly used[1]. The constellation points of digital modulation of order M considered in this article are given in Table1 (in Table1, fs is the sampling frequency and Nf is the number of samples within one MFSK symbol duration); see also ‎[9].
Table 1

Constellation points of digital modulation schemes

Modulation

Constellation point

MPSK

C i exp(−j 2πm/M), m = 0, 1,., M − 1

MQAM

C i = a K + j b k , a k , b k 2 m 1 M , m = 1 , 2 , . , M

OQPSK

C i 4PSK staggered to allow ±π/2 change between symbols.

MFSK

C i cos 2 π f m f s n + j sin 2 π f m f s ; m 0 , , M 1 , n = 0 , 1 , , N f 1

MAPSK

C i r exp j 2 π m M s , w h e r e r 1 , 2 , M s 4 , 12 , m [ 0 , , 11 ] , i f M = 16 r 1 , 2 , 3 , M s 4 , 12 , 16 , m 0 , , 15 , i f M = 32

The noise term is often constructed by passing the BK/G noise through a band-limiting filter ‎[9]. The bandwidth of this filter is set to 3 kHz for HF channel[37]. This filter is used in practice to minimize the transmission bandwidth. The SNR at the output of band-limiting filter is adjusted to the desired value by multiplying the noise term by a scaling factor, β. That is[9]
β = P N 0 10 S N R / 20
(4)

where N0 is the noise power and SNR is in dB.

The proposed AMC

The proposed AMC features

The proposed features and classification mechanism are described next. The presentation in this section is supported by simulation results conducted with parameters as described in Table2, and averaged over 100 independent realizations. The frequency offset is set at 100 Hz and roll-off factor ρ = 0.35. If different, results are presented for both G and BK noise models, otherwise results of BK noise model are only displayed.
Table 2

Simulation parameters

Parameter

Value

Carrier frequency

fc= 24 kHZ

Symbol rate

rs= 2400 Hz

Sampling rate

fs= 19.2 kHz

Number of symbols

N = 512

Total number of samples

Ns= 4096

The maximum value of PSD of normalized-centered instantaneous amplitude

This feature is expressed mathematically as ‎[9]
γ max = max D F T a cn n 2 N s
(5)
where Ns is the number of samples, a cn (n) = a(n)/m a − 1, a(n) is the absolute value of the analytic form of the received signal, and m a is its sample mean. This feature classifies PSK modulations as one group, and FSK and OQPSK modulations as another group. Figure2 shows feature values against SNR (in dB) for PSK, FSK, and OQPSK signals. The figure also shows the mean value of feature (solid line) ± its standard deviation (dotted line). This will help in determining the bounds for feature variation. Note that we only display bounds (mean ± its standard deviation) for the modulations that are critical for determining the thresholds. For the sake of clarity, the same color has been used for both the bound and the mean that belong to a particular modulation. As Figure2 shows, the final classification of the modulations is achieved using a pre-computed threshold which separates PSK from FSK and OQPSK modulations.
Figure 2
Figure 2

γ max versus SNR for FSK, PSK, and OQPSK signals.

The maximum value of DFT magnitude of the kth power of analytic form of received signal

This feature is defined as follows ‎[30, 31].
Γ k = max D F T a i k 2 N s
(6)
Three values of parameter k are used in this article, i.e., k = 1, 2, and 4. The three FSK modulation orders are classified using Γ1. Since the input signal power is equally distributed among all FSK tones, therefore for a certain fixed duration of the received signal the feature value is highest for 2FSK and lowest for 8FSK and OQPSK. As a result, 2FSK, 4FSK, and group of 8FSK and OQPSK can be discriminated using two threshold values. The values of this feature against SNR are shown in Figure3. Also, the upper and lower bounds for both thresholds are shown as dotted lines.
Figure 3
Figure 3

Γ 1 versus SNR for the three FSK signals.

The feature Γ k with k = 2 and 4 is utilized to classify the three individual PSK modulations in two stages. In the first stage, 2PSK is separated from 4PSK and 8PSK by using Γ2, whereas in the second stage 4PSK is separated from 8PSK modulation by using Γ4. Both Γ2 and Γ4 are compared against two different thresholds. Figures4 and5 show the variation of Γ2 and Γ4 against SNR, respectively. It is observed that these features have the ability to separate PSK modulations at SNR as low as 0 dB. It is also used to classify OQPSK and 8FSK modulations. Figure6 shows that Γ4 can classify both modulations at SNR = 0 dB.
Figure 4
Figure 4

Γ 2 versus SNR for the three PSK signals.

Figure 5
Figure 5

Γ 4 versus SNR for 4PSK and 8PSK signals.

Figure 6
Figure 6

Γ 4 versus SNR for 8FSK and OQPSK signals.

Finally, feature Γ4 can be further used to separate 16/64QAM from 16/32APSK and 32QAM modulations. The threshold for separating the two groups is set to allow classification starting from around 0 dB by carefully taking into consideration the variance of feature values. Note that the variance of Γ4 for 64QAM is larger than that of 32QAM as shown in Figure7.
Figure 7
Figure 7

Γ 4 versus SNR for QAM and APSK signals.

Number of points of partitioned magnitude of constellation diagram

QAM/APSK modulation symbols are defined in terms of phase and amplitude variations and are represented in the form of a constellation diagram. This diagram is extracted from the analytic form of the IF signal after down conversion to the baseband. Many features exist in literature that exploit different aspects of the constellation diagram for classification of 16, 32, and 64QAM modulations[3842]. In this article, a new feature based on partitioning magnitude of constellation diagram is proposed. This feature makes use of the observation that the noise-free normalized constellation points of PSK and FSK modulations are on the unit circle, whereas the normalized constellation points of QAM and APSK modulations may lie on, inside, and/or outside the unit circle. Therefore, this feature is useful in separating near constant amplitude modulations from amplitude varying modulations, and also in determining the order of amplitude varying modulations.

The first step of proposed feature is to partition the magnitude of normalized constellation diagram into seven regions denoted by R1, R2,…, R7. Note that the samples of QAM/APSK signal are normalized by the standard deviation of the signal amplitude before feature extraction. Then, the signal is classified by comparing the number of points in one or more pre-defined regions to a pre-computed threshold. Table3 shows the boundaries of these regions which are determined by examining the histogram of magnitude of normalized constellation diagram of QAM/APSK modulations. To ensure maximum separation between different modulations, their respective histograms are searched for regions in which the number of points differs by large values across different histograms.
Table 3

Regions of partitioned magnitude of constellation diagram

Region

Range

Starting point

Ending point

R 1

0

0.2

R 2

0.2

0.3

R 3

0.3

0.4

R 4

0.4

0.6

R 5

0.6

0.8

R 6

1.00

1.25

R 7

1.6

1.7

Let N i (i = 1, 2,…, 7) denote the normalized number of constellation points whose magnitude falls within the range R i . The normalization pertaining to N i is performed with respect to the total number of received signal samples Ns. Therefore, we can define the following features.
K 1 = N 4 + N 5 K 2 = N 1 + N 2 + N 5 K 3 = N 6 K 4 = N 2 + N 7
(7)
Figure8 shows the variation of feature K1 extracted from PSK, FSK, QAM, and APSK signals at different SNR values. The threshold is selected to separate QAM/APSK from rest of the modulation schemes. It can be observed from Figure8 that with this feature, successful classification can be obtained at SNR greater than 4 dB. By virtue of Figure8, it is also observed that noise statistics dominate the feature K1 at values of SNR less than 4 dB, which makes it impossible to distinguish at this range one modulation type from another.
Figure 8
Figure 8

K 1 versus SNR for the different FSK/PSK and QAM/APSK signals.

Figure9 shows the normalized histogram of magnitude of constellation diagram of 16QAM and 64QAM signals computed in the absence of noise. Based on this figure, it is obvious that 16QAM is separable from 64QAM by making use of the feature K2. Figure10 shows the variation of the feature K2 against SNR, where it is observed that successful classification can be achieved at approximately 7 dB. 16APSK is separable from 32QAM/APSK using feature K3 which is identified by examining the normalized histogram of the constellations of respective modulations displayed in Figure11. Figure12 shows the variation of the feature K3 against SNR, which shows good prospects of classification around 3 dB. Finally, 32APSK and 32QAM are separated using K4. Note that K4 is effective at approximately SNR = 13 dB as shown in Figure13.
Figure 9
Figure 9

Normalized histograms for constellation points of noiseless 16QAM and 64QAM signals.

Figure 10
Figure 10

K 2 versus SNR for 16QAM and 64QAM signals.

Figure 11
Figure 11

Normalized histograms for the magnitude of the constellation points of noiseless 32QAM, 16APSK, and 32APSK signals.

Figure 12
Figure 12

K 3 versus SNR for 16APSK, 32APSK, and 32QAM signals.

Figure 13
Figure 13

K 4 versus SNR for 32APSK and 32QAM signals.

Structure of the AMC algorithm

The proposed AMC follows a step-by-step approach for classification of the modulation schemes. A decision is taken at each step using one of the features which results in identification of either a type or order of an individual modulation. There are a total of three main features used to classify 12 modulation schemes targeted in this article. The structure of the decision tree is illustrated in Figure14. Each decision node (comparator) is labeled with the name of the feature. It can be observed that in the initial stages only modulation types are identified, and orders of the individual modulation schemes are determined in later stages.
Figure 14
Figure 14

The flow chart of the proposed AMC algorithm.

Computational complexity

The computational complexity of the proposed AMC algorithm determines its suitability for real-time implementation in practical systems. Here, we consider the algorithm complexity in terms of number of multiplications, additions, and comparisons given the sequence acn(i) or a(i). Table4 shows these counts expressed in terms of number of samples Ns. It is of interest to note that the proposed feature has the least computational cost as it requires no multiplication operations. By virtue of Table4, it is not difficult to conclude that the computational complexity is upper bounded by Ns/2log(Ns) + 4Ns + 1 multiplications, Nslog(Ns) additions and 4N s + 1 comparisons, which is very attractive for real-time implementation. Note that Table4 shows the maximum possible addition operations for the proposed feature K l . In reality, far fewer additions are needed.
Table 4

Computational complexity of the proposed algorithm

Feature

Number of operations

Complex multiplication

Complex addition

Comparison

K 1

0

Ns – 1

2Ns + 1

K 2

0

Ns – 1

3Ns + 1

K 3

0

Ns – 1

2Ns + 1

K 4

0

Ns – 1

4Ns + 1

K max

Ns/2log(Ns) + Ns + 1

Ns log(Ns)

N s

Γ1

Ns/2log(Ns) + Ns + 1

Ns log(Ns)

N s

Γ2

Ns/2log(Ns) + 2Ns + 1

Ns log(Ns)

N s

Γ4

Ns/2log(Ns) + 4Ns + 1

Ns log(Ns)

N s

Results

This section presents results that show the overall performance of the proposed AMC algorithm in the presence of either G or BK noise for classifying the type and order of a particular modulation. Features described in Section 3 are extracted from the signal under consideration and utilized in the proposed AMC scheme according to Figure14. Simulation results are presented at different values of SNR using parameters’ values given in Table2. The performance is measured in terms of probability of correct classification (Pcc) averaged over 100 independent trials.

Figures15 and16 show the classification rate of QAM/APSK signals, where it is observed that 16QAM and 32APSK have the lowest values. Specifically, 16QAM and 32APSK have Pcc > 0.9 at SNR = 12 dB and SNR = 13 dB, respectively. On the other hand, 64QAM has shown almost constant performance with respect to SNR. This is intuitively not surprising as the steps pertaining to 64QAM classification first test the received signal against the hypothesis of being 32QAM/32APSK or 16APSK. If not true, then the signal is tested against the hypothesis of being 16QAM; otherwise it is declared 64QAM. That is, as the SNR decreases, the likelihood of correct classification is always in favor of 64QAM. Similar conclusion can be drawn for 32QAM.
Figure 15
Figure 15

Performance of the proposed AMC algorithm pertaining to the classification of APSK modulations in presence of G and BK noises.

Figure 16
Figure 16

Performance of the proposed AMC algorithm pertaining to the classification of QAM modulations in presence of G and BK noises.

Figure17 shows the classification rate of FSK and OQPSK modulations in the presence of G/BK noise, where Pcc > 0.9 is attained for both noise models at approximately SNR = 7 dB. Similar performance has been observed for PSK with Pcc = 1 at SNR = 8 dB, as shown in Figure18.
Figure 17
Figure 17

Performance of the proposed AMC algorithm pertaining to the classification of FSK and OQPSK modulations in presence of G and BK noises.

Figure 18
Figure 18

Performance of the proposed AMC algorithm pertaining to the classification of PSK modulation in presence of G and BK noises.

The average probability of correct classification (Pca) over all 12 modulation schemes is shown in Figures19,20, and21 for different noise distributions, roll-off factor, and frequency offsets, respectively. It is observed that change of noise model or frequency offset has almost no significant effect on the classification rate. In addition, the proposed AMC method shows acceptable performance with practical values of roll-off factor.
Figure 19
Figure 19

Average P cc in presence of G and BK noises.

Figure 20
Figure 20

Average P cc with values of roll-off factor 0.25, 0.35, and 0.45.

Figure 21
Figure 21

Average P cc for different values of frequency offset.

Figure22 shows Pca of the proposed AMC algorithm at two different symbol rates: 1200 and 2400 Hz using the same thresholds computed at 2400 Hz. The result shows slight discrepancies between the performances using the two data rates. Note that as the data rate decreases, the number of symbols involved in features’ computations also decreases for fixed values of Ns and fs. Changing the sampling rate also affects the algorithm in a similar manner to the effect of changing the symbol rate. In fact, the main influencing factor is the number of samples per symbol. The proposed AMC algorithm makes use of a fixed window of size Ns received samples. Increasing (deceasing) the sampling rate means fewer (more) symbols are packed into the Ns samples window. Therefore, it can be inferred from Figure22 the effect of changing the sampling rate for fixed values of Ns. By virtue of Figure22, it is evident that for optimum results, thresholds need to be fine-tuned if the sampling rate gets changed.
Figure 22
Figure 22

Average P cc for different symbol rate values.

Conclusions

In this article, a new features-based decision tree AMC algorithm is developed for the classification of most popular single carrier modulations used in HF communications systems, i.e., 2FSK, 4FSK, 8FSK, 2PSK, 4PSK, 8PSK, 16QAM, 32QAM, 64QAM, 16APSK, and 32APSK. Towards this objective, three features are employed that include PSD and DFT of k th power of received signal. A new constellation-based feature for the classification of QAM and APSK signals is also proposed.

In practice, the received signal is often corrupted by HF noise whose statistical characteristics have PDF best described by a model that fluctuates between G and BK distributions; in addition the received signal may have frequency, phase, and symbol synchronization errors. Extensive simulations results have shown that the proposed features are insensitive to noise model variation or synchronization errors.

The proposed AMC method has an advantage of being simple to implement as it uses decision-tree with pre-computed thresholds for signal classification. In addition, it is capable to classify type and order of modulation in band-limited HF noise environment at relatively low SNR.

Declarations

Acknowledgments

The authors would like to thank the reviewers for their time and effort spent in carefully reviewing the manuscript, and for their valuable comments that have greatly contributed to the enhancement of article’s quality. This study was supported by Grant no. 08-ELE 263–2 from the unit of Science and Technology at King Saud University.

Authors’ Affiliations

(1)
KACST Technology Innovation Center in Radio Frequency and Photonics, Riyadh, Saudi Arabia
(2)
Prince Sultan Advanced Technologies Research Institute/STC-Chair, Riyadh, Saudi Arabia
(3)
Electrical Engineering Department, King Saud University, Riyadh, Saudi Arabia

References

  1. Prosch R: Technical Handbook for Radio Monitoring I. Books on Demand GmbH, Norderstedt, Germany; 2007.Google Scholar
  2. Maslim N: HF Communications: A Systems Approach. CRC Press, London; 1987.View ArticleGoogle Scholar
  3. Giesbrecht J, Clarke R, Abbott D: An empirical study of the probability density function of HF noise. Fluct. Noise Lett. 2006, 6(2):L117-L123. 10.1142/S0219477506003203View ArticleGoogle Scholar
  4. Giesbrecht J Proc. IET International Conference on Ionospheric Radio Systems and Techniques (IRST’09). In An impirical study of HF noise near Adelaide Australia. Edinburgh, UK; 2009:310-314.Google Scholar
  5. Xu JL, Su W, Zhou M: Likelihood-ratio approaches to automatic modulation classification. IEEE Trans. Syst. Man Cybern. C Appl. Rev. 2011, 1: 455-469.View ArticleGoogle Scholar
  6. Jain P, Buehrer RM: Implementation of adaptive modulation on the Sunrise software radio. Proc. 45th Midwest Symp. Circ. and Syst. (MWSCAS) 2002, 3: 405-408.Google Scholar
  7. De Vito L, Rapuano S, Villanacci M: Prototype of an automatic digital modulation classifier embedded in a real-time spectrum analyzer. IEEE Trans. Instrum. Meas. 2010, 59(10):2639-2651.View ArticleGoogle Scholar
  8. Nandi AK, Azzouz EE: Algorithms for automatic modulation recognition of communication signals. IEEE Trans. Commun. 1998, 46: 431-436. 10.1109/26.664294View ArticleGoogle Scholar
  9. Azzouz EE, Nandi AK: Automatic Modulation Recognition of Communication signals. Kluver Academic; 1996.View ArticleMATHGoogle Scholar
  10. Orlic VD, Dukic ML: Multipath channel estimation algorithm for automatic modulation classification using sixth-order cumulants. IET Electron. Lett. 2010, 46(19):1348-1349. 10.1049/el.2010.1893View ArticleGoogle Scholar
  11. Wu H-C, Saquib M, Zhifeng Y: Novel automatic modulation classification using cumulant features for communications via multipath channels. IEEE Trans. Wirel. Commun. 2008, 7(8):3098-3105.View ArticleGoogle Scholar
  12. Dobre OA, Abdi A, Bar-Ness Y, Su W Proc. IEEE Military Communs. Conf. (MILCOM’05), vol. 4. In Selection combining for modulation recognition in fading channels. Atlantic City, US; 2005:2499-2505.Google Scholar
  13. Xin Z, Ying W, Bin Y: Signal classification method based on support vector machine and high-order cumulants. Wirel. Sensor Netw. 2010, 2(1):48-52.Google Scholar
  14. Avci E, Hanbay D, Varol A: An expert discrete wavelet adaptive network based fuzzy inference system for digital modulation recognition. Expert Syst. Appl. 2007, 33(3):582-589. 10.1016/j.eswa.2006.06.001View ArticleGoogle Scholar
  15. Avci E, Avci D: The performance comparison of discrete wavelet neural network and discrete wavelet adaptive network based fuzzy inference system for digital modulation recognition. Expert Syst. Appl. 2008, 35(1–2):90-101.View ArticleGoogle Scholar
  16. Maliatsos K, Vassaki S Proc. IEEE Personal, Indoor and Mobile Radio Commun. (PIMRC’07). In Ph. Constantinou, Interclass and Intraclass modulation recognition using the Wavelet Transformation. Athens, Greece; 2007:1-5.Google Scholar
  17. Ling-Ling M, Xiu-jie S Proc. IEEE Intl. Conf. Wavelet Analysis and Pattern Recogn. (ICWAPR’07). In An Improved Algorithm of Modulation Classification For Digital Communication Signals Based on Wavelet Transform. Beijing, China; 2007:1226-1231. vol. 3Google Scholar
  18. Cheol-Sun P, Jun-Ho C, Sun-Phil N, Won J: Automatic Modulation Recognition of Digital Signals using Wavelet Features and SVM, in Proc. Inl. Conf. Adv. Comm. Tech. (ICACT’08). Gangwon-Do, China 2008, 1: 387-390.Google Scholar
  19. Ketterer H, Jondral F, Costa AH Proc. Proc. IEEE Internatinal Conference on Acoustics, Speech and Signal Processing (ICASSP’99), vol. 5. In Classification of modulation modes using time-frequency methods. Phoenix, Arizona; 1999:2471-2474.Google Scholar
  20. Wong MLD, Nandi AK: Automatic digital modulation recognition using artificial neural network and genetic algorithm. Signal Process. 2004, 84(2):351-365. 10.1016/j.sigpro.2003.10.019View ArticleMATHGoogle Scholar
  21. Theodoridis S, Koutroumbas K: Pattern Recognition. 4th edition. Elsevier Inc., Canada; 2009.MATHGoogle Scholar
  22. Le B, Rondeau T, Maldonado D: Modulation identification using neural networks for cognitive radios, in Proceedings of the SDR Technical Conference (SDR’05). Phoenix, AZ; 2005.Google Scholar
  23. Dobre OA, Abdi A, Bar-Ness Y, Su W: Survey of automatic modulation classification techniques: classical approaches and new trends. IET Commun. 2007, 1(2):137-156. 10.1049/iet-com:20050176View ArticleGoogle Scholar
  24. Giesbrecht JE, Clarke R, Abbott D Proc. SPIE Int. Symp. Microelectr., MEMS, and Nanotech. (2006). In Modulation recognition for real HF signals. Brisbane, Australia; 2006:458-469. Vol. 60Google Scholar
  25. Giesbrecht J, Clarke R, Abbott D: Parameters for automatic modulation recognition of HF signals, in 10th IET International Conference on Ionospheric Radio Systems and Techniques IRST 2006. 2006.Google Scholar
  26. Giesbrecht J: Entropic distance for automatic modulation recognition of HF signals, in 11th IET International Conference on Ionospheric Radio Systems and Techniques IRST 2009. Edinburgh, IET, UK; 2009.Google Scholar
  27. Alharbi H, Mobien S, Alshebeili S, Alturki F: Classification of Digitally Modulated Signals in Presence of Non-Gaussian HF Noise, in Proc. 7th Intl. Symp. Wireless Commun. Syst. (ISWCS’10). York, United Kingdom; 2010:815-819.Google Scholar
  28. Alharbi H, Mobien S, Alshebeili S, Alturki F: Robustness of digitally modulated signal features against variation in HF noise model. EURASIP J. Wirel. Commun. Netw. 2011, 2011: 24. 10.1186/1687-1499-2011-24View ArticleGoogle Scholar
  29. De Gaudenzi R, Guillen A, Martinez A: Performance analysis of turbo-coded APSK modulations over nonlinear satellite channels. IEEE Trans. Wirel. Commun. 2006, 5(9):2396-2407.View ArticleGoogle Scholar
  30. Ciblat P, Ghogho M: Blind NLLS carrier frequency-offset estimation for QAM, PSK, and PAM modulations: performance at low SNR. IEEE Trans. Commun. 2006, 54(10):1725-1730.View ArticleGoogle Scholar
  31. Xie F, Li C, Wan G: An Efficient and Simple Method of MPSK Modulation Classification, 4th International Conf. on Wireless Communications, Networking and Mobile Computing (WiCOM '08). Dilian, China; 2008:1-3.Google Scholar
  32. Proakis JG: Digital Communications. McGraw-Hill, New York; 2001.MATHGoogle Scholar
  33. Seungkeun P, Heechang C, Sangsin N: Intersymbol interference due to mismatched roll-off factors and sampling jitter over a Gaussian channel. Electron. Lett. 1997, 33(24):2016-2017. 10.1049/el:19971191View ArticleGoogle Scholar
  34. Assimonis SD, Matthaiou M, Karagiannidis GK, Nossek JA: Improved parametric families of intersymbol interference-free Nyquist pulses using inner and outer functions. IET Signal Process. 2011, 5(2):157-163. 10.1049/iet-spr.2009.0267View ArticleGoogle Scholar
  35. Gardner FM: A BPSK/QPSK timing-error detector for sampled receivers. IEEE Trans. Commun. 1986, 34(5):423-429. 10.1109/TCOM.1986.1096561View ArticleGoogle Scholar
  36. Rahman MA, Sum CS, Funada R, Baykas T, Wang J, Sasaki S, Harada H, Kato S: Error rate analysis of band-limited BPSK with Nakagami/Nakagami ACI considering nonlinear amplifier and diversity. IEEE Trans. Veh. Technol. 2010, 59(3):1523-1529.View ArticleGoogle Scholar
  37. Leconte M, Testard M: “A model of high frequencies (H.F) channel used to design a modem of 9600 bits/s rate in 3 kHz of bandwidth,” MILCOM 97 Proceedings. 1997, 1: 351-355.Google Scholar
  38. Mobaseri B: Constellation shape as a robust signature for digital modulation recognition, in Proc. IEEE Military Communs. Conf. (MILCOM’99), Volume 1, Issue. NJ, USA; 1999:442-446.Google Scholar
  39. Ahmadi N, Reza B: Modulation classification of QAM and PSK from their constellation using Genetic Algorithm and hierarchical clustering, in Proc. Intl. Conf. inf and commun. Tech.: from Theory to Appl. (ICTTA'08). Umayyad Palace, Damascus, Syria; 2008:1-5.Google Scholar
  40. Ahmadi N, Reza B: A template matching approach to classification of QAM modulation using genetic algorithm. Signal Process. Int. J. 2009, 3(5):95-109.Google Scholar
  41. Kam-Tim W, Chi-Wah K: Clustering based distribution fitting algorithm for Automatic Modulation Recognition, in Proc. IEEE Symp. Comp. and Commun. (ISCC'07). 2007, 13-18.Google Scholar
  42. Changyi Y, Bingbing L, Yanling L: Modulation Classification of MQAM Signals from Their Constellation Using Clustering, in Proc. Intl. Conf. Commun. Software and Networks (ICCSN’10). 2010, 303-306.Google Scholar

Copyright

Advertisement