1 ezio biglieri (work done with marco lops) usc, september 20, 2006
TRANSCRIPT
![Page 1: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/1.jpg)
1
EZIO BIGLIERI(work done with Marco Lops)
USC, September 20, 2006
![Page 2: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/2.jpg)
2
Introduction
and motivatio
n
Introduction
and motivatio
n
![Page 3: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/3.jpg)
3
mobility &
wireless
(“La vie electrique,” ALBERT ROBIDA,
French illustrator, 1892).
![Page 4: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/4.jpg)
4
environment: static, deterministic
![Page 5: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/5.jpg)
5
environment: static, random
![Page 6: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/6.jpg)
6
environment: dynamic, random
![Page 7: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/7.jpg)
7
Static, random channel, 3 users: Classic ML vs. joint ML detection of data and # of interferers
![Page 8: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/8.jpg)
8
Static, random channel, 3 users: Joint ML detection of data and # of interferes vs. MAP
![Page 9: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/9.jpg)
9
MUD receivers must know the number of interferers, otherwise performance is impaired.
Introducing a priori information about the number of active users improves MUD performance and robustness.
A priori information may include activity factor.
A priori information may also include a model of users’ motion.
lesson learned
![Page 10: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/10.jpg)
10
Previous work (Mitra, Poor, Halford, Brandt-Pierce,…) focused on activity detection, addition of a single user.
It was recognized that certain detectors suffer from catastrophic error if a new user enter the system.
Wu, Chen (1998) advocate a two-step detection algorithm:
MUSIC algorithm estimates active users MUD is used on estimated number of users
previous work
![Page 11: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/11.jpg)
11
We advocate a single-step algorithm, based on random-set theory.
We develop Bayes recursions to model the evolution of the a posteriori pdf of users’ set.
in our work…
![Page 12: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/12.jpg)
12
Random set
theory
Random set
theory
![Page 13: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/13.jpg)
13
Description of multiuser systems A multiuser system is described by the random set
where k is the number of active interferers, and
xi are the state vectors of the individual interferers
(k=0 corresponds to no interferer)
random sets
![Page 14: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/14.jpg)
14
Description of multiuser systems Multiuser detection in a dynamic environment needs the densities
of the interferers’ set given the observations.
“Standard” probability theory cannot provide these.
random sets
![Page 15: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/15.jpg)
15
Random Set Theory RST is a probability theory of finite sets that
exhibit randomness not only in each element, but also in the number of elements
Active users and their parameters are elements of a finite random set, thus RST provides a natural approach to MUD in a dynamic environment
enter random set theory
![Page 16: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/16.jpg)
16
Random Set Theory
RST unifies in a single step two steps that would be taken separately without it:
Detection of active users Estimation of user parameters
random set theory
![Page 17: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/17.jpg)
17
What random sets can do for you
Random-set theory can be applied with only minimal (yet, nonzero) consideration of its theoretical foundations.
random set theory
![Page 18: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/18.jpg)
18
Random Set TheoryRecall definition of a random variable:A real RV is a map between the sample space and the real line
probability theory
![Page 19: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/19.jpg)
19
Random Set TheoryA probability measure on inducesa probability measure on the real line:
probability theory
AE
![Page 20: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/20.jpg)
20
Random Set TheoryWe define a density of X such that
The Radon-Nikodym derivative ofwith respect to the Lebesgue measureyields the density :
probability theory
![Page 21: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/21.jpg)
21
Random Set Theory
random set theory
Consider first a finite set:
A random set defined on U is a map
Collection of all subsets of U (“power set”)
![Page 22: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/22.jpg)
22
Random Set Theory
random set theory
More generally, given a set ,
a random set defined on is a map
Collection of closed subsets of
![Page 23: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/23.jpg)
23
Belief function (not a “measure”):
this is defined as
where C is a subset of an ordinary multiuser state space:
random set theory
![Page 24: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/24.jpg)
24
“Belief density” of a belief function
This is defined as the “set derivative” of the belief function (“generalized Radon-Nikodym derivative”).
Computation of set derivatives from its definition is impractical. A “toolbox” is available.
Can be used as MAP density in ordinary detection/estimation theory.
random set theory
![Page 25: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/25.jpg)
25
Example (finite sets)
random set theory
Assume belief function:
![Page 26: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/26.jpg)
26
Example (continued)
Set derivatives are given by the Moebius formula:
random set theory
![Page 27: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/27.jpg)
27
Example (continued)
For example:
random set theory
![Page 28: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/28.jpg)
28
Connections with Dempster-Shafer theory
random set theory
The belief of a set V is the probabilitythat X is contained in V :
(assign zero belief to the empty set: thus, D-S theory is a special case of RST)
![Page 29: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/29.jpg)
29
The plausibility of a set V is the probability that X intersects V:
random set theory
Connections with Dempster-Shafer theory
![Page 30: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/30.jpg)
30
belief plausibility
0 1
based onsupporting evidence
based onrefuting evidence
plausible --- either supportedby evidence, or unknown
uncertaintyinterval
random set theory
Connections with Dempster-Shafer theory
![Page 31: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/31.jpg)
31
Shafer: “Bayesian theory cannot distinguishbetween lack of belief and disbelief. It doesnot allow one to withhold belief from a proposition without according that belief to the negation of the proposition.”
random set theory
Connections with Dempster-Shafer theory
![Page 32: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/32.jpg)
32
random set theory
debate betweenfollowers anddetractors ofRST
![Page 33: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/33.jpg)
33
Finite random
sets
Finite random
sets
![Page 34: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/34.jpg)
34
Random finite set
We examine in particular the “finite random sets”
finite subset ofa hybrid space
with U finite
finite random sets
![Page 35: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/35.jpg)
35
Hybrid spaces Example:
a cb
finite random sets
![Page 36: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/36.jpg)
36
Hybrid spaces
Why hybrid spaces?
In multiuser application, each user state is described by d real numbers and one discrete parameter (user signature, user data).
The number of users may be 0, 1, 2,…,K
finite random sets
![Page 37: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/37.jpg)
37 Application:
cdma
Application:
cdma
![Page 38: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/38.jpg)
38
multiuser channel model
random set:users at time t
![Page 39: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/39.jpg)
39
Ingredients
Description of measurement process(the “channel”)
modeling the channel
![Page 40: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/40.jpg)
40
Ingredients
Evolution of random set with time (Markovian assumption)
modeling the environment
![Page 41: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/41.jpg)
41
Bayes filtering equations
Integrals are “set integrals” (the inverses of set derivatives) Closed form in the finite-set case Otherwise, use “particle filtering”
![Page 42: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/42.jpg)
42
MAP estimate of random set
MAP estimate of random set
(causal estimator)
![Page 43: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/43.jpg)
43
users surviving from time t-1
new usersrandom set:users at time t
multiuser dynamics
all potential users
new users
surviving users
users at time t-1
![Page 44: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/44.jpg)
44
CB
= probability of persistence
surviving users
![Page 45: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/45.jpg)
45
CB
= activity factor
new users
![Page 46: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/46.jpg)
46
surviving users + new users
Derive the belief density ofthrough the “generalized convolution”
![Page 47: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/47.jpg)
47
![Page 48: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/48.jpg)
48
detection and estimation
In addition to detecting the number of active users and their data, one may want to estimate their parameters (e.g., their power)
A Markov model of power evolution is needed
![Page 49: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/49.jpg)
49
effect of fading
![Page 50: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/50.jpg)
50
effect of motion
![Page 51: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/51.jpg)
51
joint effects
![Page 52: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/52.jpg)
52
pdf of for Rayleigh fading
![Page 53: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/53.jpg)
53 Application:
neighbor discovery
Application:
neighbor discovery
![Page 54: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/54.jpg)
54
In wireless networks, neighbor discovery (ND) is the detection of all neighbors with which a given reference node may communicate directly.
ND may be the first algorithm run in a network, and the basis of medium access, clustering, and routing algorithms.
neighbor discovery
![Page 55: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/55.jpg)
55
#1#2#3#4
receive interval of reference usertransmit interval of neighboring users
TD
T
neighbor discovery
Structure of a discovery session
![Page 56: 1 EZIO BIGLIERI (work done with Marco Lops) USC, September 20, 2006](https://reader030.vdocuments.us/reader030/viewer/2022032806/56649efc5503460f94c10062/html5/thumbnails/56.jpg)
56
neighbor discovery
Signal collected from all potential neighbors
during receiving slot t :
signature of user k
amplitude of user k=1 if user k is transmitting at t