An achievable rate region and a capacity outer bound for 3‐user Gaussian multiple access channel with feedback
Summary Extension of the Ozarow capacity theorem for 2‐transmitter Gaussian multiple access channel (MAC) with feedback to the channels with more than 2 transmitters is a widely studied and long standing problem (for example, see the Kramer sum‐capacity region). In this paper, we investigate and ana...
Saved in:
Published in: | International journal of communication systems Vol. 31; no. 9 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
Chichester
Wiley Subscription Services, Inc
01-06-2018
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Summary
Extension of the Ozarow capacity theorem for 2‐transmitter Gaussian multiple access channel (MAC) with feedback to the channels with more than 2 transmitters is a widely studied and long standing problem (for example, see the Kramer sum‐capacity region). In this paper, we investigate and analyze this possible extension. Specifically, exploiting a class of Schalkwijk‐Kailath linear feedback codes, we obtain an achievable rate region for 3‐user Gaussian MAC with full feedback and also a capacity outer bound. Then the results are extended for a case where there is no feedback link for one user, and the corresponding achievable rate region and capacity outer bound are computed. Furthermore, the gap between the derived rates and the sum capacity of 3‐user Gaussian MAC with full and partial feedback is computed under special assumptions.
In this paper, we obtain an achievable rate region for 3‐user Gaussian MAC with full feedback and also a capacity outer bound. Then the results are extended for a case where there is no feedback link for one user, and the corresponding achievable rate region and capacity outer bound are computed. Furthermore, the gap between the derived rates and the sum capacity of 3‐user Gaussian MAC with full and partial feedback is computed under special assumptions. |
---|---|
ISSN: | 1074-5351 1099-1131 |
DOI: | 10.1002/dac.3550 |