Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels

Details Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels

2008-02-28

arxiv.org/abs/0802.4233v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472093