Craw Alg Dds 024 v1-0

Algorithm Design Document
Document no.: CRAW_???_001 draft v0.1

Spectrum Sensing Algorithm
Design Document
Abstract: This document illustrates the algorithm design
for CRAWs spectrum sensing proect. This document
includes introduction! o"er"ie# of the sensing algorithms!
the co"ariance $ased sensing algorithm and the spectrum
$ased h%$rid detection algorithm for signal em$edded in
spurious and noise. Detailed descriptions on
implementation of the algorithms are included. Channel
selection filters are also attached in the appendi&.
Role Name Designation Signature
Owner 'eng (onghong Research )cientist
Reviewer 'hang Wei*iang
+e Tran ,huoc Cuong
)%ed -a"een Altaf
Ahmed
Research .anager
Research /fficer
)enior Research /fficer
Approver /h )er Wah ,roect .anager! CRAW
Revision 1.0 Date of Issue 1 Dec 0001
I
2
R Strictly Confidential
5
10
15
COPYRIGH NOIC!
Cop%right 2 0001 $% 3nstitute for 3nfocomm Research 43
0
R5! )ingapore. All rights reser"ed.
-o part of this pu$lication ma% $e reproduced! transmitted! transcri$ed! stored in a
retrie"al s%stem! or translated into an% language #ithout the #ritten permission of 3
0
R.
"ARNING
Chec6 document control s%stem for the latest "ersion $efore using or cop%ing.
R!#ISION HISORY
Revision Date Authors Comments Reasons for
Change
0.1 00 /CT 0001 (. 7.
'eng
1.0 1 D8C 0001 (. 7.
'eng
CONRI$%ORS
/h )er Wah
9ruce +e
'hang Wei*iang
I
2
R Strictly Confidential & of &'
5
10
15
D!(INIIONS) ACRONY*S + A$$R!#IAIONS
AA. A"erage Amplitude
ADC Analog to Digital Con"erter
CA: Co"ariance A$solute :alue
CRAW ,roect Code -ame! Research ,roect on W;RA-
<<T <ast <ourier Transform
3888 3nstitute of 8lectrical and 8lectronics 8ngineers
+RT +i6elihood Ratio Test
.< .atched <iltering
,)D ,o#er )pectrum Densit%
)7D )pectrum $ased 7%$rid Detection
T: Tele"ision
W;RA- Wireless Regional Area -et#or6
I
2
R Strictly Confidential , of &'
5
10
A$-! O( CON!N
COPYRIGHT NOTICE.....................................................................................................................................................2
WARNING..........................................................................................................................................................................2
REVISION HISTORY.......................................................................................................................................................2
CONTRIBUTORS..............................................................................................................................................................2
DEFINITIONS, ACRONYMS & ABBREVIATIONS....................................................................................................3
TABLE OF CONTENT......................................................................................................................................................4
1. INTRODUCTION.........................................................................................................................................................5
1.1. PURPOSE....................................................................................................................................................................5
1.2. SCOPE........................................................................................................................................................................5
1.3. REFERENCE DOCUMENTS..........................................................................................................................................5
2. OVERVIEW OF SENSING ALGORITHMS.............................................................................................................7
3. COVARIANCE BASED SENSING ALGORITHM...................................................................................................
4. IMPLEMENTATION OF THE CAV ALGORITHM...............................................................................................11
5. SPECTRUM BASED HYBRID DETECTION.........................................................................................................12
!. IMPLEMENTATION OF THE SHD ALGORITHM..............................................................................................15
7. APPENDI" 1# DIGITAL FILTERS...........................................................................................................................1!
. APPENDI" 2# MATLAB CODES.............................................................................................................................1$
I
2
R Strictly Confidential . of &'
5
10
15
/0 Intro1uction
This document descri$es the algorithm design for the CRAW spectrum sensing proect.
The main purpose for this proect is to detect the presence of R< signals in the :7<=>7<
$and.
/0/0 Purpose
The purpose of this document is to gi"e the details of sensing algorithms used in the
protot%ping of CRAW spectrum sensing s%stem.
The intended audiences are directors! department managers! proect managers! *ualit%
managers! scientists! engineers! partners! customers and an% other audiences #ho might
$e interested in this area.
/0&0 Scope
This document co"ers the algorithm design and implementation.
/0,0 Reference Documents
?1@ (onghong 'eng and (ing;Chang +iang! ACo"ariance $ased signal detections for
cogniti"e radioB! 3888 D%)pan! 000C.
?0@ (onghong 'eng and (ing;Chang +iang! A)imulations for #ireless microphone
detection $% eigen"alue and co"ariance $ased methodsB! 3888 100.00;0C=0D0Er0!
Ful% 000C.
I
2
R Strictly Confidential 2 of &'
5
10
15
20
25
30
?D@ (onghong 'eng and (ing;Chang +iang! A)pectrum sensing algorithms for cogniti"e
radio $ased on statistical co"ariancesB! 3888 Trans. :ehicular Technolog%! to
appear. http:==ar&i"0.li$rar%.cornell.edu=a$s=0101.0EG0"1
?H@ )er Wah /h! )%ed -a"een A. A.! (onghong 'eng! :. ,. Iumar! T. ,. C. +e! Iaren F.
.. Iua! and Wei*iang 'hang! AWhite;)pace )ensing De"ice for Detecting :acant
Channels in T: 9andsB! Cro#nCom! .a% 0001
?E@ CRAW_,RF_,DD_001 "0.D! /h )er Wah.
?G@ ADraft )tandard for Wireless Regional Area -et#or6s ,art 00: Cogniti"e Wireless
RA- .edium Access Control 4.AC5 and ,h%sical +a%er 4,7(55 specifications:
,olicies and procedure for operation in the T: $andsB! 3888 ,100.00 = D0.1! 3888
100.00 Wor6ing Jroup
?C@ ACRAW )%stem Re*uirement )pecification "0.CB
I
2
5
10
&0 Overview of sensing algorithms
)pectrum sensing is a fundamental tas6 for cogniti"e radio. 7o#e"er! there are se"eral
factors #hich ma6e spectrum sensing practicall% challenging. <irst! the signal to noise ratio
4)-R5 of the primar% users ma% $e "er% lo#. <or e&ample! the #ireless microphones
operating in T: $ands onl% transmit signals #ith a po#er of a$out E0mW and a $and#idth
of 000 67K. 3f the secondar% users are se"eral hundred meters a#a% from the microphone
de"ices! the recei"ed )-R ma% $e #ell $elo# ;00d9. )econdl%! multipath fading and time
dispersion of the #ireless channels ma6e the sensing pro$lem more difficult. .ultipath
fading ma% cause the signal po#er fluctuates as large as 00 ; D0d9. /n the other hand!
coherent detection ma% not $e possi$le #hen the time dispersed channel is un6no#n!
especiall% #hen the primar% users are legac% s%stems #hich do not cooperate #ith the
secondar% users. Thirdl%! the noise=interference le"el ma% change #ith time! #hich %ields
noise uncertaint%. There are t#o t%pes of noise uncertaint%: recei"er de"ice noise
uncertaint% and en"ironment noise uncertaint%. The recei"er de"ice noise uncertaint%
comes from: 4a5 non;linearit% of componentsL and 4$5 time;"ar%ing thermal noise in the
components. The en"ironment noise uncertaint% ma% $e caused $% transmissions of
other users! either unintentionall% or intentionall%. 9ecause of noise uncertaint%! in practice!
it is "er% difficult to o$tain the accurate noise po#er.
There ha"e $een se"eral sensing methods! including the li6elihood ratio test 4+RT5! energ%
detection method! matched filtering 4.<5;$ased method and c%clostationar% detection
method! each of #hich has different re*uirements and ad"antages=disad"antages.
Although +RT is pro"ed to $e optimal! it is "er% difficult to use it in practice! $ecause it
re*uires e&act channel information! and distri$utions of source signal and noise. 3n order
to use +RT for detection! #e need to o$tain the channels! and signal and noise
distri$utions first! #hich are practicall% intracta$le. .<;$ased method re*uires perfect
6no#ledge of the channel responses from the primar% user to the recei"er and accurate
s%nchroniKation 4other#ise its performance #ill $e reduced dramaticall%5. As mentioned
earlier! this ma% not $e possi$le if the primar% users do not cooperate #ith the secondar%
users. C%clostationar% detection method needs to 6no# the c%clic fre*uencies of the
primar% users! #hich ma% not $e realistic for man% of the spectrum reuse applications.
<urthermore! this method demands e&cessi"e analog to digital con"erter 4ADC5
I
2
5
10
15
20
25
30
35
re*uirement and signal processing capa$ilities. 8nerg% detection! unli6e the other t#o
methods! does not need an% information of the signal to $e detected and is ro$ust to
un6no#n dispersed channel and fading. 7o#e"er! energ% detection re*uires perfect
6no#ledge of noise po#er. Wrong estimation of the noise po#er leads to )-R #all and
high pro$a$ilit% of false alarm. As pointed out earlier! the estimated noise po#er could $e
*uite inaccurate due to noise uncertaint%. Thus! the main dra#$ac6 for the energ%
detection is its sensiti"eness to noise uncertaint%. <urthermore! #hile energ% detection is
optimal for detecting independent and identicall% distri$uted 4iid5 signal! it is not optimal for
detecting correlated signal! #hich is the case for most practical applications.
The performance of a sensing algorithm is generall% e"aluated $% t#o pro$a$ilities: the
pro$a$ilit% of detection and the pro$a$ilit% of false alarm. The pro$a$ilit% of detection is
defined as: pro$a$ilit% of the algorithm ha"ing detected the signal #hen signal is reall%
present! #hile the pro$a$ilit% of false alarm is defined as: pro$a$ilit% of the algorithm
ha"ing detected the signal #hen signal is actuall% not present. A good sensing algorithm
should ha"e high pro$a$ilit% of detection and lo# pro$a$ilit% of false alarm. As an e&ample!
according to the 3888 100.00 re*uirements! WRA- s%stems must $e a$le to detect DT:
signal of strength ;11G d9m at pro$a$ilit% of detection higher than M0 percent and
pro$a$ilit% of false alarm lo#er than 10 percent.
,0 Covariance 5ase1 sensing algorithm
+et
) (t y
$e the continuous time recei"ed signal at intermediate fre*uenc% 43<5 $and.
Assume that the channel $and#idth isW . We sample the recei"ed signal
) (t y
at a
sampling rate
s
f
. +et
s s
f T / 1 =
$e the sampling period. The recei"ed discrete signal is then
) ( ) (
s
nT y n x =
. There are t#o h%pothesiKes:
0
H
: signal not e&istsL and
1
H : signal e&ists.
The recei"ed signal samples under the t#o h%pothesiKes are therefore respecti"el% as
follo#s:
) ( ) ( :
0
n n x H =
) ( ) ( ) ( :
1
n n s n x H + = !
I
2
5
10
15
20
25
30
#here
) (n s
is the transmitted signal passed through a #ireless channel 4including fading
and multipath effect5! and
) (n
is the #hite noise samples. -ote that
) (n s
can $e the
superposition of multiple signals. The recei"ed signal is generall% passed through a
channel selection filter. +et
K k k f ,..., 1 , 0 ), ( =
$e the filter. After filtering! the recei"ed
signal is turned to
=
= =
K
k
n k n x k f n x
0
,... 1 , 0 ), ( ) ( ) (
~
+et
=
= =
K
k
n k n s k f n s
0
,... 1 , 0 ), ( ) ( ) (
~
=
= =
K
k
n k n k f n
0
,... 1 , 0 ), ( ) ( ) (
~

Then
) (
~
) (
~
:
0
n n x H =
) (
~
) (
~
) (
~
:
1
n n s n x H + =
-ote that here the noise samples
( ) n %
are correlated. 3f the sampling rate
s
f
is larger than
the signal $and#idth W ! #e can do#n;sample the signal. +et 1 M $e the do#n;sampling
factor. 3f the signal to $e detected has a narro#er $and#idth thanW ! it is $etter to choose
1 M > . <or notation simplicit%! #e still use
( ) x n %
to denote the recei"ed signal samples after
do#n;sampling! that is!
( ) ( ). x n x Mn = % %
Choose a smoothing factor L and define
1 ,..., 1 , 0 , ] ) 1 (
~
... ) 1 (
~
) (
~
[ ) ( = + =
s
T
N n L n x n x n x n %
A suggested "alue for L is around 10. Define a
( 1 ( 1) ) L K L M + +
matri& as
(0) ... ... ( ) 0 ... 0
0 ... (0) ... ( ) ... 0
... ...
0 ... ... ... (0) ... ( )
f f K
f f K
f f K

=

H
+et
H
HH G = . Decompose the matri& into
2
& G = ! #here & is a L L 7ermitian matri&.
The matri& G is not related to signal and noise and can $e computed offline. 3f analog filter
or $oth analog filter and digital filter are used! the matri& G should $e re"ised to include the
I
2
5
10
15
20
25
effects of all the filters. 3n general! Gcan $e o$tained to $e the co"ariance matri& of the
recei"ed signal! #hen the input signal is #hite noise onl% 4this can $e done in la$orator%
offline5. The matri& J and N are computed onl% once and onl% N is used in detection.
Denote the statistical co"ariance matri& of the recei"ed signal as
) ) ( ) ( E(
H
x
n n % % R =
Then
G R R
2
+ =
s x
#here
s
R
is the statistical co"ariance matri& of the signal 4including fading! multipath and
filtering5 and
2
is the noise "ariance.

Define
1 1
~

= & R & R
x x
1 1
~

= & R & R
s s
Then
I R R
2 ~ ~
+ =
s x
3f there is no signal! then 0
~
=
s
R . 7ence the off;diagonal elements of
x
R
~
are all Keros. 3f
signal presents!
s
R
~
is almost surel% not a diagonal matri&. 7ence! some of the off;diagonal
elements of
x
R
~
should not $e Keros. Denote the elements of the matri& $%
nm
r
.
+et
= =
=
L
n
nm
L
m
r
L
1 1
1
1
T
!
=
=
L
n
nn
r
L
1
2
1
T
Then if there is no signal!
2 1
T T = . 3f there is signal!
2 1
T T > . We o$tain a detection method
as follo#s.
Algorithm /8 he covariance a5solute value 9CA#: 1etection
Step /. )ample and filter the recei"ed signal as descri$ed a$o"e.
Step &0 Choose a smoothing factor L and compute the threshold
is chosen to meet
the re*uirement for the pro$a$ilit% of false alarm.
I
2
R Strictly Confidential /' of &'
5
10
15
20
25
30
Step ,0 Compute the auto;correlations of the recei"ed signal
=
= =
1
0
*
1 ,..., 1 , 0 ), (
~
) (
~
1
) (
s
N
m s
L l l m x m x
N
l
!
and form the sample co"ariance matri& as
*
* *
(0) (1) ... ( 1)
(1) (0) ... ( 2)
( )
( 1) ( 2) ... (0)
s
L
L
N
L L

=

R
M M M M
-ote that the sample co"ariance matri& is 7ermitian and ToeplitK.
Step .. Transform the sample co"ariance matri& to o$tain
1 1
) ( ) (
~

= & R & R
s s
N N
Step 20 Compute
= =
=
L
n
s nm
L
m
s
N r
L
N
1 1
1
) (
1
) ( T
=
=
L
n
s nn s
N r
L
N
1
2
) (
1
) ( T
#here
) (
s nm
N r
are the elements of the sample co"ariance matri&.
Step 30 Determine the presence of the signal $ased on
) ( T
1 s
N
!
) ( T
2 s
N
and the threshold: if
1 2
T ( ) /T ( )
s s
N N >
! signal e&istsL other#ise! signal not e&ists
<igure 1. <lo#;chart of the co"ariance a$solute "alue 4CA:5 detection
.0 Implementation of the CA# algorithm
I
2
R Strictly Confidential // of &'
Compute the
sample
co"ariance
matri& using
the collected
samples
Decision: if !
signal e&istsL
/ther#ise! signal not
e&ists.
Choose a
smoothing
factor and
the
threshold
Compute the a$solute
"alue sum of the
sample co"ariance
matri& and its diagonal
matri& to o$tain and
)ample
and filter
the
recei"ed
signal
Transform
the sample
co"ariance
matri&
5
10
15
20
25
/: he choice of channel selection filter
To ha"e a good adacent channel signal reection! the channel selection filter should
ha"e stop;$and attenuation as high as possi$le! prefera$l% higher than G0d9. <or the
current de"ice! 3< center fre*uenc% is E.E.7K and sampling rate is HM.E.7K. The filter
#ith $and#idth G.7K is chosen to ha"e D1C taps. The coefficients of the filter are
included in the appendi& 1.
<or AT)C DT: signal detection! a narro# $and filter centered at fre*uenc% 0.GM0G .7K
#ith $and#idth 100 I7K is used. The filter also has D1C taps. The coefficients 4after
truncation to 10 $its5 of the filter are also attached in appendi& 1.
&: Computation of the pre;whitening matri< =
Due to possi$l% un6no#n colored noise! the pre;#hitening matri& = used in Step . can
$e computed $ased on the auto;correlations of the output signal #hen the de"ice is
terminated. +et the auto;correlations at terminating case $e
1
*
0
1
( ) ( ) ( ), 0,1,..., 1
s
N
T
m s
l x m x m l l L
N
=
= =
% %
We form the co"ariance matri& as
*
* *
(0) (1) ... ( 1)
(1) (0) ... ( 2)
( 1) ( 2) ... (0)
T T T
T T T
T
T T T
L
L
L L

=

R
M M M M
Decompose the matri& into
2
T
= R & ! #here & is a L L 7ermitian matri&. That is! #e
get the pre;#hitening matri& = as the s*uare root of
T
R
. The matri& = can $e
computed offline once for all and stored.
,: hreshol1 setting
The threshold is set $ased on the re*uired pro$a$ilit% of false alarm at terminating
case. +et
fa
P
$e the re*uired pro$a$ilit% of false alarm. At terminating case! the CA:
method is used for I tests. To guarantee high relia$ilit%! the num$er of tests I should
$e large. +et the ratio
) ( T
1 s
N
=
) ( T
2 s
N

of test
i
$e
( ) i
. Reorder
( ) i
into
1
( ) i
#ith
descending order. Then the threshold is chosen as
I
2
R Strictly Confidential /& of &'
5
10
15
20
25
1
( )
fa
IP =
20 Spectrum 5ase1 h>5ri1 1etection
)ometimes the recei"ed signal ma% not onl% contain the desired signal and #hite noise!
$ut also some spurious signal and interference. The spurious signal ma% $e generated $%
Analog;to;Digital Con"erters 4ADC5 due to its non;linearit%. 3f the sensing antenna is near
some electronic de"ices! the spurious signal generated $% the de"ices can $e strong in
the recei"ed signal. We need signal processing techni*ues to handle the
spurious=interference.
There are t#o h%pothesises:
0
H
: signal not e&istsL and
1
H : signal e&ists. 3f there is
possi$le spurious signal! the recei"ed signal samples under the t#o h%pothesises are
therefore respecti"el% as follo#s:
0
1
: ( ) ( ) ( )
K
i
i
H x n n n
=
= +
1
1
: ( ) ( ) ( ) ( )
K
i
i
H x n s n n n
=
= + +
!
#here
) (n s
is the transmitted signal passed through a #ireless channel 4including fading
and multipath effect5!
( )
i
n
is a possi$le spurious signal and
) (n
is the #hite noise
samples. -ote that
) (n s
can $e the superposition of multiple signals. The spurious signal
( )
i
n
is normall% an e&tremel% narro#$and signal. .an% detection algorithms cannot
differentiate the transmitted signal
) (n s
and spurious signal
( )
i
n
. Therefore! these
algorithms #ill produce false alarm #hen spurious signal presents! that is! e"en if
interested signal does not presents! the algorithms #ill #rongl% report Asignal presentB due
to the interference of the spurious signals. To sol"e this pro$lem! #e propose a detection
algorithm $ased on po#er spectrum densit% or <<T of the recei"ed signal to identif%
interested signals from spurious and noise.
+et N $e the num$er of recei"ed signal samples. The signal samples are di"ided into
$loc6s of length M ! #here M is the <<T siKe. +et
( ) ( ), 0,1,..., / 1; 0,1,..., 1
m
x n x mM n m N M n M = + = =
I
2
R Strictly Confidential /, of &'
5
10
15
20
25
30
+et
( )
m
X k
$e the <<T of
( )
m
x n
! 0,1,..., 1 k M = . The ,)D of the recei"ed signal is defined
as
/ 1
2
0
( ) ( ) , 0,1,..., 1
N M
x m
m
n X n n M
=
= =
Alternati"el%! #e can also use the a"erage amplitude 4AA.5 defined as

/ 1
0
( ) ( ) , 0,1,..., 1
N M
x m
m
n X n n M
=
= =
<or #hite noise signal! the ,)D or the AA. should $e a constant for 0,1,..., 1 n M = . <or
a spurious signal! the ,)D or the AA. should $e constrained in J su$carriers onl%! #here
J is a parameter related to the <<T siKe M ! the channel $and#idth considered! and the
pro$a$ilit% of false alarm. <or interested signal! its ,)D or the AA. should $e spread into
more than J su$carriers.
Algorithm2: Spectrum based hybrid detection (SHD)
Step /. )ample and filter the recei"ed signal as descri$ed a$o"e.
Step &0 Di"ide the recei"ed signal samples into $loc6s of length M and compute the <<T
of each $loc6.
Step ,0 Compute the ,)D or the AA. as descri$ed a$o"e. ,re;#hiten the ,)D or the
AA. as follo#s
( ) ( ) / ( )
x x
n n n = W !
( ) ( ) / ( )
x x
n n n = W
#here
( ) n W
is the ,)D or the AA. for noise onl%.
Step .. Compute the mean "alue of the pre;#hitened ,)D or AA.! and define it as
mean
.
<ind all indices
n
such that
1
( )
x mean
n > or
1
( )
x mean
n >
#here
1
is a threshold #hich should $e set $ased on the re*uirement on pro$a$ilit% of

false alarm. +et the set of such indices $e ! #hich contains all possi$le signal indices.
Step 20 <or e"er% inde&
n
in! chec6 #hether
( )
x
n is a local pea6! i.e.!

( 1) ( )
x x
n n < and

( 1) ( )
x x
n n + < .
Step 30 <or e"er% local pea6 in Step 2! chec6 the "alues of the pre;#hitened ,)D or AA.
for the surrounding L points. 3f the standard de"iation 4)TD5 of the L points is smaller
than a threshold
2
! the inde& is identified as a signal inde&.

Step 40 3f there is at least one signal inde&! signal e&istsL other#ise! signal does not e&ist.
I
2
R Strictly Confidential /. of &'
5
10
15
20
25
30
35
40
The flo#;chart of the algorithm is gi"en in <igure 0.

<igure 0. <lo#;chart of spectrum $ased h%$rid detection
30 Implementation of the SHD algorithm
/: he choice of channel selection filter
The re*uirement on the filter is more stringent than that for the co"ariance $ased
algorithm: the filter should not onl% ha"e high stop;$and attenuation $ut also lo#
attenuation on the channel edges. To satisf% the t#o conditions! #e need to ha"e a filter
#ith larger num$er of taps. 3n current de"ice! the filter is chosen as the same as
descri$ed a$o"e.
05 Computation of the pre;whitening #ector
( ) n W
The pre;#hitening matri& W used in Step , can $e computed $ased on the ,)D or the
AA. of the output signal #hen the de"ice is terminated. +et the ,)D of the recei"ed
signal at terminating case $e
I
2
R Strictly Confidential /2 of &'
Compute the
,)D or AA. and
pre;#hiten the
,)D or AA.
Decision: if
there is at
least one
signal inde&!
signal e&istsL
other#ise!
signal does not
e&ist.
<or e"er% local pea6
inde&! chec6 the "alues
of the ,)D or AA. for
the surrounding points
and identif% it as a signal
inde& if the )TD of the
points is smaller than a
threshold.
)ample
and filter
the
recei"ed
signal
Compute the
mean of the
pre;#hitened
,)D or AA.!
and find the
possi$le signal
indices $%
comparing the
,)D or AA. to
the mean
Di"ide the
recei"ed
signal
samples into
$loc6s and
compute the
<<T of each
$loc6
<or e"er%
possi$le
signal
inde&!
chec6 if it
is a local
pea6.
5
10
15
20
/ 1
2
0
( ) ( ) , 0,1,..., 1
N M
T m
m
n X n n M
=
= =
Alternati"el%! #e can also use the AA. at terminating case defined as

/ 1
0
( ) ( ) , 0,1,..., 1
N M
T m
m
n X n n M
=
= =
The pre;#hitening "ector

( ) n W
is simpl% chosen as
( )
T
n
or
A ( )
T
n
. The "ector can $e
computed offline once for all and stored.
,: hreshol1 setting
The threshold
1
is set $ased on the re*uired pro$a$ilit% of false alarm at terminating

case. +et
fa
P
$e the re*uired pro$a$ilit% of false alarm. At terminating case! the
spurious detection method is used for I tests. To guarantee high relia$ilit%! the num$er
of tests
I
should $e large. +et the ratio
( ) /
x mean
n

of test
i
$e
( ) i
. Reorder
( ) i
into
1
( ) i
#ith descending order. Then the threshold
1
is chosen as
1 1
( )
fa
IP =
The threshold
2
is set $ased on the re*uired pro$a$ilit% of false alarm #hen $oth

spurious signal and noise present. +et
fa
P $e the re*uired pro$a$ilit% of false alarm.
The threshold
2
should $e chosen such that the pro$a$ilit% of decision Asignal presentB

is less than
fa
P .
40 Appen1i< /8 1igital filters
The coefficients of the filter #ith $and#idth G.7K are as follo#s 4centered at fre*uenc%
E.E .7K! after truncation to 10 $its5:
1 1 0 ;1 ;0 ;0 ;1 0 0 D 0 0 ;1 ;1 0 0 0
;1 ;0 ;0 0 1 1 0 0 0 1 0 0 0 ;1 ;1 0 0
0 ;0 ;D ;0 0 1 1 0 ;1 0 D H D 1 ;1 ;1 1
1 ;1 ;H ;E ;H ;1 1 1 ;1 ;0 1 E C E 1 ;1 0
D D ;1 ;C ;M ;G ;1 1 ;1 ;E ;H 0 M 11 C 1 ;1
I
2
5
10
15
20
25
D C G ;0 ;11 ;1D ;1 ;1 0 ;G ;11 ;1 D 1H 1E 1 1
0 11 1C 11 ;H ;1C ;11 ;1 0 ;E ;1C ;0E ;1E E 01 00 C
;1 M 01 DG 01 ;C ;0G ;00 ;H 0 ;1G ;HG ;EG ;D1 10 DH 0D
;D ;G D0 1H MM EH ;1C ;ED ;0H 01 1M ;MH ;0ED ;D0E ;00C 11 D1D
E11 D1D 11 ;00C ;D0E ;0ED ;MH 1M 01 ;0H ;ED ;1C EH MM 1H D0 ;G
;D 0D DH 10 ;D1 ;EG ;HG ;1G 0 ;H ;00 ;0G ;C 01 DG 01 M
;1 C 00 01 E ;1E ;0E ;1C ;E 0 ;1 ;11 ;1C ;H 11 1C 11
0 1 1 1E 1H D ;1 ;11 ;G 0 ;1 ;1 ;1D ;11 ;0 G C
D ;1 1 C 11 M 0 ;H ;E ;1 1 ;1 ;G ;M ;C ;1 D
D 0 ;1 1 E C E 1 ;0 ;1 1 1 ;1 ;H ;E ;H ;1
1 1 ;1 ;1 1 D H D 0 ;1 0 1 1 0 ;0 ;D ;0
0 0 0 ;1 ;1 0 0 0 1 0 0 0 1 1 0 ;0 ;0
;1 0 0 0 ;1 ;1 0 0 D 0 0 ;1 ;0 ;0 ;1 0 1
1
The coefficients of the filter #ith $and#idth 100I7K 4centered at fre*uenc% 0.GM0G
.7K! after truncation to 10 $its5 are as follo#s:
0GC 1EC 0C ;10C ;00M ;D0H ;DCM ;D11 ;DHM ;0GG ;1E0 ;1H 10H 0H1 DH0 DME
DMM DEH 0GH 1H0 1 ;1H1 ;0GC ;DG0 ;H0M ;H01 ;DEC ;0G1 ;1D0 1H 1EM 01E
DCC H0D H1C DEM 0EC 100 ;0M ;1CC ;D0H ;DMH ;HDG ;H0H ;DG0 ;0E1 ;110 HE
1ME D00 H10 HH1 HD0 DEM 0HH M1 ;G1 ;01D ;DH0 ;H0E ;HE1 ;HDE ;DEC ;0DG
;1H C1 0D0 DEC HDM HGC HD1 DEH 00G C0 ;MG ;0E0 ;DCH ;HE0 ;HCE ;HDM
;DHM ;01G ;EE 11D 0G1 DM0 HGH H10 HH0 DHD 00H DM ;1D1 ;01E ;H0E ;HCE
;H1C ;HD1 ;DDG ;1M1 ;0D 1HM D0D H1M H1E HM0 HDG D0C 1C1 G ;1GC ;D1M
;HDD ;HMD ;HMD ;HD1 ;D1C ;1GD 11 11H DDE HHE E00 HMD H0G D0G 1H1 ;0M
;000 ;DE0 ;HEG ;E0E ;HM0 ;H1M ;0MD ;1D0 HG 01M DGH HGE E0M HM0 H10 010
11E ;GH ;0DE ;DC1 ;HCH ;E11 ;H1G ;H01 ;0GG ;M1 11 0E1 DM0 H10 E11 H10
DM0 0E1 11 ;M1 ;0GG ;H01 ;H1G ;E11 ;HCH ;DC1 ;0DE ;GH 11E 010 H10 HM0
E0M HGE DGH 01M HG ;1D0 ;0MD ;H1M ;HM0 ;E0E ;HEG ;DE0 ;000 ;0M 1H1 D0G
H0G HMD E00 HHE DDE 11H 11 ;1GD ;D1C ;HD1 ;HMD ;HMD ;HDD ;D1M ;1GC G
1C1 D0C HDG HM0 H1E H1M D0D 1HM ;0D ;1M1 ;DDG ;HD1 ;H1C ;HCE ;H0E ;01E
;1D1 DM 00H DHD HH0 H10 HGH DM0 0G1 11D ;EE ;01G ;DHM ;HDM ;HCE ;HE0
;DCH ;0E0 ;MG C0 00G DEH HD1 HGC HDM DEC 0D0 C1 ;1H ;0DG ;DEC ;HDE
I
2
5
10
15
20
25
30
;HE1 ;H0E ;DH0 ;01D ;G1 M1 0HH DEM HD0 HH1 H10 D00 1ME HE ;110 ;0E1
;DG0 ;H0H ;HDG ;DMH ;D0H ;1CC ;0M 100 0EC DEM H1C H0D DCC 01E 1EM 1H
;1D0 ;0G1 ;DEC ;H01 ;H0M ;DG0 ;0GC ;1H1 1 1H0 0GH DEH DMM DME DH0 0H1
10H ;1H ;1E0 ;0GG ;DHM ;D11 ;DCM ;D0H ;00M ;10C 0C 1EC 0GC
60 Appen1i< &8 *atla5 co1es
The .atla$ code for the CA: algorithm is included in the follo#ing as an illustration to
the method.

OO .atla$ codes for the CA: algorithm
-)P0000L OO the num$er of s%m$ols generated
threPL OO input the threshold here
hfPL OO input filter here
+P10L OO the smooth factor
-TPD1CL OO the num$er of filter taps
OO The pre;#hitening matri& generation $ased on filter
R-1PKeros4+!-TQ+;15L
for nP1:+
R-14n!n:nQ-T;15PhfL
end
OO The pre;#hitening matri&
R-PR-1RR-1SL
RR-Ps*rtm4R-5L
RR-Pin"4RR-5L
OO 3nput the signal samples here
&1PL
OO <ilter the signal
&0PKeros4-)!15L
for nP1:-)
I
2
5
10
15
20
25
30
for 6P1:-T
if 4nQ1;65T0
&04n5P&04n5Qhf465R&14nQ1;65L
end
end
end
OO Compute the auto;correlation matri&
RPKeros4+!+5L
rtPKeros4+!15L
for nP1:-)
rtPrtQ&4n5SR&4n:;1:n;+Q15L
end
for nP1:+
for mPn:+
R4n!m5Prt4m;nQ15SL
R4m!n5Prt4m;nQ15L
end
end
RPR=-)L
OO Compute T1 and T0
T1Psum4sum4a$s4R555=+L
T0Psum4a$s4diag4R555=+L
OO Detection of signal
,dP0L OO if ,dP0! no signalL if ,dP1! signal presents
if T1TthreRT0L
,dP1L
end
I
2
5
10
15
20
25
30
End of Document
I
2
R Strictly Confidential &' of &'

Craw Alg Dds 024 v1-0

Caricato da

Informazioni sul documento

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Craw Alg Dds 024 v1-0

Caricato da

Copyright:

Formati disponibili

Algorithm Design Document

Document no.: CRAW_???_001 draft v0.1

is the noise "ariance.

Alternati"el%! #e can also use the a"erage amplitude 4AA.5 defined as

is a threshold #hich should $e set $ased on the re*uirement on pro$a$ilit% of

! the inde& is identified as a signal inde&.

Alternati"el%! #e can also use the AA. at terminating case defined as

The pre;#hitening "ector

is set $ased on the re*uired pro$a$ilit% of false alarm at terminating

is set $ased on the re*uired pro$a$ilit% of false alarm #hen $oth

should $e chosen such that the pro$a$ilit% of decision Asignal presentB

Potrebbero piacerti anche