Call elapsed time and reduction in code blocking for WCDMA networks

Authors:
Vipin Balyan;Davinder S. Saini
Affiliations:
Department of Electronics and Communication Engineering, Jaypee University of Information Technology, Distt. Solan, Himachal Pradesh;Department of Electronics and Communication Engineering, Jaypee University of Information Technology, Distt. Solan, Himachal Pradesh
Venue:
SoftCOM'09 Proceedings of the 17th international conference on Software, Telecommunications and Computer Networks
Year:
2009

Citing 4
Cited 3

Assignment and reassignment schemes for OVSF codes in WCDMA

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Maximally flexible assignment of orthogonal variable spreading factor codes for multirate traffic

IEEE Transactions on Wireless Communications
Wideband DS-CDMA for next-generation mobile communications systems

IEEE Communications Magazine
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA

IEEE Journal on Selected Areas in Communications

Reducing wastage capacity in OVSF based CDMA networks using dynamic rake combiners

WSEAS TRANSACTIONS on COMMUNICATIONS
Fair Single Code and Multi Code Designs for 3G and Beyond CDMA Systems

Wireless Personal Communications: An International Journal
Top Down Code Search to Locate An Optimum Code and Reduction in Code Blocking for CDMA Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

Traditional Orthogonal Variable Spreading Factor (OVSF) code assignment designs aim to reduce code blocking irrespective to the complexity and cost involved. We propose an OVSF code assignment scheme which reduces the complexity involved as compared to crowded first assignment scheme (which is one of the most popular single code assignment schemes). This is because the proposed scheme needs to check the immediate parent of the vacant code for code assignment. The crowded first scheme on the other hand checks all the ancestors of the vacant codes up to the root of the code tree. The code blocking performance can be inferior to the CFA design but the number of code searches (which decides the speed of the assignment design) is reduced considerably. Simulation results are demonstrated to show the superiority of the proposed design.