Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels

In this paper, the sum capacity of the Gaussian multiple input multiple output (MIMO) cognitive radio channel (MCC) is expressed as a convex problem with finite number of linear constraints, allowing for polynomial time interior point techniques to find the solution. In addition, a specialized class of sum power iterative waterfilling algorithms is determined that exploits the inherent structure of the sum capacity problem. These algorithms not only determine the maximizing sum capacity value, but also the transmit policies that achieve this optimum. The paper concludes by providing numerical results which demonstrate that the algorithm takes very few iterations to converge to the optimum.

[1]  Arkadi Nemirovski,et al.  Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems , 2004, SIAM J. Optim..

[2]  Andrea J. Goldsmith,et al.  Capacity limits of MIMO channels , 2003, IEEE J. Sel. Areas Commun..

[3]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[4]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[5]  Pramod Viswanath,et al.  Cognitive Radio: An Information-Theoretic Perspective , 2009, IEEE Transactions on Information Theory.

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  Andrea J. Goldsmith,et al.  Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels , 2003, IEEE Trans. Inf. Theory.

[8]  Sriram Vishwanath,et al.  On the Capacity of a Class of MIMO Cognitive Radios , 2007, IEEE Journal of Selected Topics in Signal Processing.

[9]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[10]  Max H. M. Costa,et al.  On the Gaussian interference channel , 1985, IEEE Trans. Inf. Theory.

[11]  Wei Yu,et al.  Iterative water-filling for Gaussian vector multiple-access channels , 2001, IEEE Transactions on Information Theory.

[12]  Hiroshi Sato,et al.  The capacity of the Gaussian interference channel under strong interference , 1981, IEEE Trans. Inf. Theory.

[13]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[14]  Nihar Jindal,et al.  Sum power iterative waterfilling for Gaussian vector broadcast channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  Andrea J. Goldsmith,et al.  Sum power iterative water-filling for multi-antenna Gaussian broadcast channels , 2005, IEEE Transactions on Information Theory.