Dynamic Joint Code and Slot Allocation in Time-Division CDMA Systems

Dynamic Channel Allocation is an important part of the Radio Resource Management in CDMA/CDD systems. In this paper we propose a new algorithm for code and time-slot allocation method when a new user applies for resources. The new algorithm consists of 2-dimensional searching. A set of candidate slots is first selected from the available slots. Then the spreading code with smallest spreading factor in the candidate slots is selected and assigned to the new user. By the scheme, the algorithm jointly optimizes the allocation of code and time slot.

[1]  Guodong Zhang.  Dynamic permutation based time slot allocation for 3G WCDMA TDD systems , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[2]  Phone Lin,et al.  OVSF code channel assignment for IMT-2000 , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[3]  Ping Zhang,et al.  A novel TD-SCDMA fast DCA algorithm based on the positions of users , 2005, IEEE International Symposium on Communications and Information Technology, 2005. ISCIT 2005..

[4]  Yang Da-cheng,et al.  Research on Fast DCA Algorithms in TD-SCDMA Systems , 2006, 2006 International Conference on Wireless Communications, Networking and Mobile Computing.

[5]  Chengshu Li,et al.  Dynamic channel allocation in TD-SCDMA , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

[6]  Kai-Yeung Siu,et al.  Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA , 2000, IEEE Journal on Selected Areas in Communications.