In recent years, cellular systems based on orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) have gained considerable popularity. Two of the major reasons for this are, on the one hand, that OFDMA enables the receiver to effectively cope with multipath propagation while keeping the complexity low. On the other hand, TDD offers efficient support for cell-specific uplink (UL)/downlink (DL) asymmetry demands by allowing each cell to independently set its UL/DL switching point (SP). However, cell-independent SP gives rise to crossed slots. In particular, crossed slots arise when neighbouring cells use the same slot in opposing link directions, resulting in base station (BS)-to-BS interference and mobile station (MS)-to-MS interference. BS-to-BS interference, in particular, can be quite detrimental due to the exposed location of BSs, which leads to high probability of line-of-sight (LOS) conditions. The aim of this thesis is to address the BS-to-BS interference problem in OFDMA-TDDcellular networks. A simulation-based approach is used to demonstrate the severity of BS-to-BS interference and a signal-to-interference-plus-noise ratio (SINR) equation for OFDMA is formulated to aid system performance analysis. The detrimental effects of crossed slot interference in OFDMA-TDD cellular networks are highlighted by comparing methods specifically targeting the crossed slots interference problem. In particular, the interference avoidance method fixed slot allocation (FSA) is compared against state of the art interference mitigation approaches, viz: random time slot opposing (RTSO) and zone division (ZD). The comparison is done based on Monte Carlo simulations and the main comparison metric is spectral efficiency calculated using the SINR equation formulated in this thesis. The simulation results demonstrate that when LOS conditions among BSs are present, both RTSO and ZD perform worse than FSA for all considered performance metrics. It is concluded from the results that current interference mitigation techniques do not offer an effective solution to the BS-to-BS interference problem. Hence, new interference avoidance methods, which unlike FSA, do not sacrifice the advantages of TDD are open research issues addressed in this thesis. The major contribution of this thesis is a novel cooperative resource balancing technique that offers a solution to the crossed slot problem. The novel concept, termed asymmetry balancing, is targeted towards next-generation cellular systems, envisaged to have ad hoc and multi-hop capabilities. Asymmetry balancing completely avoids crossed slots by keeping the TDD SPs synchronised among BSs. At the same time, the advantages of TDD are retained, which is enabled by introducing cooperation among the entities in the network. If a cell faces resource shortage in one link direction, while having free resources in the opposite link direction, the free resources can be used to support the overloaded link direction. In particular, traffic can be offloaded to near-by mobile stations at neighbouring cells that have available resources. To model the gains attained with asymmetry balancing, a mathematical framework is developed which is verified by Monte Carlo simulations. In addition, asymmetry balancing is compared against both ZD and FSA based on simulations and the results demonstrate the superior performance of asymmetry balancing. It can be concluded that the novel interference avoidance approach is a very promising candidate to.

We are at that moment of network evolution when we have realised that our telecommunication systems should mimic features of human kind, e.g., the ability to understand the medium and take advantage of its changes. Looking towards the future, the mobile industry envisions the use of fully automatised cells able to self-organise all their parameters and procedures. A fully self-organised network is the one that is able to avoid human involvement and react to the fluctuations of network, traffic and channel through the automatic/autonomous nature of its functioning. Nowadays, the mobile community is far from this fully self-organised kind of network, but they are taken the first steps to achieve this target in the near future. This thesis hopes to contribute to the automatisation of cellular networks, providing models and tools to understand the behaviour of these networks, and algorithms and optimisation approaches to enhance their performance. This work focuses on the next generation of cellular networks, in more detail, in the DownLink (DL) of Orthogonal Frequency Division Multiple Access (OFDMA) based networks. Within this type of cellular system, attention is paid to interference mitigation in self-organising macrocell scenarios and femtocell deployments. Moreover, this thesis investigates the interference issues that arise when these two cell types are jointly deployed, complementing each other in what is currently known as a two-tier network. This thesis also provides new practical approaches to the inter-cell interference problem in both macro cell and femtocell OFDMA systems as well as in two-tier networks by means of the design of a novel framework and the use of mathematical optimisation. Special attention is paid to the formulation of optimisation problems and the development of well-performing solving methods (accurate and fast).

This thesis proposes four novel techniques to solve the problem of growing energy consumption requirements in cellular communication networks. The first and second part of this work propose a novel energy efficient scheduling mechanism and two new bandwidth management techniques, while the third part provides an algorithm to actively manage the power state of base stations (BSs) so that energy consumption is minimized throughout the day while users suffer a minimal loss in achieved data rate performance within the system. The proposed energy efficient score based scheduler (EESBS) is based on the already existing principle of score based resource allocation. Resource blocks (RBs) are given scores based on their energy efficiency for every user and then their allocation is decided based on a comparison between the scores of the different users on each RB. Two additional techniques are introduced that allow the scheduler to manage the user’s bandwidth footprint or in other words the number of RBs allocated. The first one, bandwidth expansion mode (BEM), allows users to expand their bandwidth footprint while retaining their overall transmission data rate. This allows the system to save energy due to the fact that data rate scales linearly with bandwidth and only logarithmically with transmission power. The second technique, time compression mode (TCoM), is targeted at users whose energy consumption is dominated by signalling overhead transmissions. If the assumption is made that the overhead is proportional to the number of RBs allocated, then users who find themselves having low data rate demands can release some of their allocated RBs by using a higher order modulation on the remaining ones and thus reduce their overall energy expenditure. Moreover, a system that combines all of the aforementioned scheduling techniques is also discussed. Both theoretical and simulation results on the performance of the described systems are provided. The energy efficient hardware state control (EESC) algorithm works by first collecting statistical information about the loading of each BS during the day that is due to the particular mobility patterns of users. It then uses that information to allow the BSs to turn off for parts of the day when the expected load is low and they can offload their current users to nearby cell sites. Simplified theoretical, along with complete system computer simulation, results are included. All the algorithms presented are very straightforward to implement and are not computationally intensive. They provide significant energy consumption reductions at none to minimal cost in terms of experienced user data rate.

In wireless networks, there is an ever-increasing demand for higher system throughputs, along with growing expectation for all users to be available to multimedia and Internet services. This is especially difficult to maintain at the cell-edge. Therefore, a key challenge for future orthogonal frequency division multiple access (OFDMA)-based networks is inter-cell interference coordination (ICIC). With full frequency reuse, small inter-site distances (ISDs), and heterogeneous architectures, coping with co-channel interference (CCI) in such networks has become paramount. Further, the needs for more energy efficient, or “green,” technologies is growing. In this light, Uplink Interference Protection (ULIP), a technique to combat CCI via power reduction, is investigated. By reducing the transmit power on a subset of resource blocks (RBs), the uplink interference to neighbouring cells can be controlled. Utilisation of existing reference signals limits additional signalling. Furthermore, cell-edge performance can be significantly improved through a priority class scheduler, enhancing the throughput fairness of the system. Finally, analytic derivations reveal ULIP guarantees enhanced energy efficiency for all mobile stations (MSs), with the added benefit that overall system throughput gains are also achievable. Following this, a novel scheduler that enhances both network spectral and energy efficiency is proposed. In order to facilitate the application of Pareto optimal power control (POPC) in cellular networks, a simple feasibility condition based on path gains and signal-to-noise-plus- interference ratio (SINR) targets is derived. Power Control Scheduling (PCS) maximises the number of concurrently transmitting MSs and minimises their transmit powers. In addition, cell/link removal is extended to OFDMA operation. Subsequently, an SINR variation technique, Power SINR Scheduling (PSS), is employed in femto-cell networks where full bandwidth users prohibit orthogonal resource allocation. Extensive simulation results show substantial gains in system throughput and energy efficiency over conventional power control schemes. Finally, the evolution of future systems to heterogeneous networks (HetNets), and the consequently enhanced network management difficulties necessitate the need for a distributed and autonomous ICIC approach. Using a fuzzy logic system, locally available information is utilised to allocate time-frequency resources and transmit powers such that requested rates are satisfied. An empirical investigation indicates close-to-optimal system performance at significantly reduced complexity (and signalling). Additionally, base station (BS) reference signals are appropriated to provide autonomous cell association amongst multiple co-located BSs. Detailed analytical signal modelling of the femto-cell and macro/pico-cell layouts reveal high correlation to experimentally gathered statistics. Further, superior performance to benchmarks in terms of system throughput, energy efficiency, availability and fairness indicate enormous potential for future wireless networks.

Wang, Xu. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references. / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

by Wai Ho Mow. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1993. / Includes bibliographical references (leaves 116-124). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Spread Spectrum Technique --- p.2 / Chapter 1.1.1 --- Pulse Compression Radars --- p.3 / Chapter 1.1.2 --- Spread Spectrum Multiple Access Systems --- p.6 / Chapter 1.2 --- Definitions and Notations --- p.8 / Chapter 1.3 --- Organization of this Thesis --- p.12 / Chapter 2 --- Lower Bounds on Correlation of Sequences --- p.15 / Chapter 2.1 --- Welch's Lower Bounds and Sarwate's Generalization --- p.16 / Chapter 2.2 --- A New Construction and Bounds on Odd Correlation --- p.23 / Chapter 2.3 --- Known Sequence Sets Touching the Correlation Bounds --- p.26 / Chapter 2.4 --- Remarks on Other Bounds --- p.27 / Chapter 3 --- Perfect Polyphase Sequences: A Unified Approach --- p.29 / Chapter 3.1 --- Generalized Bent Functions and Perfect Polyphase Sequences --- p.30 / Chapter 3.2 --- The General Construction of Chung and Kumar --- p.32 / Chapter 3.3 --- Classification of Known Constructions ...........； --- p.34 / Chapter 3.4 --- A Unified Construction --- p.39 / Chapter 3.5 --- Desired Properties of Sequences --- p.41 / Chapter 3.6 --- Proof of the Main Theorem --- p.45 / Chapter 3.7 --- Counting the Number of Perfect Polyphase Sequences --- p.49 / Chapter 3.8 --- Results of Exhaustive Searches --- p.53 / Chapter 3.9 --- A New Conjecture and Its Implications --- p.55 / Chapter 3.10 --- Sets of Perfect Polyphase Sequences --- p.58 / Chapter 4 --- Aperiodic Autocorrelation of Generalized P3/P4 Codes --- p.61 / Chapter 4.1 --- Some Famous Polyphase Pulse Compression Codes --- p.62 / Chapter 4.2 --- Generalized P3/P4 Codes --- p.65 / Chapter 4.3 --- Asymptotic Peak-to-Side-Peak Ratio --- p.66 / Chapter 4.4 --- Lower Bounds on Peak-to-Side-Peak Ratio --- p.67 / Chapter 4.5 --- Even-Odd Transformation and Phase Alphabet --- p.70 / Chapter 5 --- Upper Bounds on Partial Exponential Sums --- p.77 / Chapter 5.1 --- Gauss-like Exponential Sums --- p.77 / Chapter 5.1.1 --- Background --- p.79 / Chapter 5.1.2 --- Symmetry of gL(m) and hL(m) --- p.80 / Chapter 5.1.3 --- Characterization on the First Quarter of gL(m) --- p.83 / Chapter 5.1.4 --- Characterization on the First Quarter of hL(m) --- p.90 / Chapter 5.1.5 --- Bounds on the Diameters of GL(m) and HL(m) --- p.94 / Chapter 5.2 --- More General Exponential Sums --- p.98 / Chapter 5.2.1 --- A Result of van der Corput --- p.99 / Chapter 6 --- McEliece's Open Problem on Minimax Aperiodic Correlation --- p.102 / Chapter 6.1 --- Statement of the Problem --- p.102 / Chapter 6.2 --- A Set of Two Sequences --- p.105 / Chapter 6.3 --- A Set of K Sequences --- p.110 / Chapter 7 --- Conclusion --- p.113 / Bibliography --- p.124

by Kin Kwong Leung. / Thesis submitted in: November 1999. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 67-[70]). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Code Division Multiple Access (CDMA) --- p.1 / Chapter 1.1.1 --- The Cellular Concept --- p.2 / Chapter 1.2 --- Fading and Power Control --- p.3 / Chapter 1.2.1 --- Large Scale Fading --- p.3 / Chapter 1.2.2 --- Small Scale Fading --- p.4 / Chapter 1.2.3 --- Power Control --- p.5 / Chapter 1.2.4 --- Standard Interference Function --- p.5 / Chapter 1.3 --- Previous Work --- p.6 / Chapter 1.3.1 --- Power Control --- p.6 / Chapter 1.3.2 --- Convergence Analysis --- p.8 / Chapter 1.4 --- Scope of this Thesis --- p.8 / Chapter 1.5 --- Organization of the Thesis --- p.9 / Chapter 2 --- System Model --- p.10 / Chapter 2.1 --- System and Definitions --- p.10 / Chapter 2.2 --- Varying Link Gains Model --- p.11 / Chapter 2.3 --- SIR model in CDMA System --- p.13 / Chapter 2.4 --- Simulation Model --- p.14 / Chapter 3 --- Fade Margin --- p.17 / Chapter 3.1 --- Introduction --- p.17 / Chapter 3.2 --- Fixed-step Power Control Algorithm --- p.18 / Chapter 3.3 --- Definitions and Feasibility of SIR --- p.19 / Chapter 3.3.1 --- Definition --- p.19 / Chapter 3.3.2 --- Feasibility --- p.20 / Chapter 3.4 --- Performance Analysis on Fading Channel --- p.22 / Chapter 3.4.1 --- Single-User --- p.22 / Chapter 3.4.2 --- Multiple-User --- p.24 / Chapter 4 --- Generalized Step Power Control Algorithm --- p.28 / Chapter 4.1 --- Introduction --- p.28 / Chapter 4.2 --- Generalized Fixed Step Power Control Algorithm --- p.29 / Chapter 4.3 --- Existence of the Solution --- p.30 / Chapter 4.4 --- Parameter Optimization --- p.31 / Chapter 4.4.1 --- Single-User --- p.34 / Chapter 4.4.2 --- Multiple-User --- p.37 / Chapter 4.5 --- Performance Analysis --- p.41 / Chapter 4.5.1 --- Single-User --- p.41 / Chapter 4.5.2 --- Multiple-User --- p.42 / Chapter 4.6 --- Hybrid Scheme --- p.47 / Chapter 5 --- Convergence Analysis --- p.49 / Chapter 5.1 --- Introduction --- p.49 / Chapter 5.2 --- Totally Asynchronous Models --- p.50 / Chapter 5.3 --- Normalized Interference Function --- p.52 / Chapter 5.4 --- Existence of Quantized Solution --- p.53 / Chapter 5.5 --- Convergence Theorem --- p.55 / Chapter 6 --- Conclusion and Future Work --- p.64 / Chapter 6.1 --- Conclusion --- p.64 / Chapter 6.2 --- Future Works --- p.65 / Bibliography --- p.67

Shen Fangzhong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 55-57). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgements --- p.iii / List of Figures --- p.vi / List of Tables --- p.ix / Chapter Chapter 1. --- Introduction --- p.1 / Chapter 1.1. --- Motivation --- p.1 / Chapter 1.2. --- Related Work --- p.2 / Chapter 1.3. --- Our Work --- p.2 / Chapter 1.4. --- Some Assumptions --- p.2 / Chapter 1.4.1. --- Beamforming --- p.2 / Chapter 1.4.2. --- Downlink Channel --- p.2 / Chapter 1.4.3. --- Single Cell --- p.3 / Chapter 1.5. --- Thesis Road Map --- p.3 / Chapter Chapter 2. --- Preliminaries of Cell Sectoring --- p.4 / Chapter 2.1. --- Introduction --- p.4 / Chapter 2.2. --- Beamforming --- p.4 / Chapter 2.2.1. --- Linear Array --- p.5 / Chapter 2.2.2. --- Circular Array --- p.8 / Chapter 2.2.3. --- Butler Beamforming Network --- p.9 / Chapter 2.2.4. --- Dynamic Beamforming --- p.10 / Chapter 2.3. --- Power Control --- p.16 / Chapter Chapter 3. --- Dynamic Cell Sectoring --- p.19 / Chapter 3.1. --- Introduction --- p.19 / Chapter 3.2. --- Minimum Total Transmission Power sectoring --- p.21 / Chapter 3.2.1. --- Problem Statement --- p.21 / Chapter 3.2.2. --- Shortest Path Problem Formulation --- p.23 / Chapter 3.2.3. --- Shortest Path Algorithm and Complexity --- p.26 / Chapter 3.2.4. --- Graph Reduction --- p.28 / Chapter 3.2.5. --- Example --- p.30 / Chapter 3.3. --- Power Equalization Sectoring --- p.33 / Chapter 3.3.1. --- Relationship Between MinTTP Sectoring and PE Sectoring --- p.33 / Chapter 3.3.2. --- Power Equalization Sectoring Algorithm --- p.36 / Chapter 3.4. --- Numerical Results --- p.37 / Appendix --- p.44 / Chapter Chapter 4. --- Resectoring Algorithms --- p.46 / Chapter 4.1. --- Introduction --- p.46 / Chapter 4.2. --- Nyquist Sampling Theorem --- p.47 / Chapter 4.3. --- MinTTP Resectoring --- p.47 / Chapter 4.4. --- PE Resectoring --- p.43 / Chapter 4.5. --- Handoff --- p.48 / Chapter 4.5.1. --- Handoff Load --- p.49 / Chapter 4.6. --- Performance --- p.49 / Chapter Chapter 5. --- Conclusion and Future Work --- p.53 / Chapter 5.1. --- Thesis Summary --- p.53 / Chapter 5.2. --- Future Work --- p.54 / Bibliography --- p.55

Cheung Shun Keung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 80-83). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- The Problem --- p.1 / Chapter 1.2 --- Overview of CDMA --- p.2 / Chapter 1.3 --- Problems Encountered in Direct-Sequence (DS)CDMA --- p.3 / Chapter 1.3.1 --- Multipath Fading Scenario in DS-CDMA Cellular Mo- bile Communication --- p.3 / Chapter 1.3.2 --- Near-Far Problem --- p.4 / Chapter 1.4 --- Delimitation and Significance of the Thesis --- p.5 / Chapter 1.5 --- Summary --- p.7 / Chapter 1.6 --- Scope of the Thesis --- p.8 / Chapter 2 --- Literature Review of Blind Space-Time Processing in a wire- less CDMA Receiver --- p.9 / Chapter 2.1 --- General Background Information --- p.9 / Chapter 2.1.1 --- Time Model of K-User Chip-Synchronous CDMA --- p.9 / Chapter 2.1.2 --- Dispersive Channel Modelling --- p.10 / Chapter 2.1.3 --- Combination of K-user CDMA Time Model with the Slow Frequency-Selective Fading Channel Model to form a completed Chip-Synchronous CDMA Time Model --- p.13 / Chapter 2.1.4 --- Spatial Channel Model with Antenna Array [9] --- p.15 / Chapter 2.1.5 --- Joint Space-Time Channel Model in Chip-Synchronous CDMA --- p.19 / Chapter 2.1.6 --- Challenges to Blind Space-Time Processing in a base- station CDMA Receiver --- p.23 / Chapter 2.2 --- Literature Review of Single-User-Type Detectors used in Blind Space-Time DS-CDMA RAKE Receivers --- p.25 / Chapter 2.2.1 --- A Common Problem among the Signal Processing Schemes --- p.28 / Chapter 3 --- "Novel ""Self-Decorrelation"" Technique" --- p.29 / Chapter 3.1 --- "Problem with ""Blind"" Space-Time RAKE Processing Using Single- User-Type Detectors" --- p.29 / Chapter 3.2 --- "Review of Zoltowski & Ramos[10,11,12] Maximum-SINR Single- User-Type CDMA Blind RAKE Receiver Schemes" --- p.31 / Chapter 3.2.1 --- Space-Time Data Model --- p.31 / Chapter 3.2.2 --- The Blind Element-Space-Only (ESO) RAKE Receiver with Self-Decorrelation Pre-processing Applied --- p.32 / Chapter 3.3 --- Physical Meaning of Self-Decorrelation Pre-processing --- p.35 / Chapter 3.4 --- Simulation Results --- p.38 / Chapter 4 --- """Fractional Self-Decorrelation"" Pre-processing" --- p.45 / Chapter 4.1 --- The Blind Maximum-SINR RAKE Receivers in Chen et. al.[l] and Wong et. al.[2] --- p.45 / Chapter 4.2 --- Fractional Self-Decorrelation Pre-processing --- p.47 / Chapter 4.3 --- The Blind Element-Space-Only (ESO) RAKE Receiver with Fractional Self-Decorrelation Pre-processing Applied --- p.50 / Chapter 4.4 --- Physical Meaning of Fractional Self-Decorrelation Pre-processing --- p.54 / Chapter 4.5 --- Simulation Results --- p.55 / Chapter 5 --- Complexity Analysis and Schematics of Proposed Techniques --- p.64 / Chapter 5.1 --- Computational Complexity --- p.64 / Chapter 5.1.1 --- Self-Decorrelation Applied in Element-Space-Only (ESO) RAKE Receiver --- p.64 / Chapter 5.1.2 --- Fractional Self-Decorrelation Applied in Element-Space- Only (ESO) RAKE Receiver --- p.67 / Chapter 5.2 --- Schematics of the Two Proposed Techniques --- p.69 / Chapter 6 --- Summary and Conclusion --- p.74 / Chapter 6.1 --- Summary of the Thesis --- p.74 / Chapter 6.1.1 --- The Self-Decorrelation Pre-processing Technique --- p.75 / Chapter 6.1.2 --- The Fractional Self-Decorrelation Pre-processing Tech- nique --- p.76 / Chapter 6.2 --- Conclusion --- p.78 / Chapter 6.3 --- Future Work --- p.78 / Bibliography --- p.80 / Chapter A --- Generalized Eigenvalue Problem --- p.84 / Chapter A.1 --- Standard Eigenvalue Problem --- p.84 / Chapter A.2 --- Generalized Eigenvalue Problem --- p.84

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