A Swarm Intelligence Based Channelization Code Manipulation in WCDMA Networks for Avoiding Code Blocking


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


CDMA is the access method adopted in the third generation wireless system. In this method, every users share the same bandwidth at the same time but with different codes. In turn to increase capacity of the system in Commercial Wideband Code Division Multiple Access (WCDMA), channelization codes are used to protect the orthogonality between physical channels. In WCDMA, channelization code is obtained by conveying OVSF codes to different users. WCDMA can offer multi-rate service through OVSF codes which can be produced in the form of tree like structure called OVSF-CDMA. OVSF-CDMA network which has some constraint in which the system have to sustain the mutually independent between the assigned codes. Code blocking is mainly due to the orthogonality among the assigned OVSF codes. To result in high efficiency of code usage and to increase the capacity of the system, an efficient channelization code direction system is to be proposed in better way through optimization technique. Efficient PSO algorithm is an optimization technique used in dynamic code assignment scheme which in turn results in better code utilization and increasing system capacity. Experimental results show that the performance of the static and the dynamic or active OVSF code assignment schemes of call blocking probability and number of required call reassignment.
Copyright © Praise Worthy Prize - All rights reserved.

Keywords


WCDMA; Multi-Rate Service; Blocking Probability; Code Assignment

Full Text:

PDF


References


M. Sawahashi, K. Higuchi, S. Tanaka, and F. Adachi, “Enhanced wireless access technologies and experiments for W-CDMA communications,” IEEE Personal Communications, vol. 7, no. 6, pp. 6-17, Dec. 2000.

H. Hosseini, N. Fisal, S.K. Syed-Yusof, “Joint Channel Estimation and Power Allocation for Cognitive WPMCM UWB System”, International Review on Computers and Software, Vol. 6 N. 4, pp. 570-575, 2011.

A.J. Viterbi, “Very low rate convolution codes for maximum theoretical performance of spread-spectrum multiple-access channels,” IEEE J. Select. Areas in Commun., vol. 8, pp. 641-649, May 1990.

P. Komulainen and K. Pehkonen, “Performance evaluation of superorthgonal turbo codes in AWGN and flat Rayleigh fading channels,” IEEE J. Select. Areas in Commun., vol. 16, pp. 196- 205, Feb. 1998.

P. Frenger, P. Orten, and T. Ottosson, “Code-spread CDMA using maximum free distance low-rate convolutional codes,” IEEE Trans. on Commun., vol. 48, no. 1, pp. 135-144, Jan. 2000.

C.F. Leanderson, J. Hokfelt, O. Edfors, and T. Maseng, “On the design of low rate turbo codes,” in Proc. IEEE Vehicular Technology Spring Conf., Tokyo, May 2000.

C.F. Leanderson, O. Edfors, and T. Ottoson, “On the performance of turbo codes and convolutional codes of low rate,” in Proc. IEEE Vehicular Technology Conf., Amsterdam, pp. 1560- 1564, Sep. 1999.

M. Hendaoui, A. Benakcha, “Multi-User Reception for Radio Systems CDMA Mobile”, International Review on Computers and Software, Vol. 6 N. 1, pp. 122-125, 2011.

Dinan, E., B. Jabbari, 1998. Spreading Codes for Direct Sequence CDMA and Wideband CDMA Cellular Networks, IEEE Communications Magazine, vol. 36, pp. 48-54, DOI: 10.1109/35.714616.

Askari, M., R. Saadat, and M. Nakhkash, 2008. Assignment of OVSF Codes in Wideband CDMA, In Proc. CSICC2008, pp: 723-727, DOI: 10.1007/978-3-540-89985-3_89.

Adachi, F., M. Sawahashi, and K. Okawa, 1997, Tree structured generation of orthogonal spreading codes with different length for forward link of DS-CDMA mobile radio, Electronic Letters, vol. 33 (1), pp: 27-28, DOI: 10.1049/el:19970022.

Yang, Y., T.S. Yum, 2001. Maximally Flexible Assignment of orthogonal variable spreading factor codes for multi-rate Traffic, Technical Report, Department of Information Engineering, Hong Kong.

Minn, T., K. Y. Siu, 2000. Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA, IEEE Journal on Selected Areas in communications, pp: 1429–1440, DOI: 10.1109/49.864008.

Yang, Y., T.S. Yum, 2001. Maximally Flexible Assignment of orthogonal variable spreading factor codes for multi-rate Traffic, Technical Report, Department of Information Engineering, Hong Kong.

Chen, J.C., W. Chen, 2001. Implementation of an Efficient Channelization Code Assignment Algorithm in 3G WCDMA, Technical Report, Institute of computer Science, Taiwan.

Tseng, Y., C. Chao, 2002. Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management, IEEE transactions on mobile computing, 1(4), pp: 293-302, DOI: 10.1109/TMC.2002.1175542.

U. Deepak, “Optimization of Milling Operation Using Genetic and PSO Algorithm”, Bonfring International Journal of Software Engineering and Soft Computing, Volume : 1 Special Issue : Inaugural Special Issue, 2011.

Ling Yang, Wei Chen, “Application of PSO Algorithm to Portfolio Optimization Problem with Fuzzy Returns”, International Review on Computers and Software, Vol. 7 N. 2(Part B), pp. 855-861, 2012.

Al-Tabtabai H, Alex PA. “Using Genetic Algorithms to Solve Optimization Problems in Construction”, Eng Constr Archit Manage 1999;6(2):121–32.

Eberhart R, Shi Y. Comparison between genetic algorithms and particle swarm optimization. Proceedings of the 7th annual conference on evolutionary programming. Berlin: Springer; 1998. p. 611–8.

Kennedy J. The particle swarm: social adaptation of knowledge. Proceedings of the IEEE international conference on evolutionary computation (Indianapolis, Indiana). Piscataway, NJ: IEEE Service Center; 1997. p. 303–8.

Jiang Xu, Xi Zhao, “A PSO-based Creative Design Approach to Improve Aesthetic-Oriented Product Interface”, International Review on Computers and Software, Vol. 7 N. 3 (Part B), pp. 1221-1227, 2012.


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize