Jamie S. Evans

Large system performance of linear multiuser receivers in multipath fading channels

A linear multiuser receiver for a particular user in a code-division multiple-access (CDMA) network gains potential benefits from knowledge of the channels of all users in the system. In fast multipath fading environments we cannot assume that the channel estimates are perfect and the inevitable channel estimation errors will limit this potential gain. We study the impact of channel estimation errors on the performance of linear multiuser receivers, as well as the channel estimation problem itself. Of particular interest are the scalability properties of the channel and data estimation algorithms: what happens to the performance as the system bandwidth and the number of users (and hence channels to estimate) grows? Our main results involve asymptotic expressions for the signal-to-interference ratio of linear multiuser receivers in the limit of large processing gain, with the number of users divided by the processing gain held constant. We employ a random model for the spreading sequences and the limiting signal-to-interference ratio expressions are independent of the actual signature sequences, depending only on the system loading and the channel statistics: background noise power, energy profile of resolvable multipaths, and channel coherence time. The effect of channel uncertainty on the performance of multiuser receivers is succinctly captured by the notion of effective interference.

Effective bandwidth-based admission control for multiservice CDMA cellular networks

We develop product form traffic models for single- and multiple-cell code-division multiple-access (CDMA) networks with multiple classes of mobile subscribers. The key feature of this development is the specification of a flexible call admission control procedure that details the numbers of mobiles of each class in each cell that the system operator should allow in order to maintain an acceptable quality of service. Effective bandwidth techniques from the analysis of statistical multiplexing at an asynchronous transfer mode (ATM) based broadband integrated services digital network (ISDN) link are used to give performance guarantees that overcome the variability in interference levels characteristic of CDMA cellular networks. The result is an admissible region bounded by a finite number of hyperplanes and a simple and efficient call admission policy. The CDMA mobile network, operating within the admissible region described, has a very similar form to a circuit-switched network operating with fixed routing. This similarity allows the existing traffic modeling techniques and network management strategies for general loss networks to be applied to CDMA mobile cellular networks. In particular, with standard assumptions on the call arrival processes and holding times, the stationary state distribution has a product form on the truncated state space defined by the call admission strategy.

Low-Complexity Distributed Algorithms for Spectrum Balancing in Multi-User DSL Networks

Dynamic Spectrum Management of Digital Subscriber Lines (DSL) has the potential to dramatically increase the capacity of the aging last-mile copper access network. This paper takes an important step toward fulfilling this potential through power spectrum balancing. We derive a novel algorithm called SCALE, that provides a significant performance improvement over the existing iterative water-filling (IWF) algorithm in multi-user DSL networks, doing so with comparable low complexity. The algorithm is easily distributed through measurement and limited message-passing with the use of a Spectrum Management Center. We outline how overhead can be managed, and show that in the limit of zero message-passing, performance reduces to IWF. Numerical convergence of SCALE was found to be extremely fast when applied to VDSL, with performance exceeding that of iterative water-filling in just a few iterations, and to over 90% of the final rate in under 5 iterations. Lastly, we return to the problem of iterative water-filling and derive a new algorithm named SCAWF that is shown to be a very simple way to waterfill, particularly suited to the multi-user context.

SCALE: A Low-Complexity Distributed Protocol for Spectrum Balancing in Multiuser DSL Networks

Dynamic spectrum management of digital subscriber lines (DSLs) has the potential to dramatically increase the capacity of the aging last-mile copper access network. This paper takes an important step toward fulfilling this potential through power spectrum balancing. We derive a novel algorithm called SCALE, that provides a significant performance improvement over the existing iterative water-filling (IWF) algorithm in multiuser DSL networks, doing so with comparable low complexity. The algorithm is easily distributed through measurement and limited message passing with the use of a spectrum management center. We outline how overhead can be managed, and show that in the limit of zero message-passing, performance reduces to IWF.

Distributed Downlink Beamforming With Cooperative Base Stations

In this paper, we consider multicell processing on the downlink of a cellular network to accomplish ldquomacrodiversityrdquo transmit beamforming. The particular downlink beamformer structure we consider allows a recasting of the downlink beamforming problem as a virtual linear mean square error (LMMSE) estimation problem. We exploit the structure of the channel and develop distributed beamforming algorithms using local message passing between neighboring base stations. For 1-D networks, we use the Kalman smoothing framework to obtain a forward-backward beamforming algorithm. We also propose a limited extent version of this algorithm that shows that the delay need not grow with the size of the network in practice. For 2-D cellular networks, we remodel the network as a factor graph and present a distributed beamforming algorithm based on the sum-product algorithm. Despite the presence of loops in the factor graph, the algorithm produces optimal results if convergence occurs.

On the teletraffic capacity of CDMA cellular networks

The aim of this paper is to contribute to the understanding of the teletraffic behavior of code-division multiple-access (CDMA) cellular networks. In particular, we examine a technique to assess the reverse link traffic capacity and its sensitivity to various propagation and system parameters. We begin by discussing methods of characterizing interference from other users in the network. These methods are extremely important in the development of the traffic models. We begin with a review of several existing approaches to the problem of handling other-cell interference before presenting a novel characterization of the interference in the form of an analytic expression for the interference distribution function in the deterministic propagation environment. We then look at extending the capacity analyses that assume a fixed and equal number of users in every cell to handle the random nature of call arrivals and departures. The simplest way to do this is by modeling each cell of the network as an independent M/G/x/spl infin/ queue. This allows us to replace the deterministic number of users in each cell by an independent Poisson random variable for each cell. The resulting compound Poisson sums have some very nice properties that allow us to calculate an outage probability by analyzing a single random sum. This leads to a very efficient technique for assessing the reverse link traffic capacity of CDMA cellular networks.

Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs

We seek distributed protocols that attain the global optimum allocation of link transmitter powers and source rates in a cross-layer design of a mobile ad hoc network. Although the underlying network utility maximization is nonconvex, convexity plays a major role in our development. We provide new convexity results surrounding the Shannon capacity formula, allowing us to abandon suboptimal high-SIR approximations that have almost become entrenched in the literature. More broadly, these new results can be back-substituted into many existing problems for similar benefit. Three protocols are developed. The first is based on a convexification of the underlying problem, relying heavily on our new convexity results. We provide conditions under which it produces a globally optimum resource allocation. We show how it may be distributed through message passing for both rate- and power-allocation. Our second protocol relaxes this requirement and involves a novel sequence of convex approximations, each exploiting existing TCP protocols for source rate allocation. Message passing is only used for power control. Our convexity results again provide sufficient conditions for global optimality. Our last protocol, motivated by a desire of power control devoid of message passing, is a near optimal scheme that makes use of noise measurements and enjoys a convergence rate that is orders of magnitude faster than existing methods.

Multiuser Transmit Beamforming via Regularized Channel Inversion: A Large System Analysis

In this paper, we analyze the performance of multiuser transmit beamforming for the broadcast channel. We focus on transmit beamforming via regularized channel inversion and our analysis is in the large system limit where both the number of users and the number of antennas approach infinity with their ratio held constant. We derive an expression for the signal-to-interference-plus-noise ratio in this large system limit. We then use this result to obtain a very simple expression for a locally optimal regularization parameter, that which maximizes the asymptotic signal-to-interference-plus-noise ratio.

Distributed Decoding in a Cellular Multiple-Access Channel

Distributed decoding in the uplink of a rectangular planar cellular array with local message passing is considered. Two algorithms are proposed and compared: a BCJR-type algorithm applied to linear subgraphs, and belief propagation applied to the 2D graph of the cellular array.

Optimal power control for Rayleigh-faded multiuser systems with outage constraints

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.