Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8419
Title: Top Down Code Search to Locate An Optimum Code and Reduction in Code Blocking for CDMA Networks
Authors: Saini, Davinder S.
Balyan, Vipin
Keywords: OVSF code
Code blocking
Spreading factor
Code assignment and reassignment
Issue Date: 2013
Publisher: Jaypee University of Information Technology, Solan, H.P.
Abstract: In this paper, a top down code search scheme is proposed that identify an optimum OVSF code for assignment at the base station of CDMA wireless networks. An optimum vacant code is the one whose usage produces least code blocking compared to other eligible codes. This scheme provides least code blocking compared to existing schemes without reassignments. In addition, the codes searched during locating the optimum code are significantly less than other existing schemes. The call establishment delay which is a significant factor for real time applications is directly proportional to the number of searches and should be low. The design is explained for single code, and extended to multi code assignment to improve code blocking. The multi code assignment is done using four ways. The first and second multi code schemes uses minimum and maximum rakes for a fixed rate system. The third scheme called scattered multi code scheme divide the incoming call into rate fractions equal to number of rakes available in the system, and each rate fraction is handled in a similar way in which the new call is handled in single code scheme. The rate fractions may be scattered or grouped in the code tree. The fourth multi code scheme, namely grouped multi code scheme allocates codes to all the fractions as close as possible. This maximizes future higher rate vacant codes availability by leaving a complete sub tree vacant when call using multi code ends.
URI: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8419
Appears in Collections:Journal Articles



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.