MDP-based analysis for multicode assignment in 3G WCDMA networks
MDP-based analysis for multicode assignment in 3G WCDMA networks
- Author(s): Ben-Jye Chang and Wei-Lung Shen
- DOI: 10.1049/cp:20040682
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Fifth IEE International Conference on 3G Mobile Communication Technologies (3G 2004) The Premier Technical Conference for 3G and Beyond — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Ben-Jye Chang and Wei-Lung Shen Source: Fifth IEE International Conference on 3G Mobile Communication Technologies (3G 2004) The Premier Technical Conference for 3G and Beyond, 2004 p. 286 – 290
- Conference: Fifth IEE International Conference on 3G Mobile Communication Technologies (3G 2004) The Premier Technical Conference for 3G and Beyond
- DOI: 10.1049/cp:20040682
- ISBN: 0 86341 388 9
- Location: London, UK
- Conference date: 18-20 Oct. 2004
- Format: PDF
3G WCDMA networks adopt the orthogonal variable spreading factor (OVSF) code tree as code management to assign single channelization code for achieving variable rate for real-time multimedia communication. Based on the orthogonal characteristic of the OVSF codes, an allocated code will block the channelization codes, which are at the descendant branches of the allocated code and the ancestral codes of it. Several pieces of research have extensively studied ways to overcome such a problem. In addition, the data rate of traffic classes should be powers of two of the basic rate, which is impractical and results in wasting system bandwidth. One good solution is to assign the multiple codes for an accepted connection. Nevertheless, it brings two drawbacks: high complexity of handling multiple codes and increasing cost of using more Rake combiners at both the base stations and mobile nodes. Consequently, there is a trade-off between the waste rate and complexity of handling multiple code assignment. Therefore, we propose an adaptive efficient partition algorithm with the Markov decision process (MDP) analysis approach to reduce the large number of reassignment codes while improving the waste rate. Numerical results indicate that the proposed MDP approach yields the fewest reassignments and least number of codes per connection while reducing waste rate as compare to other approaches.
Inspec keywords: tree codes; 3G mobile communication; multimedia communication; Markov processes; code division multiple access; data communication
Subjects: Multiple access communication; Multimedia communications; Markov processes; Codes; Mobile radio systems
Related content
content/conferences/10.1049/cp_20040682
pub_keyword,iet_inspecKeyword,pub_concept
6
6