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

Partial feedback for the discrete memoryless multiple access channel (Corresp.)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
31
0

Year Published

1989
1989
2015
2015

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(31 citation statements)
references
References 6 publications
0
31
0
Order By: Relevance
“…Firstly, due to the strict concavity of the logarithm, the subset relation in (20) is satisfied with strict inequality, provided p (1) (h) = p (2) (h) over a set of channel states with nonzero probability. Therefore, for any two corner points {R (1) 1 , R (1) 2 }, {R (2) 1 , R (2) 2 } on the boundary of R, arising from distinct power control policies, there exists a rate tuple strictly outside the line connecting these two points. Therefore, if there is to be a linear portion on R, it can only be due to a single power control policy, which in turn can only be the sum rate maximizing power control policy.…”
Section: Proofmentioning
confidence: 99%
“…Firstly, due to the strict concavity of the logarithm, the subset relation in (20) is satisfied with strict inequality, provided p (1) (h) = p (2) (h) over a set of channel states with nonzero probability. Therefore, for any two corner points {R (1) 1 , R (1) 2 }, {R (2) 1 , R (2) 2 } on the boundary of R, arising from distinct power control policies, there exists a rate tuple strictly outside the line connecting these two points. Therefore, if there is to be a linear portion on R, it can only be due to a single power control policy, which in turn can only be the sum rate maximizing power control policy.…”
Section: Proofmentioning
confidence: 99%
“…Moreover, we show that for noisy feedback the capacity region tends to Ozarow's perfect-feedback capacity region [9] as the feedback-noise variances tend to zero. Finally, in the case of perfect partial feedback we show that for certain channel parameters the capacity region strictly includes the Cover-Leung region [4], a region that was originally derived for the perfect-feedback setting and that was later shown by Carleial [2] and (for the discrete memoryless case) by Willems and van der Meulen [16] to be achievable also in the perfect partial-feedback setting. This answers in the negative the question posed by van der Meulen in [13] as to whether the Cover-Leung region equals the capacity region of the Gaussian MAC with perfect partial feedback.…”
Section: Introductionmentioning
confidence: 66%
“…To exploit the feed-forward, we shall use a block-Markov superposition strategy [17], [18] spanning adjacent blocks. The ideas of non-random binning and restricted encoding, introduced in [18], will be used in the proof. The blockMarkov coding scheme is described in detail below.…”
Section: Proof Of Theoremmentioning
confidence: 99%