This paper is a follow up to [1] on the two-user Gaussian Multiple Access Channel (MAC) with peak constraints at the transmitters. It is shown that there exist an infinite number of sum-rate-optimal points on the boundary of the capacity region. In contrast to the Gaussian MAC with power constraints, we verify that Time Division (TD) can not achieve any of the sumrate-optimal points in the Gaussian MAC with peak constraints. Using the so-called I-MMSE identity of Guo et.al, the largest achievable sum-rate by Orthogonal Code Division (OCD) is characterized where it is shown that Walsh-Hadamard spreading codes of length 2 are optimal. In the symmetric case where the peak constraints at both transmitters are similar, we verify that OCD can achieve a sum-rate that is strictly larger than the highest sum-rate achieved by TD. Finally, it is demonstrated that there are values for the maximum peak at the transmitters such that OCD can not achieve any of the sum-rate-optimal points on the boundary of the capacity region.
[1]
Shlomo Shamai,et al.
Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error
,
2010,
IEEE Transactions on Information Theory.
[2]
Kamyar Moshksar,et al.
On the sum-capacity of Gaussian MAC with peak constraint
,
2012,
2012 IEEE International Symposium on Information Theory Proceedings.
[3]
M. Raginsky,et al.
On the information capacity of Gaussian channels under small peak power constraints
,
2008,
2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[4]
Thomas M. Cover,et al.
Elements of Information Theory
,
2005
.
[5]
Shlomo Shamai,et al.
Mutual information and minimum mean-square error in Gaussian channels
,
2004,
IEEE Transactions on Information Theory.
[6]
Joel G. Smith,et al.
The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels
,
1971,
Inf. Control..