Now showing 1 - 4 of 4
ItemOutage Capacity and Optimal Power Allocation for Multiple Time-Scale Parallel Fading ChannelsDey, S ; Evans, JS (Institute of Electrical and Electronics Engineers (IEEE), 2007-07)In this paper, we address the optimal power allocation problem for minimizing capacity outage probability in multiple time-scale parallel fading channels. Extending ideas from , we derive the optimal power allocation scheme for parallel fading channels with fast Rayleigh fading, as a function of the slow fading gains. Numerical results are presented to demonstrate the outage performance of this scheme for lognormal slow fading on two parallel channels.
ItemOptimal Power Control Over Multiple Time-scale Fading Channels with Service Outage ConstraintsDey, S ; Evans, JS (Institute of Electrical and Electronics Engineers (IEEE), 2005-04)This paper considers the power-control problem for a fading channel in an information-theoretic framework. We derive power-control schemes to optimize ergodic capacity, outage capacity, and capacity with a service outage constraint. The novelty in the paper lies in the use of a two-time-scale fading process and its implications for the channel-state information available at the transmitter.
ItemOutage-based Optimal Power Control for Generalized Multiuser Fading ChannelsPapandriopoulos, J ; Evans, JS ; Dey, S (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2006-04)We address the problem of achieving outage probability constraints on the uplink of a code-division multiple-access (CDMA) system employing power control and linear multiuser detection, where we aim to minimize the total expended power. We propose a generalized framework for solving such problems under modest assumptions on the underlying channel fading distribution. Unlike previous work, which dealt with a Rayleigh fast-fading model, we allow each user to have a different fading distribution. We show how this problem can be formed as an optimization over user transmit powers and linear receivers, and, where the problem is feasible, we provide conceptually simple iterative algorithms that find the minimum power solution while achieving outage specifications with equality. We further generalize a mapping from outage probability specifications to average signal-to-interference-ratio constraints that was previously applicable only to Rayleigh-faded channels. This mapping allows us to develop suboptimal, computationally efficient algorithms to solve the original problem. Numerical results are provided that validate the iterative schemes, showing the closeness of the optimal and mapped solutions, even under circumstances where the map does not guarantee that constraints will be achieved.
ItemOptimal Power Control for Rayleigh-Faded Multiuser Systems with Outage ConstraintsPapandriopoulos, J ; Evans, JS ; Dey, S (Institute of Electrical and Electronics Engineers, 2005-11)How can we achieve the conflicting goals of reduced transmission power and increased capacity in a wireless network, without attempting to follow the instantaneous state of a fading channel? In this paper, we address this problem by jointly considering power control and multiuser detection (MUD) with outage-probability constraints in a Rayleigh fast-fading environment. The resulting power-control algorithms (PCAs) utilize the statistics of the channel and operate on a much slower timescale than traditional schemes. We propose an optimal iterative solution that is conceptually simple and finds the minimum sum power of all users while meeting their outage targets. Using a derived bound on outage probability, we introduce a mapping from outage to average signal-to-interference ratio (SIR) constraints. This allows us to propose a suboptimal iterative scheme that is a variation of an existing solution to a joint power control and MUD problem involving SIR constraints. We further use a recent result that transforms complex SIR expressions into a compact and decoupled form, to develop a noniterative and computationally inexpensive PCA for large systems of users. Simulation results are presented showing the closeness of the optimal and mapped schemes, speed of convergence, and performance comparisons.