Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/3994
Title: | Optimal algorithms for scheduling uplink users transmissions in CDMA systems [articol] |
Authors: | Zoican, Roxana Galaţchi, Dan |
Subjects: | Scheduling Uplink Reverse link CDMA SIR "Strong" users "Weak" users |
Issue Date: | 2004 |
Publisher: | Timişoara : Editura Politehnica |
Citation: | Zoican, Roxana. Optimal algorithms for scheduling uplink users transmissions in CDMA systems. Timişoara: Editura Politehnica, 2004 |
Series/Report no.: | Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 1 (2004), p. 362-366 |
Abstract: | Early work on capacity analysis of CDMA systems promise a large increase in cellular capacity when compared to other multiple-access techniques. The uplink capacity is shown to be limited by the outage probability. In this work, we consider the problem of optimal scheduling of uplink user transmissions in a single CDMA cell. We assume that the system operates in a TD/CDMA manner, with time-slotted scheduling of transmissions, assisted by periodic feedback of channel and/or congestion information through control channels. The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time, and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. |
URI: | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Optimal%20algorithms%20for%20scheduling%20uplink%20users%20transmissions%20in%20CDMA%20systems&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_ART_Zoican_f.pdf | 456.72 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.