Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels

Simple item page
dc.creatorSoundararajan, Rajiv
dc.creatorVishwanath, Sriram
dc.date2008-02-28
dc.date.accessioned2026-07-07T09:23:47Z
dc.date.available2026-07-07T09:23:47Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0802.4233
dc.identifierhttp://arxiv.org/abs/0802.4233
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155862
dc.subjectInformation Theory
dc.titleAdaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
dc.typetext

Files

Collections

arXiv