Signal Classification in Fading Channels Using Cyclic Spectral Analysis
 Eric Like^{1},
 VasuD Chakravarthy^{2},
 Paul Ratazzi^{3} and
 Zhiqiang Wu^{4}Email author
DOI: 10.1155/2009/879812
© Eric Like et al. 2009
Received: 4 May 2009
Accepted: 13 July 2009
Published: 7 September 2009
Abstract
Cognitive Radio (CR), a hierarchical Dynamic Spectrum Access (DSA) model, has been considered as a strong candidate for future communication systems improving spectrum efficiency utilizing unused spectrum of opportunity. However, to ensure the effectiveness of dynamic spectrum access, accurate signal classification in fading channels at low signal to noise ratio is essential. In this paper, a hierarchical cyclostationarybased classifier is proposed to reliably identify the signal type of a wide range of unknown signals. The proposed system assumes no a priori knowledge of critical signal statistics such as carrier frequency, carrier phase, or symbol rate. The system is designed with a multistage approach to minimize the number of samples required to make a classification decision while simultaneously ensuring the greatest reliability in the current and previous stages. The system performance is demonstrated in a variety of multipath fading channels, where several multiantennabased combining schemes are implemented to exploit spatial diversity.
1. Introduction
Wireless access technologies have come a long way and are expected to radically improve the communication environment. On the other hand, the demand for spectrum usage in all environments has seen a considerable increase in the recent years. As a result, novel methods to maximize the use of the available spectrum have been proposed. One critical area is through the use of cognitive radio [1, 2]. Traditionally, wireless devices access the spectrum in a static bandwidth allocation. As the number of wireless users have increased, there has been a corresponding decrease in the amount of available spectrum. Cognitive radio seeks to relieve this burden by determining which areas of the spectrum are in use at a particular time. If a given band of the spectrum is not currently being used, that band could be used by another system. Given the dynamic nature of the current communication environment, cognitive radio and dynamic spectrum access has attracted strong interest in its capability of drastically increasing the spectrum efficiency. Many spectrum sensing algorithms have been proposed for cognitive radio, such as energy detection, pilotbased coherent detection, covariancebased detection, and cyclostationary detection [3, 4]. Cyclostationary detectionbased spectrum sensing is capable of detecting the primary signal from the interference and noise even in very low SNR region [4]. Hence, the FCC has suggested cyclostationary detectors as a useful alternative to enhance the detection sensitivity in CR networks.
However, a more efficient method to maximize the use of the available spectrum would be to not simply avoid frequency bands that are in use, but rather to limit the amount of inband transmission down to an acceptable low level so as to avoid interfering with the original user. For example, hybrid overlay/underlay waveforms have been proposed in [5] to exploit not only unused spectrum bands but also underused spectrum bands in cognitive radio. Since different signals are able to tolerate different amounts of interference, the signal type of the original user will have to be determined. In this case, merely detecting the presence of the signal will not be sufficient.
Modulation recognition and signal classification has been a subject of considerable research for over two decades. Classification schemes can generally be classified into one of two broad categories—likelihoodbased (LB) approaches and featurebased (FB) approaches. LB approaches attempt to provide an optimal classifier by deriving a model for the signals being considered, and choosing the classification scheme with the greatest likelihood. However, a complete mathematical description of the model is usually extremely complex to arrive at, and generally the systems are highly sensitive to modeling errors. Additionally, the complexity of the classifier can frequently become too burdensome to operate in a realtime manner [6, 7].
FB approaches attempt to extract critical statistics from the received signal to make a classification based on the reduced data set. This can frequently be performed at a fraction of the complexity of LB systems. While FB methods are suboptimal in the Bayesian sense, they often provide near optimal performance [8].
FB systems have been implemented using a vast array of features. These have included statistics derived from the instantaneous amplitude, phase, and frequency, zerocrossing intervals, wavelet transforms, amplitude and phase histograms, constellation shapes, as well as many others [8–10]. However, many of these methods require a priori knowledge of critical signal statistics, such as the carrier frequency, carrier phase, symbol rate, or timing offset, among others. However, these statistics are generally unknown in practical applications, and requiring their knowledge severely limits the utility of the classifier.
One area that has demonstrated a considerable amount of potential is cyclostationary (CS) based approaches. CS methods have been demonstrated to be insensitive to unknown signal parameters and to preserve the phase information in the signal [11, 12]. In [13, 14] the Spectral Coherence Function (SOF) was used to classify lowerorder digital modulation schemes. In [10], mixed secondorder and fourthorder cyclic cumulants (CCs) were used to distinguish PSK and QAM signals. In [15] sixth and lowerorder CCs were utilized to classify a wide range of signals, and in [16] the ability of fourthorder through eighthorder CCs were investigated to classify QAM, ASK, and PSK signals of different orders.
However, each of the classifies above was only simulated in an AWGN channel and most assume knowledge of the unknown signal's carrier frequency, phase, or symbol rate. For a more realistic analysis, classifier performance should be assessed in fading channels. In [6] the authors investigated the use of eighthorder CCs to classify digital signals in a flat fading channel. By employing a multiantenna receiver using selection combining (SC), the system performance was shown to increase considerably. However, like the schemes above, it too assumed prior knowledge of the signal's symbol rate, and that the carrier frequency had already been removed. Additionally, while SC was shown to improve the performance of the classifier, it does not fully exploit the multiple received copies of the signal.
In this paper, we extend the results of [6, 14] to investigate the use of cyclic spectral analysis and CCs in a hierarchical approach for modulation recognition of a wide range of signals, with no a priori knowledge of the signal's carrier frequency, carrier phase, or symbol rate. Specifically, the proposed classifier will attempt to discriminate between AM, BFSK, OFDM, CDMA, 4ASK, 8ASK, BPSK, QPSK, 8PSK, 16PSK, 16QAM, and 64QAM modulation types. Multiple combining methods are investigated and the performance of the classifier under various channel conditions is assessed. The classifier features identified in [14] based on the SOF and in [6] based on eighthorder CCs are used as a benchmark for comparison purposes. In Section 2 the underlying statistics are developed, and the cyclostationary features to be used are defined. In Section 3 the multiantenna combining schemes to be investigated are described, and the proposed classifier design is given in Section 4. In Section 5 simulation results are presented, followed by a conclusion in Section 6.
2. Signal Statistic Development
2.1. Signal Model
A modulated signal as received by the classifier can be modeled as
where is the complexvalued received signal, is the carrier frequency, is the carrier phase, is the signal time offset, is additive Gaussian noise, and denotes the timevarying message signal. For digital signals, this can be further specified as
where is the pulse shape, is the symbol period, and is the digital symbol transmitted at time . Here, the symbols are assumed to be zero mean, identically distributed random variables.
CSbased features have been used in numerous ways as a reliable tool to determine the modulation scheme of unknown signals [10, 14, 16]. CSbased approaches are based on the fact that communications signals are not accurately described as stationary, but rather more appropriately modeled as cyclostationary. While stationary signals have statistics that remain constant in time, the statistics of CS signals vary periodically. These periodicities occur for signals of interest in well defined manners due to underlying periodicities such as sampling, scanning, modulating, multiplexing, and coding. This resulting periodic nature of signals can be exploited to determine the modulation scheme of the unknown signal.
2.2. SecondOrder Cyclic Features
The autocorrelation function of a CS signal can be expressed in terms of its Fourier Series components [11, 12]:
where is the expectation operator, is the set of Fourier components, and the function giving the Fourier components is termed the cyclic autocorrelation function (CAF) given by
Alternatively, in the case when is periodic in with period , (4) can be expressed as
The Fourier Transform of the CAF, denoted the Spectral Correlation Function (SCF), is given by
This can be shown to be equivalent (assuming cycloergodicity) to [11]
Here it can be seen that is in fact a true measure of the correlation between the spectral components of . A significant benefit of the SCF is its insensitivity to additive noise. Since the spectral components of white noise are uncorrelated, it does not contribute to the resulting SCF for any value of . This is even the case when the noise power exceeds the signal power, where the signal would be undetectable using a simple energy detector. At , where noise is observed, the SCF reduces to the ordinary Power Spectral Density (PSD).
To derive a normalized version of the SCF, the Spectral Coherence Function (SOF) is given as
An additional benefit to using the SOF is its insensitivity to channel effects. Wireless signals are typically subject to severe multipath distortion. Taking this into consideration, the SCF of a received signal is given as
To compute the SOF for a sampled signal, a sliding windowed FFT of length can be used to compute , and a sum taken over the now discrete versions of gives the resulting equation for . Additionally, the limits in (7) and (8) must be made finite, and an estimate of the SCF is obtained. This has the effect of limiting the temporal and spectral resolution of the SCF. In (7), is the amount of time over which the spectral components are correlated. This limits the temporal resolution of the signal to . In [17] the cyclic resolution is shown to be approximately . Similarly, the spectral resolution is limited to , where is the resolution of the FFT used to compute .
To obtain a reliable estimate of the SCF, the random fluctuations of the signal must be averaged out. The resulting requirement is that the timefrequency resolution product must be made very large, with , or equivalently, . This has the effect of requiring a much finer resolution for the cycle frequencies than would be provided by the FFT operation. To compensate for this, it has been proposed to zero pad the input to the FFTs out to the full length of the original signal [14]. However, this leads to a computationally infeasible task. A more suitable method is to first estimate the cycle frequencies of interest using the method outlined in [18]. After the appropriate cycle frequencies have been located, the SCF can be computed using the equivalent method of frequency smoothing on the reduced amount of data:
where is defined in (8) with replaced by .
The resulting feature derived from the SOF is a threedimensional image. This presents an unreasonable amount of data for a classifier to operate on in real time. Therefore, it must be further reduced to provide a more computationally manageable feature. In [14] the authors proposed using merely the cycle frequency profile of the SOF. However, in our previous work of [13] it was demonstrated that with a minimal increase in computational complexity, both the frequency profile as well as the cycle frequency profile can be used, creating a pseudothreedimensional image of the SOF which performs at a significantly higher degree of reliability for classification. The resulting feature used for classification is then defined as the cycle frequency profile:
and the spectral frequency profile
These features can then be analyzed using a pattern recognitionbased approach. Due to its ease of implementation, and its ability to generalize to any carrier frequency or symbol rate, a neural networkbased system is proposed to process the feature vectors. This system will be outlined in Section 4.
2.3. HigherOrder Cyclic Features
To discriminate between signals of these types, higherorder cyclic statistics (HOCSs) must be employed. For this end, we introduce the thorder/ conjugate temporal moment function:
where represents the one of q total conjugations. For the case of , , and , the TMF reduces to the autocorrelation function defined in (3). Like the autocorrelation function, the TMF of CS signals exhibits one or more periodicities and can be expressed in terms of its Fourier coefficients:
where is termed the cyclic temporal moment function.
To isolate the cyclic features present at an order from those made up of products of lowerorder features we make use of the thorder/ conjugate temporal cumulant (TC). The TC is given by the moment to cumulant formula
where is the set of distinct partitions of , is a delay vector with indices specified by , and and correspond to the number of elements and the number of conjugated terms in the subset , respectively. When computing the TC, the effect of lowerorder moments is effectively subtracted off, leaving the only remaining impact due to the current order. The TC is also a periodic function for cyclostationary signals, with its Fourier components given by
where is the cyclic cumulant (CC) of .
Since it is computationally infeasible to perform a multidimensional Fourier Transform of (18) to compute a higherorder variation of the SCF, we are restricted to manipulate (18) directly as a feature for classification. However, by substituting (2) into (17) and (18), it can be shown that the resulting value of the CC is given by [6]
Theoretical stationary cumulants [6].
 4ASK  8ASK  BPSK  QPSK 

 1  1  1  0 
 1  1  1  1 



 1 



 0 





 8.32  7.19  16  0 
 8.32  7.19  16  4 
 8.32  7.19  16  0 
 8.32  7.19  16  4 








 0 



 34 



 0 





 8PSK  16PSK  16QAM  64QAM 
 0  0  0  0 
 1  1  1  1 
 0  0 


 0  0  0  0 





 0  0  0  0 
 0  0  2.08  1.80 
 0  0  0  0 
 4  4  2.08  1.80 
 1  0 


 0  0  0  0 
 0  0 


 0  0  0  0 





As in the case of the SOF, the magnitude of (19) is taken to remove the phase dependence on the carrier frequency, phase, and signal time offset. The resulting feature is given as
Assuming a raised cosine pulse shape, the maximum of the resulting function has been shown to occur at , where is an dimensional zero vector. Furthermore, at , the function decreases with increasing [6]. is therefore chosen to be to maximize the test statistic. should then be evaluated at .
The desired value of used to evaluate the CC depends on both and , which are both unknown and will need to be estimated. This value of can be derived by noting that cyclic features will only occur at intervals of . For a raised cosine pulse, the magnitude of obtains its largest value at , corresponding to a cycle frequency of . The next largest peak occurs at , which is the desired cycle frequency. To estimate the desired value of , all that is needed is to search for the cycle frequency corresponding to the largest cyclic feature, and evaluate the CC at an offset of from this location. Given that the variance of the CC estimates increase with increasing order [16], we desire to use the lowest order CC possible to estimate to achieve a more reliable estimate. The secondorder/oneconjugate CC is therefore selected to estimate , as all of the modulation schemes being considered will contain a feature at this cycle frequency. Using the value of computed from the secondorder CC, paired with the estimate of obtained for each CC, the computation of the value of is straightforward.
The resulting values of the different order/conjugate pairs of the CCs can now be used to classify the signal further to discriminate between signals for which the SOF was unable. By referring to Table 1, the specific modulation type as well as its order can be determined from the expected values of . In [6] it was proposed to use only the eighthorder CCs of the received signal. However, the results can be improved by using the lowerorder CCs in the estimate, whose variance is shown to be less than that of corresponding higher orders. By implementing a hierarchical scheme, lowerorder CCs can perform an initial classification, followed by progressively higherorder CCs to further refine the classification decision. In this way a more reliable estimate can be obtained. Furthermore, in poor channel conditions, the hierarchical scheme is expected to better distinguish between modulation families than a scheme based purely on a singlehigher order CC, due to the lower variance in the CCs.
2.4. Identification of OFDM Signals
While the existence of cyclic prefix in OFDM signal makes the detection and classification of OFDM signal much easier, in reality the signal detector/classifier sometimes needs to make decision in a short observation time window. When this observation window is shorter than the duration of one OFDM symbol, cyclic prefix is not included in the observation window. Hence, since there are numerous efficient algorithms to detect and classify an OFDM signal based on its cyclic prefix through the use of a simple autocorrelation procedure [21–23], we focus on the case of an OFDM signal transmitted with no cyclic prefix. Therefore, an intermediate stage is needed between the SOFbased classifications and the HOCSbased classifications.
A simple yet effective method to distinguish OFDM signals from the single carrier signals in question is obtained by considering the fact that OFDM signals are composed of multiple independently time varying signals. By use of the Central Limit Theorem from probability theory, these can be approximated as a Gaussian random signal [21]. Through the use of a simple Gaussianity test, the OFDM signals can therefore be accurately identified. Since Gaussian signals do not exhibit features for CCs other than their 2ndorder/1conjugate CC, the CC features derived above to distinguish between the HOCS features can also be used to classify an OFDM signal, assuming the number of subcarriers present is high.
3. Multiantenna Combining
In the presence of multipath fading channels, the received signal can be severely distorted. Several methods exist to exploit spacial diversity through the use of multiple receiver antennas. By assuming that the channel fades independently on each antenna, the signal received on each can be combined in various ways to improve performance. The general equation for the received analytic signal undergoing multipath propagation is given by
where is the channel response on path , is the delay of the th path, and is the total number of paths received by the classifier.
This can be separated into two general situations. In the first situation, the channel is varying sufficiently slowly so that it can be assumed to be static over the block of data being analyzed.
If the signal is assumed to only be experiencing flat fading, the simplest combining method is to employ a selection combiner (SC). In [6], the effectiveness of an SCbased system was evaluated to combat the effects of flat fading for modulation recognition. By estimating the received power on each antenna, the signal on the antenna with the highest observed power can be selected for classification, while the others are discarded. When assuming that the noise on each antenna has identical powers, this choice will correspond to the signal with the largest SNR, which leads to an extremely simple implementation.
However, in the case of flat fading, a maximum ratio combiner (MRC) can also be implemented. In this case, the signal received from each antenna is weighted by its SNR before being summed with the signals from the other antennas. In practice, the value of the SNR can be estimated simply by using one of several methods [24–26]. However, for the signals to combine coherently, the unknown phase on each channel must be compensated for before adding them together. This can be performed by computing the correlation between signals from two channels given by
where is the power of the signal to be classified. From here, the relative phase difference is given as the phase of the resulting statistic:
The signal can then be multiplied by to align its phase with the phase of the first channel. This procedure can be repeated as necessary depending on the number of antennas employed.
An additional method to compensate for channel corruption in the SOF computation is through a variant of the MRC. While the SOF was derived to be highly insensitive to channel distortion in (10), the SOF image obtained when a deep fade can be significantly distorted by the additive noise components present, which will be amplified when forming the SOF from the SCF. The MRC variant described here then attempts to compensate for this effect by combining weighted estimates of the SOF from each receiver. For this method, the SOF is computed independently for the signal received on each antenna. After the feature vectors and are formed, they are each weighted by the SNR estimated on their respective antennas. Then each is summed, and the procedure follows as before. It is worth noting that this method can be utilized in any fading channel, without the necessity for the assumption of a flat fading channel.
The second general situation exists when the channel is not varying slow enough to be approximated as static throughout the signal's evaluation. Since each of the classification methods above attempts to estimate expected values of joint moments, they are quickly corrupted by a rapidly fading channel. The HOCS features are particularly sensitive since they require a greater amount of samples to converge, during which time the channel can vary drastically. The first stage SOFbased classifier is less sensitive to channel variations, thus providing greater incentive for its use as the first stage in the system.
4. Classifier Design
The proposed classifier is designed to classify AM, BFSK, OFDM, DSCDMA, 4ASK, 8ASK, BPSK, QPSK, 8PSK, 16PSK, 16QAM, and 64QAM modulation types. It is designed in a hierarchical approach to classify the signals using the smallest amount of required data possible, while simultaneously maximizing the reliability of the system. At each stage in the system, the signal's modulation scheme is either classified or grouped with similar schemes narrowed down into a smaller subset. The system is designed to require no knowledge of the received signal's carrier frequency, phase shift, or symbol rate, and only assumes that the signal's presence has been identified, and that it is located within the bandwidth of interest.
The BPSK and ASK signals demonstrate identical SOF images and are not distinguishable based on that metric alone. Similarly, the PSK and QAM signals have identical spectral components. As mentioned in the previous section, the OFDM signal is composed of potentially independently varying signals on each subchannel, which may or may not demonstrate SOCS. However, due to the overlapping nature of the subchannels in an OFDM system, the resulting SOF is decreased, resulting in an SOF image that resembles those of QAM and PSK signals. Additionally, the DSCDMA scheme can be thought to look like a BPSK signal. However, due to the underlying periodicities incurred by both its symbol rate as well as its spreading code, it produces features not found in BPSK or QPSK signals. Thus it can be reliably classified by its SOF image without knowledge of its spreading code.
The HOCSbased processing is also implemented in a hierarchical approach to maximize the ability to accurately determine the class of a signal before further narrowing the list of candidate modulations. This is a critical step since the variance of the CC estimates increases with increasing order [16]. Therefore, we attempt to classify a signal using the lowest order CC possible before proceeding to higherorder CCs.
In each stage, the feature vector used for classification is composed of the appropriate CCs estimated from the received signal:
where and refer to the appropriate order and number of conjugations for the stage. This vector is then compared to the expected vector obtained for each modulation type, defined similarly as
where corresponds to one of the possible modulation schemes being considered by the current stage. The class corresponding to the feature vector with the minimum Euclidean distance from the estimated vector is selected. The processing is then handed off to the next stage until the final modulation scheme as been determined.
5. Simulation Results
Simulations were run with AM, BFSK, OFDM, DSCDMA, 4ASK, 8ASK, BPSK, QPSK, 8PSK, 16PSK, 16QAM, and 64QAM modulated signals. Each of the digital signals was simulated with an IF carrier frequency uniformly distributed between 0.23 and 0.27 times the sampling rate, a symbol rate uniformly distributed between 0.16 and 0.24 times the sampling rate, and a raised cosine pulse shape with a excess bandwidth, with the exception of the BFSK which was modeled with a rectangular pulse shaping filter. The OFDM signal employed 32 subcarriers using BPSK modulation (without a cyclic prefix), and like the other digital signals was passed through a raised cosine filter with a excess bandwidth. The analog signals were also bandlimited using the same raised cosine filter. Additionally, the classifier's receive filter is assumed to be an ideal lowpass filter. Since the symbol rate is assumed to be unknown, the digital signals were not sampled at an integer multiple of the symbol rates, but were sampled at a constant rate independent of the symbol rate and the IF carrier frequency.
The first stage of the classifier used 4096 received time samples, corresponding to an average of approximately 410 symbols, to compute the SOF estimate of the signal, and used this estimate in the neuralnetwork system. The HOCSbased system was tested with 65 536 samples for its classification decision, corresponding to an average of approximately 6500 symbols. The system was tested in a variety of channel conditions, with an SNR range of 0 dB to 15 dB. The channel models simulated include a flat fading channel, twopath fading channel, and a harsh 20path fading channel. Each of the fading channels implemented used independent equalpower paths with Rayleigh distributed amplitudes and uniformly distributed phases. The channels are simulated for two distinct fading scenarios:
(1)slow fading such that the channel can be approximated as constant over the block of observed data;
(2)fast fading with each path maintaining a coherence value of 0.9 over 500 samples, approximately equal to 50 symbols.
Additionally, it is assumed that the SNR of the signal on each antenna can be accurately estimated, and that the channel phase offset between antennas is accurately determined for the slow flat fading channel.
The system performance is measured by its probability of correct classification (Pcc), defined as the percentage of the total number of modulation classifications made that were accurate. The SOFbased classifier from [14] using only the cycle frequency profile is simulated as a benchmark for comparison to the first stage of the proposed classifier. This demonstrates the advantage of using both the cycle frequency as well as the spectral frequency profile for the initial classification stage. The purely eighthorder CC feature vector from [6] is used as a benchmark for comparison to the proposed classifier from end to end. However, to achieve a fair comparison, the AM, DSCDMA, and BFSK signals were excluded from consideration for this case since the purely eighthorder CC does not have the ability to classify signals of this type.
The ability of the system to still achieve a high degree of reliability in determining the modulation family is in part due to the insensitivity of the SOF to the multipath affect as well as to the fewer number of required symbols that must be observed before a classification can be made. Since this stage of the classifier requires significantly fewer observed symbols to make a classification, it is only moderately affected. While the purely eighthorder CCbased classifier is drastically degraded, the proposed classifier is still able to produce a moderate gain in modulation class recognition, demonstrating the ability of the lowerorder cumulants to reliably distinguish between lower order modulations even in the presence of multipath fading.
6. Conclusion
In this paper, a hierarchical modulation recognition system is proposed to classify a wide range of signals. The classifier leverages the ability of cyclic spectral analysis and cyclic cumulants (CCs) to distinguish between signals while requiring no a priori knowledge of critical signal statistics, such as carrier frequency, carrier phase, and symbol rate. By using lowerorder cyclic statistics to make initial classifications, followed by higherorder cyclic statistics to further refine the decision, the classifier is able to obtain a higher overall classification rate. Through the use of several multiantenna combining methods, the performance of the classifier is further improved in multipath fading channels, both when the channel is varying slowly enough so that can be assumed to be static during the period of observation as well when it is fading more rapidly.
Declarations
Acknowledgments
This paper is based upon work supported by the Dayton Area Graduate Studies Institute (DAGSI), National Science Foundation under Grants no. 0708469, no. 0737297, no. 0837677, the Wright Center for Sensor System Engineering, and the Air Force Research Laboratory. Any opinions, findings, and conclusions, or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies.
Authors’ Affiliations
References
 Mitola J: Cognitive radio: an integrated agent architecture for software defined radio, Ph.D. dissertation. KTH Royal Institute of Technology, Stockholm, Sweden; 2000.Google Scholar
 Proceedings of the 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks. , Baltimore, Md, USA; 2005.
 Ma J, Li GY, Juang BH: Signal processing in cognitive radio. Proceedings of the IEEE 2009, 97(5):805823.View ArticleGoogle Scholar
 Haykin S, Thomson DJ, Reed JH: Spectrum sensing for cognitive radio. Proceedings of the IEEE 2009, 97(5):849877.View ArticleGoogle Scholar
 Chakravarthy V, Wu Z, Temple MA, Garber F, Kannan R, Vasilakos A: Novel overlay/underlay cognitive radio waveforms using SDSMSE framework to enhance spectrum efficiency  part I: theoretical framework and analysis in AWGN channel. IEEE Transactions on Communications 2009., 57(12):
 Dobre OA, Abdi A, BarNess Y, Su W: Selection combining for modulation recognition in fading channels. Proceedings of IEEE Military Communications Conference (MILCOM '05), October 2005, Atlatnic City, NJ, USAGoogle Scholar
 Swami A, Sadler B: Hierarchical digital modulation classification using cumulants. IEEE Transactions on Communication 2000, 48(3):416429. 10.1109/26.837045View ArticleGoogle Scholar
 Dobre OA, Abdi A, BarNess Y, Su W: Survey of automatic modulation classification techniques: classical approaches and new trends. IET Communications 2007, 1(2):137156. 10.1049/ietcom:20050176View ArticleGoogle Scholar
 Azzouz E, Nandi A: Automatic Modulation Recognition of Communication Signals. Kluwer Academic Publishers, Dordrecht, The Netherlands; 1996.View ArticleGoogle Scholar
 Marchard P, Lacoume J, Martret C: Multiple hypothesis modulation classification based on cyclic cumulants of different orders. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '98), May 1998, Seattle, Wash, USA 4: 21572160.Google Scholar
 Gardner WA, Brown WA, Chen CK: Spectral correlation of modulated signals—part II: digital modulation. IEEE Transactions on Communications 1987, 35(6):595601. 10.1109/TCOM.1987.1096816MATHView ArticleGoogle Scholar
 Gardner WA: Cyclostationarity in Communications and Signal Processing. IEEE Press, Piscataway, NJ, USA; 1993.Google Scholar
 Like E, Chakravarthy V, Wu Z: Reliable modulation classification at low SNR using spectral correlation. Proceedings of the 4th Annual IEEE Consumer Communications and Networking Conference (CCNC '07), 2007 11341138.Google Scholar
 Fehske A, Gaeddert J, Reed JH: A new approach to signal classification using spectral correlation and neural networks. Proceedings of the 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN '05), 2005, Baltimore, Md, USA 144150.Google Scholar
 Spooner CM: On the utility of sixthorder cyclic cumulants for RF signal classification. Proceedings of the 35th Asilomar Conference on Signals, Systems and Computers, November 2001, Pacific Grove, Calif, USA 1: 890897.Google Scholar
 Dobre OA, BarNess Y, Su W: Higherorder cyclic cumulants for high order modulation classification. Proceedings of IEEE Military Communications Conference (MILCOM '03), October 2003, Monterey, Calif, USA 1: 112117.Google Scholar
 Gardner WA: Measurement of spectral correlation. IEEE Transactions on Acoustics, Speech, and Signal Processing 1986, 34(5):11111123. 10.1109/TASSP.1986.1164951View ArticleGoogle Scholar
 Roberts RS, Brown WA, Loomis HH Jr.: Computationally efficient algorithms for cyclic spectral analysis. IEEE Signal Processing Magazine 1991, 8(2):3849. 10.1109/79.81008View ArticleGoogle Scholar
 Vucic D, Obradovic M, Obradovic D: Spectral correlation of OFDM signals related to their PLC applications. Proceedings of IEEE International Symposium on PowerLine Communications and Its Applications (ISPLC '02), March 2002, Athens, GreeceGoogle Scholar
 Sutton PD, Nolan KE, Doyle LE: Cyclostationary signatures for rendezvous in OFDMbased dynamic spectrum access networks. Proceedings of the 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN '07), 2007, Dublin, Ireland 220231.View ArticleGoogle Scholar
 Han N, Zheng G, Sohn SH, Kim JM: Cyclic autocorrelation based blind OFDM detection and identification for cognitive radio. Proceedings of the 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '08), 2008Google Scholar
 Bouzegzi A, Jallon P, Ciblat P: A second order statistics based algorithm for blind recognition of OFDM based systems. Proceedings of IEEE Global Telecommunications Conference (GLOBECOM '08), 2008, New Orleans, La, USA 32573261.Google Scholar
 Li H, BarNess Y, Abdi A, Somekh OS, Su W: OFDM modulation classification and parameters extraction. Proceedings of the 1st International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CROWNCOM '06), 2006Google Scholar
 Pauluzzi D, Beaulieu N: A comparison of SNR estimation techniques for the AWGN channel. Proceedings of IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing, 1995Google Scholar
 Chen Z, Nowrouzian B, Zarowski CJ: An investigation of SNR estimation techniques based on uniform CramerRao lower bound. Proceedings of the 48th Midwest Symposium on Circuits and Systems (MWSCAS '05), August 2005 1: 215218.Google Scholar
 Wiesel A, Goldberg J, MesserYaron H: SNR estimation in timevarying fading channels. IEEE Transactions on Communications 2006, 54(5):841848.View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.