2007
DOI: 10.1109/tcomm.2007.902567
|View full text |Cite
|
Sign up to set email alerts
|

Practical Implementation of Bit Loading Schemes for Multiantenna Multiuser Wireless OFDM Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
36
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 16 publications
(36 citation statements)
references
References 35 publications
0
36
0
Order By: Relevance
“…Let row(H k,n ) and null(H k,n ) denote the row space of H k,n and the nullspace ofH k,n , respectively. Then, V (1) k,n forms an orthogonal basis of row(H k,n ) andṼ (0) k,n forms an orthogonal basis of null(H k,n ). The distance between row(H k,n ) and null(H k,n ) is expected to be as small as possible to maximize the total throughput while suppressing interference at subcarrier n. Since the distance between two subspaces can be measured by their orthogonal projection and moreover, V (1) k,n V (1)H k,n andṼ (0) k,nṼ (0)H k,n are the orthogonal projection onto row(H k,n ) and null(H k,n ) respectively, we define the distance between row(H k,n ) and null(H k,n ) as…”
Section: Best-user-first Subcarrier-user Scheduling (Buf-sus) Based Omentioning
confidence: 99%
See 4 more Smart Citations
“…Let row(H k,n ) and null(H k,n ) denote the row space of H k,n and the nullspace ofH k,n , respectively. Then, V (1) k,n forms an orthogonal basis of row(H k,n ) andṼ (0) k,n forms an orthogonal basis of null(H k,n ). The distance between row(H k,n ) and null(H k,n ) is expected to be as small as possible to maximize the total throughput while suppressing interference at subcarrier n. Since the distance between two subspaces can be measured by their orthogonal projection and moreover, V (1) k,n V (1)H k,n andṼ (0) k,nṼ (0)H k,n are the orthogonal projection onto row(H k,n ) and null(H k,n ) respectively, we define the distance between row(H k,n ) and null(H k,n ) as…”
Section: Best-user-first Subcarrier-user Scheduling (Buf-sus) Based Omentioning
confidence: 99%
“…where L = min(L k,n ,L k,n ) withL k,n = rank(H k,n ), and (V (1) k,n ) L and (Ṽ (0) k,n ) L select the first L singular vectors from V (1) k,n andṼ (0) k,n , respectively. If L k,n =L k,n , the definition in (10) is precise; otherwise, some error will be incurred due to the truncation of signal subspace.…”
Section: Best-user-first Subcarrier-user Scheduling (Buf-sus) Based Omentioning
confidence: 99%
See 3 more Smart Citations