Abstract
Maximization the capacity region of Gaussian multiple access channels with vector inputs and vector outputs has been extensively studied in existing schemes. Although these schemes are proven effective in various real-life applications, they are inapplicable to deal with channels with matrix variables subjected to certain constraints. In this work, we present a new framework to estimate the capacity region of Gaussian multiple access channels with matrix inputs and outputs under weighted total power constraints. We propose an optimization model to address this issue and prove its concavity. By introducing an I-chain rule for matrix differentiation, the gradient of the objective function involving matrix variables can be obtained. An algorithm, named normalized projected gradient method (NPGM) is developed to find the global optimal solution for the proposed model. The convergence of NPGM is established by utilizing projection and normalization operators. Simulation results provide an interesting insight that NPGM can manage the existent situations within an unified framework, and provide a novel universal technical solution to optimize the capacity region under weighted total power constraints.






Similar content being viewed by others
References
Abadir KM, Magnus JR (2005) Matrix algebra, vol. 1. Cambridge University Press
Ahlswede R (1974) The capacity region of a channel with two senders and two receivers. Ann Probab 29 (5):805–814
Barnes RJ (2006) Matrix differentiation. Springs Journal
Basher U, Shirazi A, Permuter HH (2012) Capacity region of finite state multiple-access channels with delayed state information at the transmitters. IEEE Trans Inf Theory 58(6):3430–3452
Cheng RS, Verdú S (1993) Gaussian multiaccess channels with ISI: capacity region and multiuser water-filling. IEEE Trans Inf Theory 39(3):773–785
Cover TM, Leung CSK (1981) An achievable rate region for the multiple-access channel with feedback. IEEE Trans Inf Theory 27(3):292–298
Harshan J, Rajan BS (2008) Finite signal-set capacity of two-user Gaussian multiple access channel. In: IEEE International symposium on information theory, pp 1203–1207
den Hertog D, Roos K (2009) Computing safe dike heights at minimal costs. Tech. rep., centER Applied Research Report Tilburg University
Huang Q, Yang H (2013) Optimal power control for weighted sum rate of multiple access channel. Int J Digit Cont Tec App 7(5):247–254
Hui JYH, Humblet PA (1985) The capacity region of the totally asynchronous multiple-access channel. IEEE Trans Inf Theory 31(2):207–216
Jindal N, Vishwanath S, Goldsmith A (2004) On the duality of gaussian multiple-access and broadcast channels. IEEE Trans Inf Theory 50(5):768–783
Li G, Ding J, Wen C, Pei J (2016) Optimal control of complex networks based on matrix differentiation. EPL Europhysics Letters 115(6):68,005
Li G, Hu W, Xiao G, Deng L, Tang P, Pei J, Shi L (2016) Minimum-cost control of complex networks. New J Phys 18(1): 1–3
Liu R, Poor HV (2009) Secrecy capacity region of a multiple-antenna Gaussian broadcast channel with confidential messages. IEEE Trans Inf Theory 55(3):1235–1249
Magnus JR, Neudecker H (1995) Matrix differential calculus with applications in statistics and econometrics
Petersen KB, Pedersen MS (2012) The matrix cookbook. Tech rep
Sankar L, Mandayam NB, Poor HV (2009) On the sum-capacity of degraded Gaussian multiple-access relay channels. IEEE Trans Inf Theory 55(12):5394–5411
Shi Y, Hou YT (2008) On the capacity of UWB-based wireless sensor networks. Comput Netw 52:2797–2804
Verdú S (1986) Minimum probability of error for asynchronous Gaussian multiple-access channels. IEEE Trans Inf Theory 32(1):85–96
Verdú S (1989) The capacity region of the symbol-asynchronous Gaussian multiple-access channel. IEEE Trans Inf Theory 35(4):733–751
Wang T, Seyedi A, Heinzelman AVW (2013) Optimal rate allocation for distributed source coding over Gaussian multiple access channels. IEEE Trans Wireless Commun 12(5):2002–2013
Werner-Allen G, Lorincz K, Welsh M, Marcillo O, Ruiz JJM, Lees J (2006) Deploying a wireless sensor network on an active volcano. IEEE Internet Computing 10(2):18–25
Wimmer HK (1988) External problems for Hölder norms of matrices and realizations of linear systems. Siam J Matrix Anal Appl 9(3):314–322
Xu R, Wang H, Chen M, Tian C (2014) Matrix division multiple access for mini centralized network. In: IEEE International conference on communications 2014-wireless communications symposium, 5914–5919
Yu W, Rhee W, Boyd S, Cioffi JM (2004) Iterative water-filling for Gaussian vector multiple-access channels. IEEE Trans Inf Theory 50(1):145–152
Author information
Authors and Affiliations
Corresponding author
Additional information
Funding Information
This work is funded in part by the National Basic Research Program of China (Grant No. 2015CB057406), Beijing Natural Science Foundation (4164086), National Natural Science Foundation of China (61603209), and Independent Research Plan of Tsinghua University (20151080467).
Appendix A: Proof of Lemma 7
Appendix A: Proof of Lemma 7
Proof
Denote X j, l k as the lk-th element of matrix X j ,we use I-chain rule to calculate the derivative of \(\frac {\partial F(X)}{\partial X_{j,lk}}\).According to Lemma 5, we have
Then, we need to drive \(\frac {\partial \left (\log \left |\mathcal {G}\right |\right )} {\partial \left (\mathcal {G}\right )_{mn} }\)and \(\frac {\partial \left (\mathcal {G}\right )_{mn}}{\partial X_{j,lk}}\).
Using Lemma 5, it is obtained that
For matrix A, a special case of differentiation (see [16]) is
Refer to Eq. 54, the left fraction term of Eq. 53becomes
Using Lemma 6, the right fraction term of Eq. 53becomes
By substituting Eqs. 55and 56into Eq. 53, we have
Likewise, using Lemma 5, also we can obtain that
Using Lemma 6, the left fraction term of Eq. 58becomes
By substituting Eq. 59into Eq. 58, we have
Using Lemma 5, the formula in parentheses of Eq. 60 becomes,
Using Lemmas 5 and 6, the left fraction term in parentheses of Eq. 61 becomes,
Similarly, the right fraction term in parentheses of Eq. 61becomes,
By substituting Eqs. 62 and 63 into Eq. 61 and using Lemma 6, we can obtain
By substituting Eq. 64 into Eq. 60 and using Lemma 6, we have
By substituting Eqs. 57 and 65 into Eq. 52, we have
Using Lemmas 5 and 6, and switching the places of entities such that the derivation can be written as [⋅] l k , wehave
Thus Lemma 7 is proved. □
Rights and permissions
About this article
Cite this article
Yang, ZX., Zhao, GS., Li, G. et al. Matrix differentiation for capacity region of Gaussian multiple access channels under weighted total power constraint. Ann. Telecommun. 72, 703–715 (2017). https://doi.org/10.1007/s12243-017-0610-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12243-017-0610-7