Abstract
In this paper, we first look at the achievable rate regions of the Gaussian Multiple Access Channel (G-MAC) and Gaussian Broadcast Channel (G-BC) when discrete constellations are transmitted. Focusing on the two-user case and assuming uncoded Pulse Amplitude Modulation (PAM), we show that the rate regions of G-MAC and G-BC can be improved by power conservation at the transmitter, a factor ignored in the earlier derived rate regions. We then further investigate duality between the G-MAC and the G-BC and show that a rate pair achieved in the G-MAC can be translated to a rate pair in the dual G-BC, such that the equal sum power constraint be satisfied. Due to the similarity of the rate expressions to Shannon’s capacity formula, for an appropriate choice of signal to noise ratio (SNR) gap, we show that when finite constellations are used for transmission, rate regions of these two channels also have a dual relationship (the known for Gaussian alphabets). The rate region of the G-BC can therefore be characterized from the rate region of the dual G-MAC and vice versa.
Similar content being viewed by others
References
Shannon, C. E. (1948). A mathematical theory of communications. Bell Systems Technical Journal, 27, 379–423. (part I) and 623–656 (part II).
Cioffi, J. M. (2011). EE379. Digital communication. Lecture notes. Stanford, CA: Stanford University.
Toumpakaris, D., & Lee, J. (2009). The gap approximation for Gaussian multiple access channels. In Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE, Nov 30 2009–Dec 4 2009 (pp. 1–6). IEEE.
Toumpakaris, D., & Lee, J. (2010). On the use of the gap approximation for the Gaussian broadcast channel. In Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE, 6–10 Dec 2010 (pp. 1–5). IEEE.
Ghaffar, R., Toumpakaris, D., & Lee, J. (2011). Achievable rates for transmission of discrete constellations over the Gaussian MAC channel. International Conference on ICT Convergence (ICTC), pp. 1–5.
Jindal, N., Vishwanath, S., & Goldsmith, A. (2004). On the duality of Gaussian multiple-access and broadcast channels. IEEE Transactions on Information Theory, 50(5), 768–783.
Cover, T. M., & Thomas, J. A. (2006). Elements of information theory. New Jersy: Wiley.
Gamal, A. E., & Kim, Y.-H. (2012). Network information theory. Cambridge University Press: Cambridge.
Rimoldi, B., & Urbanke, R. (1996). A rate-splitting approach to the Gaussian multiple-access channel. IEEE Transactions on Information Theory, 42(2), 364–375.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
We can rewrite the rate equations in G-MAC and G-BC as
We show that if
for all i, where
and
then \(\sum _{j=1}^{K}{P_j}^{mac}=\sum _{j=1}^{K}{P_j}^{bc}\). We do this by inductively showing that
For i = 1,
From (41)
So (43) becomes
We can generalize (45) for i users as shown in (46).
Assume that (46) holds for i users so for i + 1 case we have,
From (41), we can get the equation for \(B_{i+1}\) as
Substituting (48) in (47), we get
For all \(i>1\), \(\tilde{\Gamma }_{i,bc}\) is equal to one in high SNR regime. Thus \(\tilde{\Gamma }_{i+1,bc}\) will also equal to one, for \(i\ge 1\).
We can write \( A_i=P_{i+1} ^{mac}h_{i+1}\tilde{\Gamma }_{i+1,mac}+A_{i+1}\) from (40). But we know that the additional gap in the G-MAC is equal to one, for all \(i<K\). Till when \(i<K\), \(\tilde{\Gamma }_{i+1,mac}\) will be equal to one. Thus \(A_i\) could be written as \( A_i=h_{i+1}P_{i+1} ^{mac}+A_{i+1}\) then (50) becomes
We can replace \({A_i} \sum _{j=1}^{i}{P_j}^{bc}\) from (42) as
Substituting (52) in (51) we get
By using (42) for \(i=K\)
from (40)
The single user gap values for a given probability of error vary slightly with modulation scheme [3]. So, \(\tilde{\Gamma }_{1,bc}\sim \tilde{\Gamma }_{K,mac}\).
Rights and permissions
About this article
Cite this article
Rehman, I.A., Ghaffar, R. & Qaisar, S. Duality Between the Improved Rate Regions of Gaussian Multiple Access and Broadcast Channel for Discrete Constellations. Wireless Pers Commun 84, 2397–2415 (2015). https://doi.org/10.1007/s11277-015-2711-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-015-2711-9