An Algorithmic View on OVSF Code Assignment

Orthogonal Variable Spreading Factor (OVSF) codes are used in UMTS to share the radio spectrum among several connections of possibly different bandwidth requirements. The combinatorial core of the OVSF code assignment problem is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. A connection that uses a 2-d fraction of the total bandwidth requires some code at depth d in the tree, but this code assignment is allowed to change over time. Requests for connections that would exceed the total available bandwidth are rejected. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu propose the so-called DCA algorithm to solve the problem optimally. In contrast, we show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial-time greedy algorithm that achieves approximation ratio Θ(h). A more practically relevant version is the online code assignment problem, where future requests are not known in advance. Our objective is to minimize the overall number of code reassignments. We present a Θ(h)-competitive online algorithm, and show that no deterministic online algorithm can achieve a competitive ratio better than 1.5. We show that the greedy strategy (minimizing the number of reassignments in every step) is not better than Ω(h) competitive. We give a 2-resource augmented online algorithm that achieves an amortized constant number of (re-)assignments. Finally, we show that the problem is fixed-parameter tractabl

Implementation of a High-Performance Assignment Scheme for Orthogonal Variable-Spreading-Factor Codes in WCDMA Networks

[[abstract]]In WCDMA, channelization is achieved by assigning OVSF codes to different users. The codes in a Node-B are valuable and limited. Much research has been devoted to devising OVSF code-assignment strategies to support as many users as possible. A number of the strategies suffer from a “code-set fragmentation” problem, which increases the call blocking probability (CBP) on the Node-B. In order to resolve this issue some strategies have applied code-exchange and reassignment policies but increased the corresponding complexity. This paper proposes a Best-fit Least Recently Used (BLRU) code-assignment scheme without reassignment to approach an optimal method. Furthermore, we devise a revised version, Queue-assist BLRU (QBLRU), to improve system utilization and to obtain an even lower CBP than the optimal method does. Consequently, code-assignment simulation results present a QBLRU scheme that has a low CBP and the highest utilization, which is a high performance OVSF code-assignment scheme which should be useful for WCDMA networks

Maximally Flexible Assignment of Orthogonal Variable Spreading Factor Codes for Multi-Rate Traffic

In universal terrestrial radio access (UTRA) systems, orthogonal variable spreading factor (OVSF) codes are used to support different transmission rates for different users. In this paper, we first define the flexibility index to measure the capability of an assignable code set in supporting multirate traffic classes. Based on this index, two single-code assignment schemes, nonrearrangeable and rearrangeable compact assignments, are proposed. Both schemes can offer maximal flexibility for the resulting code tree after each code assignment. We then present an analytical model and derive the call blocking probability, system throughput and fairness index. Analytical and simulation results show that the proposed schemes are efficient, stable and fair

Improving 3G network throughput by new service and joint design.

Li Ning.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.Includes bibliographical references (leaves 52-55).Abstracts in English and Chinese.Acknowledgments --- p.iiAbstract --- p.iii哲學碩士論文摘要 --- p.ivChapter Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Research Background --- p.2Chapter 1.2 --- Contributions of the Thesis --- p.5Chapter 1.3 --- Organization of the Thesis --- p.6Chapter Chapter 2 --- Properties of OVSF Codes --- p.7Chapter 2.1 --- Tree-Structured Generation of OVSF Codes --- p.7Chapter 2.2 --- OVSF Codes Assignment --- p.10Chapter Chapter 3 --- Support Delayable Traffic in Wireless Networks --- p.14Chapter 3.1 --- System Model --- p.15Chapter 3.2 --- Scheduling Algorithm with Burst Adaptation --- p.17Chapter 3.3 --- Performance Analysis --- p.22Chapter 3.4 --- Simulation Results --- p.24Chapter Chapter 4 --- Allocate OVSF Codes with Joint Design --- p.30Chapter 4.1 --- Combine Number of Active Users and Error-Control Coding Scheme --- p.31Chapter 4.1.1 --- System Model --- p.31Chapter 4.1.2 --- Scheduling Algorithm Description --- p.33Chapter 4.1.3 --- Simulation Results --- p.35Chapter 4.2 --- Combine Power Adaptation and Error-Control Coding Scheme --- p.39Chapter 4.2.1 --- System Model --- p.39Chapter 4.2.2 --- Scheduling Algorithm Description --- p.41Chapter 4.2.3 --- Simulation Results --- p.44Chapter Chapter 5 --- Conclusion --- p.50Bibliography --- p.5

Code-division multiplexing

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 395-404).(cont.) counterpart. Among intra-cell orthogonal schemes, we show that the most efficient broadcast signal is a linear superposition of many binary orthogonal waveforms. The information set is also binary. Each orthogonal waveform is generated by modulating a periodic stream of finite-length chip pulses with a receiver-specific signature code that is derived from a special class of binary antipodal, superimposed recursive orthogonal code sequences. With the imposition of practical pulse shapes for carrier modulation, we show that multi-carrier format using cosine functions has higher bandwidth efficiency than the single-carrier format, even in an ideal Gaussian channel model. Each pulse is shaped via a prototype baseband filter such that when the demodulated signal is detected through a baseband matched filter, the resulting output samples satisfy the Generalized Nyquist criterion. Specifically, we propose finite-length, time overlapping orthogonal pulse shapes that are g-Nyquist. They are derived from extended and modulated lapped transforms by proving the equivalence between Perfect Reconstruction and Generalized Nyquist criteria. Using binary data modulation format, we measure and analyze the accuracy of various Gaussian approximation methods for spread-spectrum modulated (SSM) signalling ...We study forward link performance of a multi-user cellular wireless network. In our proposed cellular broadcast model, the receiver population is partitioned into smaller mutually exclusive subsets called cells. In each cell an autonomous transmitter with average transmit power constraint communicates to all receivers in its cell by broadcasting. The broadcast signal is a multiplex of independent information from many remotely located sources. Each receiver extracts its desired information from the composite signal, which consists of a distorted version of the desired signal, interference from neighboring cells and additive white Gaussian noise. Waveform distortion is caused by time and frequency selective linear time-variant channel that exists between every transmitter-receiver pair. Under such system and design constraints, and a fixed bandwidth for the entire network, we show that the most efficient resource allocation policy for each transmitter based on information theoretic measures such as channel capacity, simultaneously achievable rate regions and sum-rate is superposition coding with successive interference cancellation. The optimal policy dominates over its sub-optimal alternatives at the boundaries of the capacity region. By taking into account practical constraints such as finite constellation sets, frequency translation via carrier modulation, pulse shaping and real-time signal processing and decoding of finite-length waveforms and fairness in rate distribution, we argue that sub-optimal orthogonal policies are preferred. For intra-cell multiplexing, all orthogonal schemes based on frequency, time and code division are equivalent. For inter-cell multiplexing, non-orthogonal code-division has a larger capacity than its orthogonalby Ceilidh Hoffmann.Ph.D