I'm on mobile and I don't know how to check the presence on the list.
I'm on mobile and I don't know how to check the presence on the list.
Is the extra freedom in choosing codebooks worth it?
How do we decode?
How do we pick good codebooks?
Can one actually implement this on real hardware?
What about multiuser scenarios?
Let me know if you want to know more.
10/n
n=10
Is the extra freedom in choosing codebooks worth it?
How do we decode?
How do we pick good codebooks?
Can one actually implement this on real hardware?
What about multiuser scenarios?
Let me know if you want to know more.
10/n
n=10
What have we gained?
1. H is completely irrelevant
2. codebooks live on much bigger space: the complex Grassmannian Gr(M, T)
9/n
What have we gained?
1. H is completely irrelevant
2. codebooks live on much bigger space: the complex Grassmannian Gr(M, T)
9/n
Y = HX + Z
where now Y and X are N×T and M×T matrices respectively.
We further assume M<T and H of max rank.
The crucial observation is that HX and X has the same row space.
8/n
Y = HX + Z
where now Y and X are N×T and M×T matrices respectively.
We further assume M<T and H of max rank.
The crucial observation is that HX and X has the same row space.
8/n
Is there a better way?
7/n
Is there a better way?
7/n
Do you see the problem?
6/n
Do you see the problem?
6/n
The way it currently works is we first estimate H by sending pilot signals known to both sides...
5/n
The way it currently works is we first estimate H by sending pilot signals known to both sides...
5/n
Turns out that adding more antennas has benefits that have to do with the fact that the high dimensional normal random vectors tend to concentrate on the sphere.
4/n
Turns out that adding more antennas has benefits that have to do with the fact that the high dimensional normal random vectors tend to concentrate on the sphere.
4/n
𝑦=𝐻𝑥+𝑍
where Z is iid complex Gaussian random vector...
3/n
𝑦=𝐻𝑥+𝑍
where Z is iid complex Gaussian random vector...
3/n
2/n
2/n