Optimum OVSF code reassignment in wideband CDMA forward radio link

Authors:
Fen-Fen Shueh;Wen-Shyen Eric Chen
Affiliations:
Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan, ROC;Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2005

Citing 5
Cited 5

CDMA: principles of spread spectrum communication

CDMA: principles of spread spectrum communication
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management

IEEE Transactions on Mobile Computing
An overview of CDMA evolution toward wideband CDMA

IEEE Communications Surveys & Tutorials
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA

IEEE Journal on Selected Areas in Communications
Supporting rate guarantee and fair access for bursty data traffic in W-CDMA

IEEE Journal on Selected Areas in Communications

A new adaptive genetic algorithm for fixed channel assignment

Information Sciences: an International Journal
The linear complexity of new generalized cyclotomic binary sequences of order four

Information Sciences: an International Journal
Cryptographic properties of some binary generalized cyclotomic sequences with the length p2

Information Sciences: an International Journal
On the linear complexity of some new q-ary sequences

Information Sciences: an International Journal
Trace representation of some generalized cyclotomic sequences of length pq

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper focuses on minimizing the code reassignment cost in Wideband CDMA forward link. The channel allocation of wireless links can be transformed into the Orthogonal Variable Spreading Factor (OVSF) code assignment problem. Orthogonality constraint in the OVSF code tree may prevent efficient resource utilization. Code reassigning process can achieve an average of 20% gain of system throughput. Minimizing the code reassignments is essential in reducing the complexity of the wireless system. We present the design methodology and implementation techniques of the proposed efficient algorithm MIN in optimizing the reassignment cost. The simulation result indicates that the MIN algorithm can reduce in average 60% of the reassignment cost compared to that of the heuristic method and it is feasible for implementing in Base Station or Radio Network Controller.