SPECTRUM

SENSING
FOR COGNITIVE RADIO
APPLICATIONS
YAHIA TACHWALI PH.D.

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

COGNITIVE RADIO

COGNITIVE RADIO

WHY
HOW

CR SCENARIO

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

SPECTRUM SENSING
Power

Spectrum Hole

Frequency

Spectrum occupied
by Licensed users

Time

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

SPECTRUM SENSING BASICS

Dynamic Range
+
Resolution
Sampling rate

SPECTRUM SENSING BASICS

Dynamic Range
+
Resolution
Sampling rate
Sampling rate > 2 * Bandwidth (Nyquist theory)
Dynamic Range (dB) ~ 6 * N ( N is the # bits
resolution)
Effective number of bits ENOB = (SINAD 1.76)/6.02

How many samples do I need?

ROC CURVES

We want the two bell curved as apart as possible:

Higher SNR
More samples

SNR WALL

* R. Tandra and A. Sahai, SNR walls for signal detection, IEEE Journal on Selected
Topics in Signal Processing, IEEE Inc., vol.2, pp.4-17, 2008

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

x()sTt)dY

1o
t0 H

DETECTION ... KNOWN SIGNAL

MATCH FILTER

Device
Matched FilterSample at t =Threshold
T
Received Signal
x(t) = s(t) + n(t)

x(t)

s(t)
0

Decide
H0 or H1

maximum at T

T
0

2T

s(t): Transmitted signal of the

PU
n(t): AWGN
T: Symbol interval
: Detection threshold

T 2T

Need
Transmitted signal information s(t)
Tx-Rx synchronization for sampling
at t=T

DETECTION UNKNOWN SIGNAL

ENERGY DETECTOR

How do we know the signal is

noise or real signal?

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

(t)

CYCLOSTATIONARY FEATURE
DETECTION
Correlate
R(f+ )R*(f- )

Average
over T

Feature
detect

Decide
H0 or H1

r(t) : Received signal

R(f) : Fourier transform of r(t)
: Cyclic frequency
R*(f) : Complex conjugate of R(f)

If cyclostationary with
period T cycle
autocorrelation has
component at =1/T.
18

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

COMPRESSIVE SENSING OVERVIEW

Why: Cost of ADC, sensor, computations
Assumptions: Coherency and Sparsity
Techniques:

CS Type1: Optimization solving e.g. L1 Minimization

CS Type 2: Iterative methods e.g. Fast Fourier
Sampling (FFS)

N
SensingCompressed Sensing
Compress

Receive

De-Compress

K
N

Transmit

K << N

CONVENTIONAL SAMPLING

(Wideband Sensing),
This sampling method is expensive:

For Sensing Large Range of Spectrum

High Sampling Rate Requirement (expensive ADC circuit)

Large Number of Samples ( High Computational Cost)
Example: To sense 1 GHz of spectrum at 1 KHz resolution, we need 1
Million samples acquired at 2 GHz sampling rate

COMPRESSIVE SAMPLING

The recovery technique searches for a sparse spectrum (or the sparsest) that has
The closest time representation

WHY L1 NORM MINIMIZATION

CS TYPE 1: OPTIMIZATION SOLVING

0 0 1 0 0 0 0 0

0 0 0 0 1 0 0 0
0 0 0 0 0 0 0 1

Sampling Matrix (A)

Received Signal x(t)

=
Compressed
Samples
y(t)

How to recover
x(t) from few
samples y(t)?

Ax=y is underdetermined system, we know one property of

the solution x(t) X(f) is sparse
Sparsity can be measured by ||X(f)||0 (number of nonzero element in
X(f) ) OR ||X(f)||1 (sum of X(f) elements)

CS TYPE 1: OPTIMIZATION

Compressed
Samples
y(t)

Compare measured
samples y(t)with
estimated samples .

Set of possible
solutions in
SOLVING
frequency domain
X^(f)

Search for the

sparsest solution X(f)
Min ||X(f)||1

Repeat if the
difference is
high

IFFT

Sampling Matrix (A)

0 0 1 0 0 0 0 0

=0

0 0 0 0 1 0 0 0
0 0 0 0 0 0 1

Set of possible
solutions in time
domain
X^(t)

0.1
6
0

CS TYPE 2: ITERATIVE METHOD

-0.1

2
0

50

100

150

12

-0.2

50

100

150

50

100

150

50

100

150

0.3

10

0.2

0.1

6
0

-0.1

2
0

50

100

150

12

-0.2
0.3

10

0.2

0.1

6
0

-0.1

2
0

1
x t
N

50

ak e
12

100

2i k t / N

10

k 1
6
4

-0.2

1
~
x t
N
0.3
0.2
0.1
0

a e
k 1

2i k t / N

COMPLEXITY
-0.1

2
0

150

50

N . Log ( N )

100

150

-0.2

50

100

150

m . poly( -1 , log ( -1) , log( N ) )

CS TYPE 2: ITERATIVE METHOD

27/

12

200

10
8

150

6
4

100

2
0

50

0
0

-2
0

50
100
Frequency Index

50

150
12

100

150

150

10

100

200

-2

20

40

60

80

100

120

140

50

150

0
0
100

50
100
Frequency Index

150

50

0
0

11/8/16

50
100
Frequency Index

Coefficient Estimation

150

Bit Testing

19 50 88 122

CS TYPE 2: ITERATIVE METHOD

Even Frequenci Filters

b=0

b=0

0.5
0

b=1

b=1

0.5
0

b=2

b=2

0.5

40

50

60

1
b=3

b=3

30

0.5
0

1/8
2/8
3/8
4/8
5/8
6/8
Normalized Frequency ( rad/sample)

7/8

0.5
0

1/8
2/8
3/8
4/8
5/8
6/8
Normalized Frequency ( rad/sample)

dd

f il
te

Filter Bank
fil

te
r

Sample
Shattering

Bit testing

Ev
en

Random
Sampling

0.5
0

20

0.5
0

10

0.5
0

Received
Signal

Odd Frequencies Filter

w1

1 0 0 1 0 0 1 0 0 0 1 1 0 0 0 1

w2

0 0 1 1 0 0 0 1 1 0 0 1 0 0 1 0

w8

1 0 0 0 1 1 0 0 1 1 0 0 0 1 1 1

7/8

CS TYPE 2: ITERATIVE METHOD

1

0.5

-0.5

10

12

Even

-1
-2
-3
-4
0

10

-0.5

-1
0

12

10

12

4
3
2
1
0

Odd

-1
-2
-3
-4
0

Probability
density
function of a
noisy
sinusoidal
signal
random
sample

10

12

2 = 1
2 = 0.01

2 = 0.0001

1.5

0.5

0
-3

11/8/16

2.5

pdfY(x)

-1
0

0.5

-2

-1

0
X

3
2
1
0
-1
-2
-3
-4
0

10

12

SFFT ... SPARSE FFT

OUTLINES
COGNITIVE RADIO
SPECTRUM SENSING
BASICS
DETECTION
CLASSIFICATION
COMPRESSED SENSING
CONCLUSION

Questions
y.tachwali@gmail.com
www.yahiatachwali.com