Learn More
We propose an opportunistic power control algorithm, which exploits channel fluctuation in order to maximize system throughput. The basic idea is that it instructs a transmitter to increase its power when the channel is good and to decrease its power when the channel is bad. The transmission rate is adjusted according to the received signal-to-interference(More)
— Iterative waterfilling power allocation algorithm for Gaussian interference channels is investigated. The system is formulated as a non-cooperative game. Based on the measured interference powers, the users maximize their own throughput by iteratively adjusting their power allocations. The Nash equilibrium in this game is a fixed point of such iterative(More)
—In the application of linear network coding to wireless broadcasting with feedback, we prove that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two. When the finite field size is larger than or equal to the number of users, it is shown that we can always find an encoding vector which(More)
—The sum capacity of the one-sided parallel Gaussian interference channel is shown to be a concave function of user powers. Exploiting the inherent structure of the problem, we construct a numerical algorithm to compute it. Two suboptimal schemes are compared with the capacity-achieving scheme. One of the suboptimal schemes, namely iterative wa-terfilling,(More)
— For a given set of background interference signals, it is well known that the optimal sequence can be obtained by solving an eigenvalue problem. However, one usual practical constraint on the sequences in that the sequence elements should have a constant amplitude. We show that when the choice is limited to binary sequences, the sequence assignment(More)