SYNERGETIC RADIO COOPERATIVE AND COLLABORATIVE RADIO
Cyclostationary Feature Detection Based
Spectrum Sensing Algorithm under Complicated
Electromagnetic Environment in Cognitive Radio
Networks
Yang Mingchuan1, 2, 3, Li Yuan1, Liu Xiaofeng1, Tang Wenyan3
1
Communication Research Center, Harbin Institute of Technology, China
2
Key Lab. for Spacecraft TT&C and Communication under the Ministry of Education, Chongqing
3
Instrument Science and Technology Postdoctoral Station, Harbin Institute of Technology
Abstract: This paper focuses on improving
the detection performance of spectrum sensing
in cognitive radio (CR) networks under com-
plicated electromagnetic environment. Some
existing fast spectrum sensing algorithms can-
not get specific features of the licensed users’
(LUs’) signal, thus they cannot be applied
in this situation without knowing the power
of noise. On the other hand some algorithms
that yield specific features are too complicat-
ed. In this paper, an algorithm based on the
cyclostationary feature detection and theory
of Hilbert transformation is proposed. Com-
paring with the conventional cyclostationary
feature detection algorithm, this approach is
more flexible i.e. it can flexibly change the
computational complexity according to cur-
rent electromagnetic environment by changing
its sampling times and the step size of cyclic
frequency. Results of simulation indicate that
this approach can flexibly detect the feature
of received signal and provide satisfactory de-
tection performance compared to existing ap-
proaches in low Signal-to-noise Ratio (SNR)
situations.
Keywords: cognitive radio; cyclostationary
feature detection; Hilbert transformation
35
I. INTRODUCTION
CR is an important solution to the shortage
of spectrum resource, and it has been widely
investigated over years. In CR networks, the
cognitive users (CUs) sense the spectrum all
the time for adaptation or for dynamic fre-
quency access to utilize the spectrum without
disturbing LUs, which leads to good spectrum
utilization [1, 2]. Thanks to its advantage the
concept of CR can be utilized in collaborative
networks which are widely investigated in
recent years [3, 4] to increase their spectrum
efficiency. On the other hand, collaborative
networks may provide CR networks with
the method of cooperative spectrum sensing,
which can boost its performance of detection.
In CR system, CUs are required to detect
the presence of the LUs off hand in order to
react and avoid impacting their transmissions.
So it is of great importance for CUs to get the
specific features of received signal, such as
frequency, power, sample rate etc. [5]. On the
other hand, the complexity of electromagnet-
ic environment makes the features of signal
change quickly. Therefore, faster detecting
algorithms are required in CR system.
China Communications • September 2015
 However, the power of noise usually re-
mains unknown in complicate electromagnetic
environment. So how to distinguish signal
from noise in this case has become a crucial
problem [6]. In order to find a balance be-
tween the speed of detection and accuracy,
many algorithms have been proposed, such as
matched filter detection, energy detection and
cyclostationary feature detection algorithm [7,
8]. Matched filter detection is one of the best
methods based on the correlative detection.
But it requires prior information of LUs’ sig-
nal, and it also requires the received signal to
be precisely synchronized [9]. Energy detec-
tion is based on non-relative detection, and it
is much less complicated than matched filter
detection. However, the threshold of this ap-
proach may be easily affected by noise, so this
algorithm cannot be applied in the low-SNR
situation where the power of noise remains
unknown [10]. In addition, energy detection
can only provide the information about wheth-
er the LU is absent or not, but cannot yield
specific features of LU’s signals.
At present, method of direct sequence
spread spectrum or frequency hopping spread
spectrum is usually used in complicated elec-
tromagnetic environment, and which makes
the SNR of received signal too low for CUs to
yield good detection performance [11]. There-
fore, spectrum sensing algorithms which can
yield better detection performance are required
in this case. Cyclostationary features detection
algorithm is one of the solutions to this prob-
lem, while it is quite complicated as compared
to energy detection [12].
It can be known from the above discussion
that, many fast algorithms cannot be applied
in low-SNR situations, moreover they usually
cannot yield specific features of received sig-
nals, but other algorithms which can do this
are quite complicated. Aiming at this contra-
diction, the existing cyclostationary feature de-
tection algorithm and theory of Hilbert trans-
formation are investigated in this paper, and
then a flexible detection algorithm is proposed.
This algorithm can change its computation
complexity according to current electromag-
China Communications • September 2015
netic environment by changing sampling times
and the step size of cyclic frequency. Detec- In this paper, a sta-
tors that use less sampling times can quickly tistic cyclostationary
detect the frequency of received signal, while detection algorithm
is proposed after
increasing the sampling times makes detec-
investigating the con-
tor yield better detection performance when ventional method of
SNR is low. Meanwhile, the smaller step size cyclostationary feature
of cyclic frequency is set in the procedure of detection.
detection, the bigger spectrum resolution ratio
detectors can yield.
II. THEORY OF CYCLOSTATIONARY
FEATURE DETECTION
The periodicity of signals is generally caused
by the sine waves or pulse sequences during
modulation. Although data transmitted in the
system follows a stationary stochastic process,
some statistical features of modulated signal
can be periodic e.g. correlation functions.
Moreover, noise is usually assumed to be
wide-sense stationary with no correlation. So
detectors can distinguish it from modulated
signal by analyzing the spectral correlation
function of the signal.
The received signal can be called cy-
clostationary if it satisfies the following condi-
tions:
(1)
(2)
where is the period of signal, and the op-
erator E(⋅) means calculating the average of
signal. Function is the autocorrelation
function of , and represents for the time
offset.
Next, we will discuss the feature of auto-
correlation function and investigate
the theory of cyclostationary feature detection.
Assume there is a complex sine wave signal
defined as:
(3)
where represents the amplitude, and ,
f0 is its frequency and θ represents for phase.
Additive white Gaussian noise (AWGN) is
added to the signal. Therefore, the received
signal in CUs can be given as:
36
 (4)
As the autocorrelation function is
periodic, we can define its Fourier series
as:
(5)
where is defined as cyclic frequency, and
is called cyclic autocorrelation function
(CAF).
If we ignore the noise in the received signal
and combine Eqs. (2), (3) and (5), then we get
that:
(6)
Therefore, by calculating the value of CAF
on different cyclic frequency, we can know
the frequency of received signal. However,
the received signal can be influenced by noise
generally; furthermore, usual electromagnetic
signals transmitted in space are not in complex
form. In order to simplify the algorithm and
make sure it can work under the influence of
noise, we usually apply the theory of Fourier
transformation on CAF and get that:
(7)
where is cyclostaionary spectral density
(CSD).
As for the stationary and stochastic signal
like AWGN, its average of power is zero,
i.e. . And note that , tain both signal
consequently for any cyclic frequency ,
the results of CAF and CSD are both zero,
i.e. and . On the contrary,
for cyclostationary signal, there must be a
nonzero cyclic frequency to make sure that
and . So in this way, CUs
can distinguish cyclostationary signal from
noise by calculating CAF and CSD on differ-
ent cyclic frequencies.
Actually, with the limit of memory and de-
tecting time, the number of sampling cannot
37
be infinite. So even if , the results of
CAF and CSD are not zero sometimes.
It can be concluded from the above dis-
cussion that, by analyzing the CAF and CSD,
conventional cyclostationary feature detection
algorithm can distinguish signal from noise
and get some specific features. This method of
detection can mitigate the influence caused by
noise, and it can provide better detection per-
formance when SNR is low.
However, the disadvantage of this algo-
rithm is also obvious: Firstly, it requires the
signal transmitted to be cyclostationary, or the
detection performance may not be satisfactory.
Secondly, from the procedure of this algorithm
it can be known that it’s quite complicated,
and which makes the detection last longer.
Aiming at its disadvantage, we propose an
approach of statistic cyclostationary detection.
This algorithm is flexible and can be applied
in sophisticated electromagnetic environment.
III. THEORY OF STATISTIC
CYCLOSTATIONARY DETECTION
In this algorithm, it’s not necessary to cal-
culate the cyclic autocorrelation function of
signal. Instead, we add a factor , which is
related to cyclic frequency , to the received
signal. And then calculate its average on a cer-
tain cyclic frequency to get the corresponding
result.
Assume that is the signal received by
CU, and because of the influence caused by
electromagnetic environment, may con-
and noise . So there
are two hypotheses of given as follows:
(8)
where represents for the assumption of
absence of LU when the signal contains noise
only; while represents for the hypothesis of
presence of LU, and in this situation both sig-
nal and noise are received by CU.
First, we add a factor to and
get that:
China Communications • September 2015
 (9) it can be known that can also reach
Next we calculate the average of . its peak when cyclic frequency equals to f0.
Assume the length of detecting time is t0, we The feature of variable is illustrat-
define a variable for a certain cyclic ed in figure 1. In this figure, the frequency of
frequency as follows: received signal f0 is set as 100Hz while noise
is ignored.
Figure 1 indicates that, when cyclic fre-
(10) quency equals to the frequency of LUs’ signal,
If we assume that the received signal is in result of detection reaches its peak,
complex form without noise as described in
no matter how long the detecting time t0 is. So
Eqs. (3), then the result of detection in CU can
if we ignore the value of the peak, which is
be given as follows:
 t   t  supposed to be infinite theoretically, then the
 s(t) × e− j2παt dt
0
 Ae j(2π f t+θ) × e− j2παt dt
0
0

M(α, t0 ) =
0
=
0
result can be simplified to a variable ,
t t0
 t 0  which is related to cyclic frequency only. After
|Ae jθ |  0
 |Ae jθ |
= e j2π( f −α)t
dt = |δ( f0 − α)|
setting a certain and proper detecting time t0,
0

t0  0  t0
(11) detector can acquire the frequency of received
where the operator δ(⋅) represents for Dirac signal by changing cyclic frequency to find the
function. peak value.
It can be known from Eqs. (11) that, if the In other words, CUs can detect the received
length of detecting time t0 is set as an integer signal for certain and proper detecting time,
multiple of the interval [0,2π], then the result and set different cyclic frequencies in a band.
of detection reaches its peak only According to the peaks of the result ,
when cyclic frequency equals to f0. So we can the probable spectrum of that signal can be
get the frequency of received signal by contin- yielded.
ually changing the value of to find the peak However, noise in channel can affect the
of that result. result of detection practically. In order to miti-
H o w e v e r, g e n e r a l l y e l e c t r o m a g n e t - gate the influence caused by noise, we consid-
ic signals are transmitted in real form, i.e. er using the complex form of received signal
. In this case, we should in detection as shown in Eqs. (11). According
reconsider the Eqs. (11). If we ignore the noise to the theory of Hilbert transformation, the
in channel, and simplify it as follows:
M(α, t0 ) = t1  0 x(α, t)dt = t1  0 r(t) × e− j2παt dt
 t 0
  t 0

0 0

= t1  0 A cos(2π f0 t + ϕ) × e− j2παt dt

 t 0

0

|A|
= 2t |e− jϕ Ψ1 ( f0 , α) + e jϕ Ψ2 ( f0 , α)|
0

(12)
where both and are func-
tions related to frequency f0 and cyclic fre-
quency . And they are given as follows:

(13)

(14)
It’s obvious that cyclic frequency , so
if the integral interval [0, t0] is an integer mul-
tiple of the interval [0,2π], then ,
. Therefore, from Eqs. (12) Fig.1 The feature of variable

China Communications • September 2015 38

 procedure of getting the complex signal from
its real component xr(n) can be illustrated in
Figure 2.
In figure 2, xi(n) is the imaginary compo-
nent of complex signal x(n). And the impulse
response of Hilbert transformer is given as
follows:
(15)
Therefore, Hilbert transformation, which
shows the relationship between the imaginary
component and the real component of com-
plex signal, can be defined as follows:
(16)
where the operator represents for Hilbert
transformation.
Furthermore, in order to alleviate the im-
pact of noise, CUs can sample the signal for
certain times and calculate the average of the
results to improve detection performance.
As AWGN is wide-sense stationary, the
procedure of calculating the average of several
sampling results can mitigate the influence
caused by noise. Therefore CUs can work in
low SNR situations and provide better detec-
tion performance in this way.
From above discussion the principle of
statistic cyclostationary detection can be con-
cluded as follows: CU samples the received
signal at contiguous points in time for N times,
and detect each for a certain and proper
detecting time t0, and then average the results
of all the detections.
If CU has several antennas, it can detect
every signal received by each antenna and av-
erage all these results to get the final result of
detection.
Fig.2 Procedure of getting the complex signal
39
In the algorithm of statistic cyclostationary
detection, sampling times N and the step size
of cyclic frequency will dramatically affect
the amount of calculation. Large amount of
calculation can provide good detection perfor-
mance, but it will take longer time and more
energy for detection. In practical application,
there should be a balance between detection
performance and its speed of detection.
IV. IMPLEMENTATION OF THE STATISTIC
CYCLOSTATIONARY ALGORITHM
Actually, it’s quite difficult for CUs to deal
with analogue signals, so these signals are
usually transformed into digital form before
processing. In this subsection, we will discuss
the statistic cyclostationary algorithm for digi-
tal signals.
4.1 Procedure of the statistic
cyclostationary detection
Assume that the number of samples for each
procedure of detection is N0, and according to
the theory of statistic cyclostationary detec-
tion, the procedure of one single search can be
illustrated in figure 3.
In order to mitigate the influence caused by
noise, detectors sample the received signal at
contiguous points in time for N times. There-
fore, the final result of detection can be
given as follows:
(17)
where rk(m) is the kth received digital signal
and represents for its detecting result.
After completing one single search, CU can
compare the final result on every cyclic
frequency with some certain thresholds. If the
value of on one cyclic frequency is
higher than the threshold, it indicates that the
signal contains this frequency component. On
the other hand CU can also put out the final
result on all different cyclic frequencies,
China Communications • September 2015
and the probable spectrum can be directly giv-
en in this way.

4.2 The computation complexity

of the statistic cyclostationary
detection
It can be indicated from the procedure that,
the step size of cyclic frequency directly af-
fects the spectrum resolution ratio of system.
And it’s obvious that the smaller step size of
cyclic frequency used when detecting, the e  j 2π m
bigger spectrum resolution ratio can be yield-
ed. However, the amount of calculation will
increase at the same time. So there should be a 1 N0

balance between spectrum resolution ratio and N0

computation complexity.
On the other hand, sampling times N can
also affect the amount of calculation. If sam-
pling times is increased then detectors can
provide better detection performance and
work in the low-SNR situation. Meanwhile,
the amount of calculation will also increase
and the procedure of detection will last longer.
In conclusion, step size of cyclic frequency
and sampling times N can affect computation
complexity. In the low-SNR situation, detec-
tors can increase the sampling times to yield
better detection performance. Moreover, in the
procedure of detection, detectors can use large
step size of cyclic frequency to search for the
probable band of the signal at the beginning,
and once it is located, they can decrease the
step size to get bigger spectrum resolution ra-
tio. In this way, CU can flexibly control speed
of detection by changing these two parameters
according to current electromagnetic environ-
ment.
V. PERFORMANCE SIMULATION
5.1 Simulation of statistic
cyclostationary detection on simple
signal
In order to verify the availability of statistic
cyclostationary algorithm, it’s utilized to de-
tect simple signal with some single frequen-
cies in this subsection.
( )
m 1
( )
Fig.3 The procedure of one single search
Table I simulation parameters
parameter description value
T sampling time 0.001s
Fs sampling frequency 1 MHz
S step size of cyclic frequency α can be changed
N sampling times can be changed
Assume that received signal is combined
with two simple sine waves with different
phases. The frequency of these sine waves is
150 kHz and 400 kHz respectively, and they
are transmitted in AWGN channel. Parameters
used in simulation are listed in Table I.
At first, this approach is used to detect the
simple signal for only one sampling time with
different spectrum resolution ratios at SNR=
-10dB. Two of the results in this condition
are illustrated in figure 4, where the values
of statistic M are normalized to [0,1], i.e. the
minimum value among them is subtracted
from each value and then it is divided by the
maximum value. Results of simulation in
figure 4 indicate that different spectrum reso-
lution ratios can be yielded via changing the

China Communications • September 2015 40

 step size of cyclic frequency. In practical ap-
1 plication, the computational complexity of this
0.9 approach and its spectrum resolution ratio can
0.8 be flexibly changed by the step size of cyclic
0.7 frequency.
However, the influence caused by noise can
Value of statistic M

0.6

0.5 make the result of detection unstable. There-

0.4 fore, if detectors only sample one time in the
0.3 low-SNR situation, the detection performance
0.2 will dramatically deteriorate. In this case, de-
0.1 tectors can increase the sampling times N to
0
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5
yield better detection performance. Figure 5
Cyclic frequency(Hz)
illustrates the peak to average ratio of results
5
x 10

a) The result of simulation with spectrum resolution ratio is 5 kHz in detection versus SNR for different sampling
times N, where 10000 samples are detected for
1 every SNR value in each procedure of statistic
0.9 cyclostationary detection.
0.8 It can be known from figure 5 that the peak
0.7 to average ratio of results increases along with
Value of statistic M

0.6 the increase of SNR. Generally, higher peak to

0.5 average ratio will make it easier to distinguish
0.4 signals from noise, and the peak to average
0.3 ratios of the results in figure 4 a) and b) are
0.2 respectively 6.033 and 6.040 for reference.
0.1 Results in figure 5 also indicate that detectors
0
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5
may mitigate the influence caused by noise
Cyclic frequency(Hz)
and boost their detection performance in low-
5
x 10

SNR situation by increasing sampling times.

b) The result of simulation with spectrum resolution ratio is 1 kHz
On the other hand, increasing sampling
times means larger amount of calculation
Fig.4 Results of simulation when N=1, SNR=-10dB
and longer time for detection. So CUs should
consider the balance between detection perfor-
mance and the speed of detection. If the condi-
tion of channel is good, then detectors can de-
16
crease the sampling times; otherwise they can
statistic cyclostationary detection N=1
14
statistic cyclostationary detection N=4 increase it to get better detection performance.
statistic cyclostationary detection N=8
12 statistic cyclostationary detection N=16
5.2 Simulation of statistic
cyclostationary detection on BPSK
Peak to average ratio

10

8 signal
6
In this subsection, statistic cyclostationary de-
4 tection algorithm is used to detect modulated
2
Binary Phase Shift Keying (BPSK) signal in
different SNR for testing its performance in
0
-35 -30 -25
SNR(dB)
-20 -15 -10
detecting cyclostationary signals.
It should be noted that although BPSK
signal is cyclostationary, the phase of carrier
Fig.5 Peak to average ratio vs. SNR for different sampling times N can be abruptly changed due to the procedure

41 China Communications • September 2015

of modulation. Therefore, its frequency spec-
trum will extend on both sides of the carrier
1
frequency. Assume that the SNR of detector is
0.9
-5dB and the modulated BPSK signal whose
0.8
carrier frequency is 800MHz is transmitted in
0.7
AWGN channel. The parameters used in simu-

Value of statistic M
0.6
lation are shown in Table I while the step size
0.5
of cyclic frequency is set as 1 MHz, sam-
0.4
pling times N=200. The result of simulation
0.3
which is normalized to [0,1] is shown in figure
0.2
6. From the result of simulation, probable
0.1
spectrum of BPSK signal can be illustrated.
0
If the transmission condition deteriorates, 0 2 4 6 8 10
Cyclic frequency(Hz)
12 14 16
8
x 10
which leads to decrease of SNR at detectors,
performance of detection will be influenced
and this approach may not yield probable Fig.6 Result of simulation on BPSK signal when N=200, SNR=-5
spectrum of the received signal. In this case,
increasing the sampling times N can mitigate
the influence cause by noise. 1

If the spectrum of the received signal is 0.9

not required in the system, i.e. CU only wants 0.8

to know whether LU is present or not. In this 0.7

Probability of Detection

case, we can set a proper threshold to make 0.6

decisions: if the average value of results is 0.5

higher than that threshold CU decides that the 0.4

LU is present; otherwise CU predicates that 0.3

the received signal is noise. Figure 7 shows 0.2

statistic cyclostationary detection N=8
statistic cyclostationary detection N=4
the probability of detection Pd of statistic cy- 0.1 statistic cyclostationary detection N=2
conventional energy detection
clostationary method vs. SNR for different 0
-20 -18 -16 -14 -12 -10 -8 -6 -4 -2 0
SNR(dB)
sampling times N at a fixed probability of
false alarm Pf=0.005. For comparison, the per-
formance of conventional energy detection is Fig.7 Pd vs. SNR for BPSK signal at Pf =0.005
illustrated as well.
It can be indicated from figure 7 that the
statistic cyclostationary detection can pro- 1

vide satisfactory detection performance when 0.9

SNR of detector is low. Moreover, the perfor- 0.8

mance of statistic cyclostationary detection 0.7

Probability of Detection

with sampling times N=2 is similar to that 0.6

of conventional energy detection, while this 0.5

performance can become better along with 0.4

the increase of sampling times. Furthermore, 0.3 conventional energy detection at SNR=-15dB
conventional energy detection at SNR=-10dB
in order to exhibit the relationship between 0.2 statistic cyclostationary detection N=4 at SNR=-15dB
statistic cyclostationary detection N=4 at SNR=-10dB
sensitivity (Pd) and specificity (Pf) of the sta- 0.1 statistic cyclostationary detection N=8 at SNR=-15dB
statistic cyclostationary detection N=8 at SNR=-10dB
tistic cyclostationary detection algorithm, the 0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
Probability of False Alarm
receiver operating characteristic (ROC) curves
are shown in figure 8, where the ROC curves
of conventional energy detection are also illus- Fig.8 ROC curves at different SNR values

China Communications • September 2015 42

 trated for comparison.
The ROC curves in figure 8 indicate that
the performance of statistic cyclostationary
detection algorithm is better than that of con-
ventional energy detection. Moreover, this
performance can be improved by increasing
sampling times N, but the amount of calcula-
tion will increase at the same time.
VI. CONCLUSION
In this paper, a statistic cyclostationary detec-
tion algorithm is proposed after investigating
the conventional method of cyclostationary
feature detection. This approach is based on
cyclostationary feature, and uses the theory
of Hilbert transformation. Comparing with
the cyclostationary feature detection, this
approach is more flexible, i.e. it can flexibly
control the computational complexity and the
speed of detection according to current elec-
tromagnetic environment. Results of simula-
tion indicate that this approach can be used to
detect both simple signals and modulated cy-
clostionary signals, and yield satisfactory per-
formance comparing to conventional energy
detection algorithm. Moreover, this algorithm
can get specific features of received signal,
while it doesn’t require the priori information.
Therefore, it can work in the situation where
the power of noise remains unknown for CUs
and provide detectors with satisfactory de-
tection performance when the SNR is low. In
conclusion, via flexibly controlling its amount
of calculation, this algorithm can get specific
features of the licensed users’ signal while ex-
ecuting the detection as fast as possible.
ACKNOWLEDGMENT
The paper is sponsored by National Basic
Research Program of China (973 Program,
No. 2013CB329003), National Natural Sci-
ence Foundation of China (No. 91438205),
China Postdoctoral Science Foundation (No.
2011M500664). Open Research fund Program
of Key Lab. for Spacecraft TT&C and Com-
munication, Ministry of Education, China (No.
43
CTTC-FX201305).
References
[1] Y. Liang, K. Chen, G Li, and P Mahonen, “Cog-
nitive Radio Networking and Communications:
An Overview,” IEEE Trans. vehicular technology,
vol. 60, no. 7, pp. 3386-3407, Sep. 2011.
[2] M Heng. “Research on Spectrum Detection
Technology in Cognitive Radio,” Radio Engi-
neering Journal, vol. 44, no. 03. pp.77-79, 2014.
[3] W. Feng, N. Ge, and J. Lu, “Hierarchical trans-
mission optimization for massively dense dis-
tributed antenna systems,” IEEE Commun. Lett.,
vol. 19, no. 4, pp. 673-676, Apr. 2015.
[4] W. Feng, Y. Wang, N. Ge, J. Lu, and J. Zhang,
“Virtual MIMO in multi-cell distributed antenna
systems: coordinated transmissions with large-
scale CSIT,” IEEE J. Sel. Areas Commun., vol. 31,
no. 10, pp. 2067-2081, Oct. 2013.
[5] Taherpour A., Nasiri-Kenari M.,and Gazor S.
“Multiple Antenna Spectrum Sensing in Cogni-
tive Radios,” IEEE Trans. on Wireless Commun.,
vol. 9, no. 2, pp. 814-823, Feb. 2010.
[6] A. Mohammadi, M. R. Taban, J. Abouei, and H.
Torabi. “Cooperative spectrum sensing against
noise uncertainty using Neyman-Pearson
lemma on fuzzy hypothesis test,” Applied Soft
Computing Journal, vol. 13 ,no.7, pp. 3307-
3313, Jul. 2013
[7] S. Haykin. “Cognitive radio: brain-empowered
wireless communications,”. IEEE J. Sel. Areas
Commun., vol. 23, no. 2, pp. 0733-8716, Feb.
2005.
[8] S. Xie, Y. Liu, Y. Zhang, and R. Yu, “A Parallel Co-
operative Spectrum Sensing in Cognitive Radio
Networks,” IEEE Trans. vehicular technology, vol.
59, no. 8, pp. 4079-4092, Oct. 2010.
[9] Y. C. Eldara, A. V. Oppenheimb, and D. Eg-
nor, “Orthogonal and projected orthogonal
matched filter detection,” Signal Processing
Journal, vol. 84, no.4, pp. 677-693, Apr. 2004.
[10] Ashish Bagwari and Geetam Singh Tomar
“Adaptive double-thresholdbased energy de-
tector for spectrum sensing in cognitive radio
networks,” International Journal of Electronics
Letters, vol. 1, no. 1, pp. 24-32, Apr. 2013.
[11] C. Hwang, S. Chen, and T. Hsinchu, “Spectrum
sensing in wideband OFDM cognitive radios,”
IEEE Trans. Signal Processing, vol. 58, no. 2, pp.
709-719, Feb. 2010.
[12] Gill, R and Kansal, A, “Comparative Analysis of
the Spectrum Sensing Techniques Energy De-
tection and Cyclostationary Feature Detection”
International Journal of Advanced Research
in Electrical, Electronics and Instrumentation
Engineering, vol. 3, no. 7, pp. 10601-10607, Jul.
2014.
China Communications • September 2015
Biographies Li Yuan(1992-), is studying for a master’s degree
in Information and Communication Engineering at
Yang Mingchuan(1977-), is currently a research
Harbin Institute of Technology, China. His research
associate of Communication Research Center Harbin
interests are in the fields of the quick reconstruction
Institute of Technology, China. He received a B.Sc. de-
of the wireless networks under complicated electro-
gree in Mechanical Engineering from Harbin Institute
magnetic environments.
of Technology, China, in 2001, and a M.Sc degree and
Ph.D degree in Information and Communication En-
Liu Xiaofeng(1961-), is currently a professor of
gineering from Harbin Institute of Technology, China,
Communication Research Center Harbin Institute
in 2004 and 2010 respectively His research interests
of Technology, China. His research interests are in
are in the fields of space information network and
the fields of space information network and mobile
mobile propagation channel modeling, especially
propagation channel modeling.
mobile satellite and High Altitude Platforms (HAPs).
He also has done some research on the quick recon-
Tang Wenyan(1962-), is currently a professor of
struction of the wireless networks under complicated
Communication Research Center Harbin Institute of
electromagnetic environments. *The corresponding
Technology, China. His research interests are in the
author Email: mcyang@hit.edu.cn
fields of Sensors and Signal Processing.

China Communications • September 2015 44