Abstract—We examine adaptive modulation schemes for flatfading channels where the data rate, transmit power, and instantaneous BER are varied to maximize spectral efficiency, subject to an average power and BER constraint. Both continuous-rate and discrete-rate adaptation are considered, as well as average and instantaneous BER constraints. We find the general form of power, BER, and data rate adaptation that maximizes spectral efficiency for a large class of modulation techniques and fading distributions. The optimal adaptation of these parameters is to increase the power and data rate and decrease the BER as the channel quality improves. Surprisingly, little spectral efficiency is lost when the power or rate is constrained to be constant. Hence, the spectral efficiency of adaptive modulation is relatively insensitive to which degrees of freedom are adapted. Index Terms—Adaptive modulation, communication systems, fading channels, spectral efficiency. I.

Abstract—The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper and lower bounds coincide in the limit as the number of relays tends to infinity. Hence, this paper provides a new example where a simple cut-set upper bound is achievable, and one more example where uncoded transmission achieves optimal performance. The findings are illustrated by geometric interpretations. The techniques developed in this paper are then applied to a sensor network situation. This is a network joint source–channel coding problem, and it is well known that the source–channel separation theorem does not extend to this case. The present paper extends this insight by providing an example where separating source from channel coding does not only lead to suboptimal performance—it leads to an exponential penalty in performance scaling behavior (as a function of the number of nodes). Finally, the techniques developed in this paper are extended to include certain models of ad hoc wireless networks, where a capacity scaling law can be established: When all nodes act purely as relays for a single source–destination pair, capacity grows with the logarithm of the number of nodes. Index Terms—Capacity, CEO problem, joint source–channel coding, network, relay, sensor network, separation theorem, uncoded transmission. I.

In multiaccess wireless systems, dynamic allocation of resources such as transmit power, bandwidths, and rates is an important means to deal with the time-varying nature of the environment. In this two-part paper, we consider the problem of optimal resource allocation from an information-theoretic point of view. We focus on the multiaccess fading channel with Gaussian noise, and define two notions of capacity depending on whether the traffic is delay-sensitive or not. In Part I, we have analyzed the throughput capacity region which characterizes the long-term achievable rates through the time-varying channel. However, the delay experienced depends on how fast the channel varies. In the present paper, Part II, we introduce a notion of delay-limited capacity which is the maximum rate achievable with delay independent of how slow the fading is. We characterize the delay-limited capacity region of the multiaccess fading channel and the associated optimal resource allocation schemes. We show that successive decoding is optimal, and the optimal decoding order and power allocation can be found explicitly as a function of the fading states; this is a consequence of an underlying polymatroid structure that we exploit.

We first study the capacity of Nakagami multipath fading (NMF) channels with an average power constraint for three power and rate adaptation policies. We obtain closed-form solutions for NMF channel capacity for each power and rate adaptation strategy. Results show that rate adaptation is the key to increasing link spectral efficiency. We analyze therefore the performance of constant-power variable-rate M-QAM schemes over NMF channels. We obtain closed-form expressions for the outage probability, spectral efficiency and average bit-error-rate (BER) assuming perfect channel estimation and negligible time delay. We also analyze the impact of time delay on the BER of adaptive M-QAM. Keywords Link Spectral Efficiency, Adaptive Modulation Techniques, and Nakagami Fading. I. Introduction The radio spectrum available for wireless services is extremely scarce, while demand for these services is growing at a rapid pace [1]. Hence spectral efficiency is of primary concern in the design of fut...

Dynamic resource allocation is an important means to increase the sum capacity of fading multiple-access channels (MACs). In this paper, we consider vector multiaccess channels (channels where each user has multiple degrees of freedom) and study the effect of power allocation as a function of the channel state on the sum capacity (or spectral efficiency) defined as the maximum sum of rates of users per unit degree of freedom at which the users can jointly transmit reliably, in an information -theoretic sense, assuming random directions of received signal. Direct-sequence code-division multiple-access (DS-CDMA) channels and MACs with multiple antennas at the receiver are two systems that fall under the purview of our model. Our main result is the identification of a simple dynamic power-allocation scheme that is optimal in a large system, i.e., with a large number of users and a correspondingly large number of degrees of freedom. A key feature of this policy is that, for any user, it depends on the instantaneous amplitude of channel state of that user alone and the structure of the policy is "water-filling." In the context of DS-CDMA and in the special case of no fading, the asymptotically optimal power policy of water-filling simplifies to constant power allocation over all realizations of signature sequences; this result verifies the conjecture made in [28]. We study the behavior of the asymptotically optimal water-filling policy in various regimes of number of users per unit degree of freedom and signal-to-noise ratio (SNR). We also generalize this result to multiple classes, i.e., the situation when users in different classes have different average power constraints.

We solve the transmitter optimization problem and determine a necessary and sucient condition under which beamforming achieves Shannon capacity in a narrowband point to point communication system employing multiple transmit and receive antennas. We assume perfect channel state information at the receiver (CSIR) and imperfect channel state feedback from the receiver to the transmitter. We consider the cases of mean and covariance feedback. The channel is modeled at the transmitter as a matrix of complex jointly Gaussian random variables with either a zero mean and a known covariance matrix (covariance feedback), or a non-zero mean and a white covariance matrix (mean feedback). For both cases we develop a necessary and sucient condition for when the Shannon capacity is achieved through beamforming, i.e. the channel can be treated like a scalar channel and one-dimensional codes can be used to achieve capacity. We also provide a waterpouring interpretation of our results and nd that less channel uncertainty not only increases the system capacity but may also allow this higher capacity to be achieved with scalar codes which involves signi cantly less complexity in practice than vector coding.

We study the Shannon capacity of adaptive transmission techniques in conjunction with diversity combining. This capacity provides an upper bound on spectral efficiency using these techniques. We obtain closed-form solutions for the Rayleigh fading channel capacity under three adaptive policies: optimal power and rate adaptation, constant power with optimal rate adaptation, and channel inversion with fixed rate. Optimal power and rate adaptation yields a small increase in capacity over just rate adaptation, and this increase diminishes as the average received carrier-to-noise ratio (CNR) or the number of diversity branches increases. Channel inversion suffers the largest capacity penalty relative to the optimal technique, however, the penalty diminishes with increased diversity. Although diversity yields large capacity gains for all the techniques, the gain is most pronounced with channel inversion. For example, the capacity using channel inversion with two-branch diversity exceeds that of a single-branch system using optimal rate and power adaptation. Since channel inversion is the least complex scheme to implement, there is a tradeoff between complexity and capacity for the various adaptation methods and diversity-combining techniques.

Abstract not found

Transmit power control is a central technique for resource allocation and interference management in spread-spectrum wireless networks. With the increasing popularity of spread-spectrum as a multiple access technique, there has been significant research in the area in recent years. While power control has been considered traditionally as a means to counteract the harmful effect of channel fading, the more general emerging view is that it is a flexible mechanism to provide Quality-of-Service to individual users. In this paper, we will review the main threads of ideas and results in the recent development of this area, with a bias towards issues that have been the focus of our own research. For different receivers of varying complexity, we study both questions about optimal power control as well as the problem of characterizing the resulting network capacity. Although spread-spectrum communications has been traditionally viewed as a physical-layer subject, we argue that by suitable abstr...

Multiple-access interference (MAI) in a code-division multiple-access (CDMA) system plays an important role in performance analysis and characterization of fundamental system limits. In this paper, we study the behavior of the output MAI of the minimum mean-square error (MMSE) receiver employed in the uplink of a direct-sequence (DS)-CDMA system. We focus on imperfect power-controlled systems with random spreading, and establish that in a synchronous system 1) the output MAI of the MMSE receiver is asymptotically Gaussian, and 2) for almost every realization of the signatures and received powers, the conditional distribution of the output MAI converges weakly to the same Gaussian distribution as in the unconditional case. We also extend our study to asynchronous systems and establish the Gaussian nature of the output interference. These results indicate that in a large system the output interference is approximately Gaussian, and the performance of the MMSE receiver is robust to the randomness of the signatures and received powers. The Gaussianity justifies the use of single-user Gaussian codes for CDMA systems with linear MMSE receivers, and implies that from the viewpoints of detection and channel capacity, signal-to-interference ratio (SIR) is the key parameter that governs the performance of the MMSE receiver in a CDMA system.