Simple Antenna Diversity with inherit directional information for SDMA operation
description
Transcript of Simple Antenna Diversity with inherit directional information for SDMA operation
Simple Antenna Diversity with inherit directional information for SDMA
operation
Project group 997:Julien GonidecThibaut IngrainFrançois NetMauro PelosiAurélie Villemont
Supervisors: Patrick Eggers
Chenguang Lu
Censor: Jesper Ø. Nielsen
Jitter diversity simulation in a simplified environment
Steps of the simulation
Modelling a simplified indoor channel Generation of an ideal antenna pattern Jitter process description Results and tendencies
Monte-Carlo simulations
the user’s location is randomly defined at each step
Environment implementation (1)
Clustered scattering Investigations concentrated on rays from an unique cluster AOA power distribution approximated by a Laplacian
distribution PowerLaplace_a(θAOA)
Environment response
Where The amplitude is defined by
The phase is defined by
,, , . er AOAj xAOA er AOAer x x e
_
1
., . 1 ,
1 ,R
R Laplace a AOAk
er i AOAk i AOAkN
n AOAkn
N Px temp x
temp x
, 2 . 2 ,er AOA AOAx temp x
Environment implementation (2)
“a“ parameter controls the shape of the environment
10-6 < a < 10-1
BWenv: half-power width of the mean environment response
Simulation of various type of environment by varying the a parameter
Antenna pattern
Choice of an ideal beam pattern (no side and back lobes)
Amplitude of the pattern
“α“ parameter controls the antenna beamwidth
sin,
0AOA BO AOA BO
AOA BO
ifa
otherwise
Transfer function
At each realisation all beam’s orientation are performed
Discrete transfer function
Influence of the environment width on the fades
1
, , . ,AOAN
BO AOAn AOAn BOn
h x er x a
Jitter process
We want to compare 3 different algorithms: JRDA (Jitter with respect to the Reference Direction Algorithm) BPP (best possible process algorithm) FB (fixed beam algorithm) as a reference
Explanation of the JRDA process
1. Reference direction θrefk is found at the kth step
2. is compared to and
3. The orientation of the maximum value is chosen θpathk
4. is the whole the collected h module
,k refkh x ,k refk jitth x
,k refk jitth x
, pathh x