2014
DOI: 10.1109/tit.2014.2307053
|View full text |Cite
|
Sign up to set email alerts
|

Linear Degrees of Freedom of the $X$-Channel With Delayed CSIT

Abstract: We establish the degrees of freedom of the two-user X-channel with delayed channel knowledge at transmitters (i.e., delayed CSIT), assuming linear coding strategies at the transmitters. We derive a new upper bound and characterize the linear degrees of freedom of this network to be 6 5 . The converse builds upon our development of a general lemma that shows that, if two distributed transmitters employ linear strategies, the ratio of the dimensions of received linear subspaces at the two receivers cannot exceed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
63
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 62 publications
(65 citation statements)
references
References 30 publications
2
63
0
Order By: Relevance
“…We restrict ourselves to linear coding strategies as defined in [13][14][15], in which DoF simply represents the dimension of the linear subspace of transmitted signals. More specifically, consider a communication scheme with blocklength T , in which Transmitter j wishes to transmit a vector u ij ∈ C m (T ) ij of m (T ) ij ∈ N information symbols to Receiver i.…”
Section: Problem Statement and Main Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…We restrict ourselves to linear coding strategies as defined in [13][14][15], in which DoF simply represents the dimension of the linear subspace of transmitted signals. More specifically, consider a communication scheme with blocklength T , in which Transmitter j wishes to transmit a vector u ij ∈ C m (T ) ij of m (T ) ij ∈ N information symbols to Receiver i.…”
Section: Problem Statement and Main Resultsmentioning
confidence: 99%
“…Satisfying (5) for all i, j ∈ {1, 2}, is also equivalent to satisfying the following conditions for all i, j ∈ {1, 2}, as proven in [14]:…”
Section: Problem Statement and Main Resultsmentioning
confidence: 99%
See 3 more Smart Citations