I. Bettesh and S. Shamai, "A low delay algorithm for the multiple access channel with Rayleigh fading," in Proc. IEEE Personal, Indoor and Mobile Radio Communications (PIMRC'98), 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Utilizing Multiuser Diversity for Efficient Support of Quality.. - Wu, Negi (Correct)
....an arbitrarily long period will not be allowed to transmit during this period, resulting in an arbitrarily long delay; therefore, this scheme provides no delay guarantees and thus is not suitable for delay sensitive applications, such as voice or video. To mitigate this problem, Bettesh and Shamai [2] proposed an algorithm, which strikes a balance between throughput and delay constraints. This algorithm combines K H scheduling with an RR scheduling, and it can achieve lower delay than K H scheduling while obtaining a capacity gain over a pure RR scheduling. However, it is very complex to ....
I. Bettesh and S. Shamai, "A low delay algorithm for the multiple access channel with Rayleigh fading," in Proc. IEEE Personal, Indoor and Mobile Radio Communications (PIMRC'98), 1998.
Fading Channels: Information-Theoretic and Communications.. - Biglieri, Proakis, Shamai (1998) (108 citations) Self-citation (Shamai) (Correct)
....hence giving rise to (3.4.5) By Jensen s inequality it follows immediately [255] 283] that is a nondecreasing function of for i.i.d. nonnegative random variables thus establishing the advantage of CDMA over TDMA and FDMA under this fading model. For further details, see [97] 255] 48] [29], 86] and [298] A natural question that arises here is how orthogonal CDMA compares to the optimum (3.4.3) and to orthogonal TDMA and FDMA (3.4.5) In orthogonal CDMA, all users use orthogonal direct sequence spreading (say, by Hadamard (Walsh) bipolar sequences) This method, assuming not ....
....by the coherence bandwidth) over which transmission may take BIGLIERI et al. FADING CHANNELS: INFORMATION THEORETIC AND COMMUNICATIONS ASPECTS 2647 place. Algorithms to control the waiting time associated with this random TDMA accessing over the flat fading channel are suggested and analyzed in [29] and discussed in the following. It is shown, contrary to the single user case, that optimal power control, made possible when ideal CSI is available to all transmitters, yields considerable advantages with respect to the ergodic throughputs for many users, when fixed power is used (optimal for ....
[Article contains additional citation context not shown here]
I. Bettesh and S. Shamai (Shitz), "A low delay algorithm for the multiple access channel with Rayleigh fading," in 9th IEEE Int. Symp. Personal Indoor and Mobile Radio Communication (PIMRC'98) (Boston, MA, Sept. 8--11, 1998), to be published.
Utilizing Multiuser Diversity for Efficient Support of Quality.. - Wu, Negi (2005) (Correct)
No context found.
I. Bettesh and S. Shamai, "A low delay algorithm for the multiple access channel with Rayleigh fading," in Proc. IEEE Personal, Indoor and Mobile Radio Communications (PIMRC'98), 1998.
QoS Provisioning in Wireless Networks - Wu (Correct)
No context found.
I. Bettesh and S. Shamai, "A low delay algorithm for the multiple access channel with Rayleigh fading," in Proc. IEEE Personal, Indoor and Mobile Radio Communications (PIMRC'98), 1998.
Downlink Scheduling in a Cellular Network for Quality of Service .. - Wu, Negi (2003) (1 citation) (Correct)
No context found.
I. Bettesh and S. Shamai, "A low delay algorithm for the multiple access channel with Rayleigh fading," in Proc. IEEE Personal, Indoor and Mobile Radio Communications (PIMRC'98), 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC