An Efficient Multicode Design for Real Time QoS Support in OVSF Based CDMA Networks

Orthogonal variable spreading factor (OVSF) codes are used for CDMA based networks to handle multimedia rates. While waiting time (or call establishment delay) is a significant QoS parameter for real time calls, its impact on non-real time calls is negligible. Traditionally, the call handling in OVSF based CDMA system has been accomplished with multi code approach, where the arriving call is divided into many quantized fractions and each fraction is handled by different code. These designs are very efficient for non-real time calls, but the code search corresponding to each fraction needs significant time that makes existing multi code approaches unsuitable for real time calls. This paper describes a novel multi code design, in which the waiting time for real time call is zero. The design initially assigns the incoming call to the vacant code with the capacity equal to call capacity, and subsequently looks for the vacant codes for each quantized fraction after code assignment. Once the vacant codes with capacities equal to the capacity of all rate fractions are available, the call is shifted to these codes. The information of this code assignment for every fraction needs to be sent to the receiver like existing schemes. Therefore, there is no additional hardware requirement for the proposed design. Simulation results show significant dominance of our scheme as compared to the existing multi code schemes.

[1]  Davinder S. Saini,et al.  Reduction in code blocking using scattered vacant codes for orthogonal variable spreading factor-based wideband code division multiple access networks , 2013, IET Commun..

[2]  Fumiyuki Adachi,et al.  Tree-structured generation of orthogonal spreading codes with different lengths for forward link of DS-CDMA mobile radio , 1997 .

[3]  Davinder S. Saini,et al.  Top Down Code Search to Locate An Optimum Code and Reduction in Code Blocking for CDMA Networks , 2014, Wirel. Pers. Commun..

[4]  Min-Xiou Chen Efficient integration OVSF code management strategies in UMTS , 2008, Comput. Commun..

[5]  Yuh-Ren Tsai,et al.  Quality based OVSF code assignment and reassignment strategies for WCDMA systems , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[6]  Yu-Chee Tseng,et al.  Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management , 2002, IEEE Trans. Mob. Comput..

[7]  M. Askari,et al.  The comparison of various code assignment schemes in Wideband CDMA , 2008, 2008 International Conference on Computer and Communication Engineering.

[8]  Davinder S. Saini,et al.  OVSF Code Sharing and Reducing the Code Wastage Capacity in WCDMA , 2009, Wirel. Pers. Commun..

[9]  Yang Yang,et al.  Multicode multirate compact assignment of OVSF codes for QoS differentiated terminals , 2005, IEEE Transactions on Vehicular Technology.

[10]  Davinder S. Saini,et al.  Vacant codes grouping and fast OVSF code assignment scheme for WCDMA networks , 2013, Telecommun. Syst..

[11]  Daniel C. Lee,et al.  Enhanced Fixed and Dynamic Code Assignment Policies for OVSF-CDMA Systems , 2003, International Conference on Wireless Networks.

[12]  Davinder S. Saini,et al.  Reducing code wastage in orthogonal variable spreading factor-based wideband code division multiple access networks , 2013, Int. J. Commun. Syst..

[13]  Lei Huang,et al.  Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems , 2008, IEEE Transactions on Vehicular Technology.

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

[15]  Davinder S. Saini,et al.  Multiple Rake Combiners and Performance Improvement in 3G and Beyond WCDMA Systems , 2009, IEEE Transactions on Vehicular Technology.

[16]  Yu-Chee Tseng,et al.  Reducing internal and external fragmentations of OVSF codes in WCDMA systems with multiple codes , 2005, IEEE Trans. Wirel. Commun..