Professional Documents
Culture Documents
.
Fig.1. The System Model
The composite signal
i
x received by the
th
i sensor is
expressed as,
i
M
m
i d jk
m i
z e a x
m m
+ =
=
1
sin ) 1 ( |
L i s s 1 ) 1 (
where
m
a and
m
| represent the amplitude and DOA of the
th
m source impinging on the array,
m
k is the propagation
constant and c f k
m m m
/ 2 / 2 t t = = with
m
f
representing the frequency of the
th
m signal incident on the
array and
i
z is the AWGN added to the output of
th
i
sensor. Thus the parameters to be estimated for M incident
sources are expresses in a vector u
as,
where M is the number of active PUs and is also unknown
and has to be detected first.
The received signal vector X at the L-element ULA is
expressed as,
T
L L i
x x x x x X ] , ., ,......... ........., , [
1 2 1
=
where superscript T denotes the transpose.
Thus the problem in hand is to develop a novel technique for
two purposes, first detecting the number of active PU signals
impinging on ULA and second, performing joint estimation
of amplitude, DOA and frequency of the detected sources
considering the sensor array as reference. We also consider
the effect of variation in SNR on the detection and estimation
results. The fitness function can be expressed mathematically
as,
2
, , ,
min X X
f a M
g
|
) 2 (
where X
1 2 1
=
i
x is the estimated output at the i
th
sensor and is expressed
as,
=
=
g
m m
M
m
i d k j
m
i
e a x
1
sin ) 1 (
'
' '
'
|
L i s s 1
) 3 (
where
g
M is the number of sources randomly selected to
detect the possibly active PUs.
Thus the elements of the estimated vector ' u
obtained
through optimization algorithm are given by,
3 Proposed Algorithm for Detection
In this section, we give an overview of the procedural steps
carried out in GA optimization, parameter settings for GA
and hybrid scheme PS, and pseudo code for the proposed
algorithm. We solve the problem of detection first. To
achieve this purpose, we randomly select
g
M number of
sources in the estimated signal vector u'
and calculate mean
square error MSE given in eq. (2). The value of
g
M
is then
increased or decreased aiming to decrease the MSE in each
selection. This process is repeated until minimum mean
] ,......, , ,......, , ,......, [
1 1 1 M M M
f f a a | | u =
]
,......,
,......,
, ,......, [ '
1 1 1
g g g
M M M
f f a a | | u =
JOURNAL OF COMPUTING, VOLUME 5, ISSUE 2, FEBRUARY 2013, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 9
square error MMSE is obtained with
g
M corresponding to
MMSE indicating the number of active PUs. After detection
of the number of sources is done, we perform joint
estimation of amplitude, DOA and frequency of the detected
signals by further refining the MMSE. We solve our
optimization problem given in eq. (2) through Genetic
Algorithm (GA) hybridized with Pattern Search (PS). GA has
been widely used to solve optimization problems in
communication and array signal processing because of being
simple in concept, reliable, ease in implementation and with
less probability of getting stuck in local minima [22].
Efficiency, accuracy and reliability of GA can be
considerably improved by hybridization with any other
competent computational technique such as Interior Point
Algorithm (IPA), Pattern Search (PS) etc. In [23],
performance of GA, PS and Simulated Annealing (SA) is
compared with GA-PS and SA-PS in the joint estimation of
amplitude and DOA of multiple far-field sources incident on
L-type array considering Mean Square Error (MSE) as fitness
function.
The steps followed in GA-PS optimization are summarized
below.
______________________________________________________
Algorithm: GA hybridized with PS
______________________________________________________
Step (i): Initialization
Randomly generate P number of chromosomes
(potential solutions). Lower and upper bounds are
specified for the genes.
Step (ii): Fitness Function Evaluation
Fitness of each chromosome in the population is
computed using mean square error MSE derived
from Maximum Likelihood (ML) Principle as fitness
function and is given in eq (2). The chromosomes
are sorted on the basis of their fitness values.
Step (iii): Termination Criteria
The algorithm terminates if any of the following
two criteria are met, i.e. reaching the maximum
number of cycles or achieving the predefined fitness
value.
Step (iv): Create New Generations
Select the best chromosome depending on the value
of its fitness and create next generation by
employing mutation and crossover.
Step (v): Fine-Tuning via Local Search
The PS algorithm takes the best chromosome
obtained from GA as a starting point for further
improvement and refinement of results.
Step (vi): Storage:
Store the global best and to achieve better results
repeat the steps 2 to 5 for sufficient numbers of
iterations for better statistical analysis.
______________________________________________________
MATLAB optimization toolbox is used for this purpose and
parameter settings for GA and PS are shown in table 1.
Pseudo code of the proposed algorithm to solve the
detection and estimation problem is provided in table 2.
Table1. PARAMETER SETTINGS FOR GA-PS
GA PS
Parameters Settings Parameters Settings
Population
size
300 Start point Optimal values
from GA
No. of
generations
2000 Poll method GPS positive
basis 2N
Selection Stochastic
uniform
Polling order consecutive
Mutation
function
Adaptive
feasible
Maximum
iterations
1000
Crossover
function
Heuristic Maximum
function
evaluation
10000
Crossover
Fraction
0.2 Function
Tolerance
1e-18
Hybridization PS
No. of
generations
3000 Expansion
Factor
2.0
Function
Tolerance
1e-15 Contraction
Factor
2.5
Migration
Direction
Both Way Penalty Factor 100
Scaling
Function
Rank
Elite Count 8
JOURNAL OF COMPUTING, VOLUME 5, ISSUE 2, FEBRUARY 2013, ISSN (Online) 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 10
Table 2: PSEUDO CODE OF THE PROPOSED
ALGORITHM FOR DETECTION OF NUMBER OF
SOURCES
. 1 , , , : M m where f a d Inputs
m m m
s s |
M for guess a as M Choose
g
. 1
=
=
M
m
i d jk
m i
m m
e a x
1
sin ) 1 ( |
L i s s 1
. 2
=
=
g
m m
M
m
i d k j
m
i
e a x
1
sin ) 1 (
'
' '
'
|
L i s s 1
. 3 compute
2
0
g
M M
X X E =
Error Square Mean //
. 4 let
1 + =
g
new
g
M M
//
source one add
. 5 compute
=
=
new
g
m m
M
m
i d k j
m
i
e a x
1
sin ) 1 (
'
' '
'
|
L i s s 1
. 6 compute
2
'
0
new
g
M
M
X X E =
. 7 if ) (
0
'
0
E E <
. i
M of value possible a as M save and E E
new
g
'
0 0
=
. ii
new
g
M update
update last porting M M
new
g
new
g
sup 1 // =
. iii
new
g
M last of record keeping while to steps repeat 7 5
g increa starts MSE until acquired sin
else
. i 1 =
g
new
g
M M
. ii 7 5 to steps repeat
if end
min
0 0
. 8 E around E of values three atleast Observe
( ) 0 s/
g
M that g considerin directions both in
or increases M as E in increase ensure to
new
g 0
min
0
E to correspond which M around decreases
new
g
min
0
. . Re : E e i MMSE to correspond that M turn Output
new
g
4 SIMULATION RESUTS AND DISCUSSIONS
In this section, we evaluate the performance of our proposed
technique in terms of accuracy for two purposes, first, to
detect of number of far-field sources impinging on ULA, and
second, for joint estimation of amplitude, DOA and
frequency of the detected signals. Inter-element spacing in
the array is kept
4
min