Return to search

Resource allocation in digital mobile systems.

by Wan Wai Leung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 77-[80]). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Wireless Multimedia System --- p.1 / Chapter 1.2 --- Motivation of this thesis --- p.2 / Chapter 1.3 --- The theme of this thesis --- p.4 / Chapter 1.3.1 --- System Model and Assumptions --- p.4 / Chapter 1.3.2 --- Outline of the thesis --- p.5 / Chapter 2 --- Overview of TDMA/FDMA Digital Cellular Systems --- p.7 / Chapter 2.1 --- The Cellular Concept --- p.7 / Chapter 2.2 --- Channel Assignment Strategies --- p.9 / Chapter 2.2.1 --- Fixed Channel Assignment --- p.9 / Chapter 2.2.2 --- Dynamic Channel Assignment --- p.9 / Chapter 2.3 --- Multiple Access Techniques --- p.10 / Chapter 2.3.1 --- Introduction to Multiple Access --- p.10 / Chapter 2.3.2 --- Frequency Division Multiple Access - FDMA --- p.11 / Chapter 2.3.3 --- Time Division Multiple Access - TDMA --- p.12 / Chapter 2.4 --- A TDMA/FDMA System - GSM --- p.13 / Chapter 2.4.1 --- Global System for Mobile --- p.13 / Chapter 2.4.2 --- GSM radio subsystem --- p.13 / Chapter 3 --- Multi-rate Data in TDMA/FDMA Digital Cellular Systems --- p.17 / Chapter 3.1 --- Incorporation of Multimedia Data --- p.17 / Chapter 3.2 --- A Global Optimal Strategy --- p.19 / Chapter 3.2.1 --- Channel Rearrangement --- p.19 / Chapter 3.2.2 --- Analytical Performance Analysis of a Special Case --- p.21 / Chapter 3.2.3 --- Numerical Results --- p.24 / Chapter 3.2.4 --- Issues in Channel Rearrangement --- p.25 / Chapter 4 --- Multiple Slots Allocations --- p.26 / Chapter 4.1 --- Introduction --- p.26 / Chapter 4.2 --- No-Split Algorithm --- p.27 / Chapter 4.2.1 --- No-Split Algorithm --- p.27 / Chapter 4.2.2 --- Pros and Cons --- p.28 / Chapter 4.3 --- Best Fit Algorithm --- p.29 / Chapter 4.3.1 --- Best Fit Algorithm --- p.29 / Chapter 4.3.2 --- Optimization --- p.31 / Chapter 4.3.3 --- Pros and Cons --- p.32 / Chapter 4.4 --- Comparison of the two algorithms --- p.32 / Chapter 5 --- Buddy Algorithm --- p.37 / Chapter 5.1 --- Introduction --- p.37 / Chapter 5.2 --- Buddy System in Memory Management --- p.38 / Chapter 5.3 --- Buddy Algorithm --- p.40 / Chapter 5.3.1 --- Adaptation in slot allocation --- p.40 / Chapter 5.3.2 --- Data structure --- p.40 / Chapter 5.3.3 --- Slot allocation --- p.40 / Chapter 5.3.4 --- Slot deallocation --- p.44 / Chapter 5.4 --- Inference Property --- p.45 / Chapter 5.4.1 --- Proof of the Inference Property --- p.47 / Chapter 5.5 --- Pros and Cons --- p.49 / Chapter 6 --- Performance Study --- p.51 / Chapter 6.1 --- Introduction --- p.51 / Chapter 6.2 --- Fixed Channel Assignment --- p.52 / Chapter 6.2.1 --- System Parameters --- p.52 / Chapter 6.2.2 --- Simulation Results --- p.53 / Chapter 6.3 --- Dynmaic Channel Assignment --- p.55 / Chapter 6.3.1 --- System Parameters --- p.55 / Chapter 6.3.2 --- Simulation Results --- p.56 / Chapter 7 --- A Case Study - H.263 Video Coding --- p.59 / Chapter 7.1 --- CCITT H.263 Image Compression --- p.59 / Chapter 7.2 --- On a GSM Network --- p.60 / Chapter 8 --- Conclusion --- p.63 / Chapter A --- A General Data + Voice System with Channel Rearrangement --- p.65 / Chapter A.1 --- System Model --- p.65 / Chapter A.2 --- Markovian Analysis --- p.66 / Chapter B --- NP-Completeness Proof of the Best Fit Algorithm --- p.69 / Chapter B.1 --- CONSTRAINT SUBSET-SUM Problem --- p.69 / Chapter B.2 --- BEST-FIT Problem --- p.72 / Chapter C --- Proof of Proposition 5.2 --- p.74 / Chapter C.1 --- Upper Bound on Demand Advancement --- p.74 / Chapter C.2 --- Proof of Proposition 5.2 --- p.75 / Bibliography --- p.77

Identiferoai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_322399
Date January 1998
ContributorsWan, Wai Leung., Chinese University of Hong Kong Graduate School. Division of Information Engineering.
Source SetsThe Chinese University of Hong Kong
LanguageEnglish, Chinese
Detected LanguageEnglish
TypeText, bibliography
Formatprint, viii, 77, [3] leaves : ill. ; 30 cm.
RightsUse of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Page generated in 0.0024 seconds