DocumentCode :
533271
Title :
Immediate neighbor assignment and reduction in code blocking for OVSF-WCDMA
Author :
Balyan, Vipin ; Saini, Davinder S.
Author_Institution :
Dept. of Electron. & Commun. Eng., Jaypee Univ. of Inf. Technol., Waknaghat, India
fYear :
2010
fDate :
23-25 Sept. 2010
Firstpage :
155
Lastpage :
159
Abstract :
Code blocking is a major problem in Orthogonal Variable Spreading factor (OVSF) codes. Low rates are scattered in code tree which leads to more code blocking for high rate users. The paper proposes an immediate neighbor busy code design which leads to less code blocking to different user rates, utilizing full capacity of parent codes. For a new call, the vacant code is optimum if the most of the capacity under the parent of the vacant code is already utilized. Subsequently the code is picked from the crowded part of the code tree. This ultimately creates lot of vacant portion in the code tree for higher rate calls. Our system architecture and code assignment strategy provides significant improvement in number of code searches (call processing delay) and complexity. Simulation results are demonstrated to show the superiority of the proposed design as compared to other existing schemes.
Keywords :
block codes; channel allocation; code division multiple access; orthogonal codes; trees (mathematics); OVSF codes; WCDMA; code assignment strategy; code blocking; code searches; code tree; immediate neighbor assignment; orthogonal variable spreading factor; Algorithm design and analysis; Codecs; Complexity theory; Delay; Multiaccess communication; Real time systems; Spread spectrum communication; OVSF codes; WCDMA; code assignment; code blocking; code searches; crowded first assignment;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software, Telecommunications and Computer Networks (SoftCOM), 2010 International Conference on
Conference_Location :
Split, Dubrovnik
Print_ISBN :
978-1-4244-8663-2
Electronic_ISBN :
978-953-290-004-0
Type :
conf
Filename :
5623612
Link To Document :
بازگشت