Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Wcdma for Umts
A New Modified Genetic Algorithm for Multiuser Detection in DS/CDMA Systems
Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
IEEE Transactions on Mobile Computing
Use of an evolutionary tool for antenna array synthesis
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Orthogonal variable spreading factor (OVSF) codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. Many works in the literature have intensively investigated to find an optimal dynamic code assignment scheme for OVSF codes. Unlike earlier studies, which assign OVSF codes using conventional (CCA) or dynamic (DCA) code allocation schemes, in this paper, stochastic optimization methods which are genetic algorithm (GA) and simulated annealing (SA) were applied which population is adaptively constructed according to existing traffic density in the OVSF code-tree. Also, the influences of the GA (selection, crossover and mutation techniques) and the SA (cooling schedules, number of inner loop) parameters were examined on the dynamic OVSF code allocation problem. Simulation results show that the GA and SA provide reduced code blocking probability and improved spectral efficiency when compared to the CCA and DCA schemes.