Results 1 - 10
of
207
Variable-Rate Variable-Power MQAM for Fading Channels
- IEEE Trans. Commun
, 1997
"... We propose a variable-rate and variable-power MQAM modulation scheme for high-speed data transmission over fading channels. We first review results for the Shannon capacity of fading channels with channel side information, where capacity is achieved using adaptive transmission techniques. We then de ..."
Abstract
-
Cited by 220 (27 self)
- Add to MetaCart
We propose a variable-rate and variable-power MQAM modulation scheme for high-speed data transmission over fading channels. We first review results for the Shannon capacity of fading channels with channel side information, where capacity is achieved using adaptive transmission techniques. We then derive the spectral efficiency of our proposed modulation. We show that there is a constant power gap between the spectral efficiency of our proposed technique and the channel capacity, and this gap is a simple function of the required bit-error rate (BER). In addition, using just five or six different signal constellations, we achieve within 1--2 dB of the maximum efficiency using unrestricted constellation sets. We compute the rate at which the transmitter needs to update its power and rate as a function of the channel Doppler frequency for these constellation sets. We also obtain the exact efficiency loss for smaller constellation sets, which may be required if the transmitter adaptation rate is constrained by hardware limitations. Our modulation scheme exhibits a 5--10-dB power gain relative to variable-power fixed-rate transmission, and up to 20 dB of gain relative to nonadaptive transmission. We also determine the effect of channel estimation error and delay on the BER performance of our adaptive scheme. We conclude with a discussion of coding techniques and the relationship between our proposed modulation and Shannon capacity.
User Cooperation Diversity - Part I: System Description
- IEEE Trans. Commun
"... Mobile users' data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, ..."
Abstract
-
Cited by 197 (10 self)
- Add to MetaCart
Mobile users' data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, in which diversity gains are achieved via the cooperation of mobile users. Part I describes the user cooperation strategy while Part II focuses on implementation issues and performance analysis. Results show that, even though the inter-user channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Multi-access Fading Channels - Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities
- IEEE Trans. Inform. Theory
"... 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 p ..."
Abstract
-
Cited by 134 (8 self)
- Add to MetaCart
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 characterize the throughput capacity region which contains the long-term achievable rates through the time-varying channel. We show that each point on the boundary of the region can be achieved by successive decoding. Moreover, the optimal rate and power allocations in each fading state can be explicitly obtained in a greedy manner. The solution can be viewed as the generalization of the water-filling construction for single-user channels to multiaccess channels with arbitrary number of users, and exploits the underlying polymatroid structure of the capacity region. In part II, we characterize a delay-limited capacity region and obtain analogous results.
User cooperation diversitypart I: System description
- IEEE Trans. Commun
, 2003
"... Abstract—Mobile users ’ data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial div ..."
Abstract
-
Cited by 134 (12 self)
- Add to MetaCart
Abstract—Mobile users ’ data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, in which diversity gains are achieved via the cooperation of mobile users. Part I describes the user cooperation strategy, while Part II focuses on implementation issues and performance analysis. Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users ’ achievable rates are less susceptible to channel variations. Index Terms—Code-division multiple access (CDMA), diversity, fading, information rates, multiuser channels. I.
Communication over fading channels with delay constraints
- IEEE Transactions on Information Theory
, 2002
"... We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state informati ..."
Abstract
-
Cited by 118 (5 self)
- Add to MetaCart
We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the long-term average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixed-length/variable-rate codewords and one corresponding to variable-length codewords. The trade-off between the average delay and the average transmission power required for reliable communication is analyzed. A dynamic programming formulation is given to find all Pareto optimal power/delay operating points. We then quantify the behavior of this tradeoff in the regime of asymptotically large delay. In this regime we characterize simple buffer control policies which exhibit optimal characteristics. Connections to the delay-limited capacity and the expected capacity of fading channels are also discussed.
Towards an Information Theory of Large Networks: An Achievable Rate Region
- IEEE Trans. Inform. Theory
, 2003
"... Abstract — We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievabl ..."
Abstract
-
Cited by 117 (4 self)
- Add to MetaCart
Abstract — We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities. Applying the proposed scheme to a specific wireless network of nodes located in a region of unit area, we show that a transport capacity of ¡£ ¢ bit-meters/sec is feasible in a certain family of networks, as compared to the best possible transport capacity ¡£¢§ ¦ ¨ ¤ of bit-meters/sec in [16] where the receiver capabilities were limited. Even though the improvement is shown for a specific class of networks, a clear implication is that designing and employing more sophisticated multi-user coding schemes can provide sizable gains in at least some large wireless networks. Index Terms — Discrete memoryless channels, Gaussian channels, multiuser communications, network information theory,
Capacity Scaling in MIMO Wireless Systems Under Correlated Fading
- IEEE TRANS. INFORM. THEORY
, 2002
"... Previous studies have shown that single-user systems employing-element antenna arrays at both the transmitter and the receiver can achieve a capacity proportional to , assuming independent Rayleigh fading between antenna pairs. In this paper, we explore the capacity of dual-antenna-array systems und ..."
Abstract
-
Cited by 116 (2 self)
- Add to MetaCart
Previous studies have shown that single-user systems employing-element antenna arrays at both the transmitter and the receiver can achieve a capacity proportional to , assuming independent Rayleigh fading between antenna pairs. In this paper, we explore the capacity of dual-antenna-array systems under correlated fading via theoretical analysis and ray-tracing simulations. We derive and compare expressions for the asymptotic growth rate of capacity with antennas for both independent and correlated fading cases; the latter is derived under some assumptions about the scaling of the fading correlation structure. In both cases, the theoretic capacity growth is linear in but the growth rate is 10--20% smaller in the presence of correlated fading. We analyze our assumption of separable transmit/receive correlations via simulations based on a ray-tracing propagation model. Results show that empirical capacities converge to the limit capacity predicted from our asymptotic theory even at moderate n=16. We present results for both the cases when the transmitter does and does not know the channel realization.
Capacity and Optimal Resource Allocation for Fading Broadcast Channels: Part I: Ergodic Capacity
"... ..."
Adaptive Coded Modulation for Fading Channels
- IEEE TRANS. COMMUN
, 1998
"... We apply coset codes to adaptive modulation in fading channels. Adaptive modulation is a powerful technique to improve the energy efficiency and increase the data rate over a fading channel. Coset codes are a natural choice to use with adaptive modulation since the channel coding and modulation desi ..."
Abstract
-
Cited by 85 (10 self)
- Add to MetaCart
We apply coset codes to adaptive modulation in fading channels. Adaptive modulation is a powerful technique to improve the energy efficiency and increase the data rate over a fading channel. Coset codes are a natural choice to use with adaptive modulation since the channel coding and modulation designs are separable. Therefore, trellis and lattice codes designed for additive white Gaussian noise (AWGN) channels can be superimposed on adaptive modulation for fading channels, with the same approximate coding gains. We first describe the methodology for combining coset codes with a general class of adaptive modulation techniques. We then apply this methodology to a spectrally efficient adaptive M-ary quadrature amplitude modulation (MQAM) to obtain trellis-coded adaptive MQAM. We present analytical and simulation results for this design which show an effective coding gain of 3 dB relative to uncoded adaptive MQAM for a simple four-state trellis code, and an effective 3.6-dB coding gain for an eight-state trellis code. More complex trellis codes are shown to achieve higher gains. We also compare the performance of trellis-coded adaptive MQAM to that of coded modulation with built-in time diversity and fixed-rate modulation. The adaptive method exhibits a power savings of up to 20 dB.

