Sciweavers

8 search results - page 1 / 2
» A Constant-Competitive Algorithm for Online OVSF Code Assign...
Sort
View
ISAAC
2007
Springer
121views Algorithms» more  ISAAC 2007»
14 years 5 months ago
A Constant-Competitive Algorithm for Online OVSF Code Assignment
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
14 years 2 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
STACS
2004
Springer
14 years 4 months ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
COMCOM
2004
130views more  COMCOM 2004»
13 years 10 months ago
An OVSF code assignment scheme utilizing multiple RAKE combiners for W-CDMA
Orthogonal variable spreading factor (OVSF) codes have been proposed as the channelization codes used in the wideband CDMA access technology of IMT-2000. OVSF codes have the advant...
Li-Hsing Yen, Ming-Chun Tsou
COCOON
2009
Springer
14 years 5 months ago
Online Tree Node Assignment with Resource Augmentation
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung...