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