An Energy Detection Algorithm Based on

Double-threshold in Cognitive Radio Systems

Jinbo Wu, Tao Luo and Guangxin Yue
Laboratory of Wireless Communication Systems and Networks,
School of Information and Communication Engineering,
Beijing University of Posts and Telecommunications
Beijing China 100876
E mail: hyxwu@163.com, {tluo, gxyue}@bupt.edu.cn
AbstractBased on conventional single-threshold energy de-
tection algorithm, we put forward a double-threshold version
in cognitive radio system, and then, we analyze the detection
probability, false alarm probability, miss probability and their
relationships. For further research, we dene two parameters
for performance evaluation: the probability of collision between
the cognitive user and the primary user, and the probability
of spectrum unavailable to the cognitive user. Comparing to
the single-threshold energy detection algorithm, both analysis
and simulation results show that the proposed double-threshold
energy detection algorithm can make a lower collision probability
between the cognitive user and the primary user, despite a little
increasing of the spectrum unavailable probability.
Index TermsCognitive radio; energy detection; detection
threshold; spectrum selection
I. INTRODUCTION
According to the measurement of FCCs spectrum strategy
[1], the spectrums have not been employed efciently [2].
As a result, researchers put forward the cognitive radio [3].
In [3], the author presented the system architecture and key
challenges of cognitive radio; in [4], the author proposed vir-
tual non-authorized spectrum for dynamic spectrum allocation;
spectrum pool was brought forward to realize spectrum admin-
istration and allocation in [5]; the spectrums were managed
under the OFDM scenario in [6]. However, all of them make
use of single-threshold energy detection algorithm and only
a limited detection accuracy can be acquired, which directly
produce interference to the primary user.
Whats different in this paper, a novel double-threshold
detection algorithm is proposed. The collision probability
between the primary and cognitive users can be effectively
decreased at the cost of a little spectrum efciency drop.
The rest of this paper is organized as follows: the conven-
tional single-threshold energy detection algorithm is briey
introduced in section II. In section III, the novel double-
threshold energy detection algorithm is discussed and its
performance is analyzed and compared with the conventional
single-threshold case. Simulation is done in section IV and
conclusion is drawn in section V.
II. THE CONVENTIONAL SINGLE-THRESHOLD ENERGY
DETECTION ALGORITHM
Neyman-Pearson criterion [7] is always used in conventional
single-threshold energy detection algorithm. In Fig. 1a, there
is only single detection threshold. When the received signal
energy V is greater than the detection threshold V
th
, it is
concluded that the primary user presents, depicted as H
1
, on
the contrary, the primary user is not presented, depicted as H
0
.
Vth0 Vth1
Vth
E
E
Spectrum occupied Spectrum free
a) single-threshold
b) double-threshold
Spectrum free Spectrum occupied Not certain
Fig. 1. energy detection decision
We can work out the detection probability, false alarm
probability, and miss probability [8], respectively:
p
d
= Pr{V > V
th
| H
1
} = Q
u
(

2,

V
th
) (1)
p
f
= Pr{V > V
th
| H
0
} =
(u, V
th
/2
(u)
(2)
p
m
= Pr{V V
th
| H
1
} (3)
Where is the SNR(Signal-Noise Ratio) received by cogni-
tive user, V
th
is the detection threshold, Q
u
(a, b)is normalized
Marcum function with the order u, and monotone increasing
function with u, a, monotone decreasing with b; (a, b) is a
non-complete gamma function, and monotone decreasing with
b; (a) is complete gamma function. From (2):
p
f
(u) = (u, V
th
/2)
Based on the denition of non-complete and complete gamma
function:
(u, V
th
/2) =

V
th
/2
t
u1
e
t
dt
=

0
V
th
/2
t
u1
e
t
dt+

0
t
u1
e
t
dt
= (u)

V
th
/2
0
t
u1
e
t
dt
from [9], it has

V
th
/2
0
t
u1
e
t
dt = (u)p(u, V
th
/2)
The 1st International Conference on Information Science and Engineering (ICISE2009)
978-0-7695-3887-7/09/$26.00 2009 IEEE 493
where z = p(u, x) =
1
(u)
is low order non-complete gamma
function, and monotone decreasing with x, what is more, x =
p
1
(u, z) is monotone increasing function with z.
And then, it has:
p
f
(u) = (u) (u) (u, V
th
/2)
p
f
= 1 p(u, V
th
/2)
V
th
= 2p
1
(u, 1 p
f
)
Substituting V
th
into equation (1) and (3):
p
d
= Q
u
(

2,

V
th
) = Q
u
(

2,

2 p
1
(u, 1 p
f
))
(4)
p
m
= 1 p
d
= 1 Q
u
(

2,

2 p
1
(u, 1 p
f
)) (5)
III. DOUBLE-THRESHOLD ENERGY DETECTION
ALGORITHM
In section II, we have shown that single-threshold en-
ergy detection algorithm maybe cause serious interference to
the primary user. In order to alleviate them we propose a
double-threshold energy detection algorithm shown in Fig. 1b.
We add another detection threshold within the conventional
single-threshold energy detection algorithm, and it becomes a
double-threshold energy detection algorithm with two detec-
tion thresholds (V
th0
and V
th1
).
Obviously, the primary user will be detected if and only if
V > V
th1
, and will not be presented if and only if V < V
th0
,
corresponding to H
1
and H
0
, respectively. When the detected
energy V is in (V
th0
, V
th1
], this result is invalid because of
easy to mistaken. It needs re-detection. Then the cognitive user
can select the spectrums as g.2.
received detection value
detection
decision
H1
H0
Vth0<V<Vth1
V<Vth0 V>Vth1
after an
interval
Fig. 2. energy detection process
A. Double-threshold energy detection performance indicator
From what we have discussed, we can calculate the per-
formance indicator of the double-threshold energy detection
algorithm, such as the detection probability, false alarm prob-
ability and missing probability:
p

d
= Pr{V

> V
th1
| H
1
} = Q
u

V
th1

(6)
p

f
= Pr{V

> V
th1
| H
0
} =
(u

, V
th1
/2)
(u

)
(7)
p

m
= Pr{V

V
th1
|H
1
}
= 1 p

d
(8)
Where p

d
is the correct detection probability when the
primary user presents. p

f
is the probability of the primary user
detected presently, but in fact it does not present. p

m
is the
probability of the primary user perhaps may not be detected,
but in fact it does present.
In order to analyze our algorithm deeply, two denitions are
given:
Denition 1: the probability of collision between the cog-
nitive user and the primary user: p
c
= p{V

< V
th0
| H
1
}. It
is the probability of the primary user which is not detected,
but in fact it is existed, and this unoccupied spectrum will be
allocated to the cognitive user. It indicates the interference of
the cognitive user to the primary user because of the uncer-
tainty of the spectrum detection. The larger the probability of
collision between the primary user and the cognitive user is,
the more serious the interference of the cognitive user to the
primary user is, on the contrary, there is less interference.
Denition 2: the probability of restricting the cognitive user
to use spectrum, that is, the spectrum unavailable probability:
p
na
= p{V

> V
th0
| H
0
}. It is the probability of the primary
user maybe be detected, while in fact it is not present, and
this busy spectrum should not be allocated to the cognitive
user in order to avoid interfering the primary user. It indicates
the efciency of the spectrum usage, that is, whether there are
enough spectrums for the cognitive user to access the system
timely. The larger the spectrum unavailable probability is, the
less efciency of the spectrum usage is. On the contrary, the
spectrum is allocated efciently.
B. Double-threshold energy detection performance analysis
Generally, it has V
th0
< V
th
< V
th1
because of adding
detection threshold. Form section II and Eq. (1) (6), we can
get:
Q
u
(

V
th1
) < Q
u
(

2,

V
th
)
that is: p

d
< p
d
We can also get:
p

m
> p
m
p

f
< p
f
Although there have a little bit inferior in double-threshold
energy detection algorithm, in fact, the focuses in cognitive
radio system are that the interference of the cognitive user
to the primary user is below the interference temperature,
and the spectrum efciency is good, so we focus on the
anti-jamming performance and the spectrum efciency in the
double-threshold energy detection algorithm.
It is clear that in the conventional single-threshold energy
detection algorithm the probability of collision between the
cognitive user and the primary user is also the miss probability,
494
p
c1
= p
m
and the spectrum unavailable probability is also the
false alarm probability, p
na1
= p
f
.
From above, we can calculate the probability of collision
between the cognitive user and the primary user, the spectrum
unavailable probability:
The collision probability:
p
c2
= Pr{V

< V
th0
| H
1
}
= 1 Pr{V

> V
th0
| H
1
}
= 1 Q
u
(

V
th0
) (9)
The spectrum unavailable probability:
p
na2
= Pr{V

> V
th0
| H
0
}
=
(u

, V
th0
/2
(u

)
(10)
Comparing formula (3) and (9), and from section II:
V
th0
< V
th
Q
u
(

2,

V
th
) < Q
u
(

V
th0
)
p
c2
< p
c1
We also can get: p
na1
< p
na2
. it can be concluded that
the probability of collision between the cognitive user and
the primary user can be decreased effectively, avoiding the
cognitive user interfering the primary user. At the same time,
this algorithm decreases a little bit spectrum used efciency.
In other words, there is still a possibility to improve the
spectrums used efciency.
IV. SIMULATION
In this section we verify what we have discussed just now
through simulation. Simulation parameters are assuming as
follows: the noise power
2
= 1, the degree of freedom:
u = u

= 5, SNR (Signal-to-Noise Ratio): =

= 10dB,
detection threshold: V
th0
= 0.8V
th
, V
th1
= 1.2V
th
.
5 10 15 20
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
V
th
/ dB
P
c

/

1
0
0
%
singlethteshold detection
doublethreshold detection
Fig. 3. collision probability vs. detection threshold
In Fig.2 we plot the probability of collision between the cog-
nitive user and the primary user, changing with the different
5 10 15 20
0
0.005
0.01
0.015
0.02
0.025
0.03
0.035
0.04
0.045
V
th
/ dB
P
n
a



/

1
0
0
%
singlethteshold detection
doublethreshold detection
Fig. 4. spectrum unavailable vs. detection threshold
detection threshold comparing to the single-threshold energy
detection algorithm. And the spectrum probability changing
with the different detection threshold is plotted in Fig.3
corresponding to single- and double-threshold energy detection
algorithm. From Fig.2, our algorithm decreases the probability
of collision between the cognitive user and the primary user
comparing to the single-threshold detection algorithm. For
example, V
th
= 10dB, the collision probability decreases
from 32.31% to 8.914%; from Fig.3 our algorithm increases
a little the spectrum unavailable probability, for instance,
V
th
= 10dB,the spectrum unavailable probability increases
from 2.331% to 3.57%, It decreases the spectrum efciency.
From analysis and simulation results, it can be concluded
that double-threshold energy detection algorithm can decrease
the probability of collision between the cognitive user and
the primary user, decreasing the interference of the cognitive
user to the primary user with sacricing a little bit spectrum
efciency.
30 25 20 15 10 5 0 5 10
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
SNR(dB)
P
c
doublethreshold detection
singlethreshold detection
Fig. 5. the collision probability vs. SNR
In order to verify deeply, we give out Monte-Carlo sim-
495
30 25 20 15 10 5 0 5 10
0.2
0.25
0.3
0.35
0.4
0.45
0.5
SNR(dB)
P
n
a
doublethreshold detection
singlethreshold detection
Fig. 6. the probability of spectrum unavailable vs. SNR
ulation, we use 5000 signals, the probability of spectrum
occupied by the primary user is 50%. We plot the probability
of collision between the cognitive user and the primary user
and the probability of spectrum unavailable where the SNR
(signal-to-noise) is in the range of -30 10dB, respectively.
In Fig.5 the performance of energy detection algorithm is
not good when the SNR is very low; this causes that the
probability of collision between the cognitive user and the
primary user is high. But our algorithm still can decrease the
collision probability even when the SNR is very low, and it
can be improved about 5% within -30 -10dB. In Fig. 6 the
probability of spectrum unavailable increases a little bit in our
algorithm, that is, the spectrum efciency is decreased a little.
From above, double-threshold energy detection algorithm
can decrease the probability of collision between the cognitive
user and the primary user, and decrease the interference to the
primary with sacricing a little spectrum efciency.
V. CONCLUSION
In order to optimize the single-threshold energy detection
algorithm, we propose the double-threshold energy detection
algorithm through adding the number of detection thresholds.
By analyzing the performance of the double-threshold energy
detection algorithm, comparing to the single-threshold one,
we can get the conclusion that the double-threshold energy
detection algorithm can decrease effectively the collision prob-
ability between the cognitive user and the primary user, and
decrease the interference of the cognitive user to the primary
user, At the same time, this algorithm decrease a little bit
spectrum efciency. How to deal with the detected energy
falling between the two detection thresholds in detail is our
future work.
ACKNOWLEDGMENT
This work was funded by NSFC under Grant 60872049
and 60871042, 863 Program of China under Grant
2007AA10Z235, and Teaching and Research Finances for the
Returned Overseas Chinese Scholars.
REFERENCES
[1] DA96-1704 137 MHz to 100 GHz 1996.10.16 Spectrum inventory table
Federal Communications Commission Washington, DC.
[2] Daniel Willkomm, James Gross and Adam Wolisz. Reliable Link
Maintenance in Cognitive Radio Systems New Frontiers in Dynamic
Spectrum Access Networks, 2005. DySPAN 2005. IEEE International
Symposium on 8-11 Nov. 2005 Page(s):371 - 378.
[3] I. Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran. Next genera-
tion/dynamic spectrum access/cognitive radio wireless networks: A sur-
vey Computer Networks 50 (2006) 2127 - 159.
[4] Danijela Cabric, Shridhar Mubaraq Mishra, Daniel Willkomm. A Cogni-
tive Radio Approach for Usage of Virtual Unlicensed Spectrum In Proc.
of 14th IST Mobile Wireless Communications Summit 2005, Dresden,
Germany, June 2005: 231-236.
[5] Timo a. weiss and friedrich k. jondral, Universitat karlsruhe Spectrum
Pooling: An Innovative Strategy for the Enhancement of Spectrum
Efciency IEEE Radio Communications, March 2004:125-132.
[6] Timo Weiss, Loerg Hillenbrand, Albert Krohn. Mutual Interference in
OFDM-based Spectrum Pooling Systems Vehicular Technology Confer-
ence, 2004. VTC 2004-Spring. 2004 IEEE 59th Volume 4, 17-19 May
2004 Page(s):1873 - 1877.
[7] Mourad Barkat. Signal Detection And Estimation (2nd edition) Artech
House Publishers 2005.
[8] Harry Urkowitz. Energy Detection of Unknown Deterministic Signals
proceedings of the IEEE, vol. 55, no. 4, April 1967 P.523-531.
[9] Chunhua Sun, Wei Zhang, and Khaled Ben Letaief. Cooperative Spec-
trum Sensing for Cognitive Radios under Bandwidth Constraints IEEE
Communications Society subject matter experts for publication in the
WCNC 2007 process
496