Research Of Scrambling Code Optimization Algorithms In TD-SCDMA Wireless Network

With the development of science and technology, Field of mobilecommunications has already ushered in the era of3G.In this era of informationexplosion, arbitrary and diversity of communications have been the Requirements ofmobile communications Essentially. The third generation mobile communicationsystems support high-speed multi-types of business. It includes voice, data andmultimedia services and so on. Almost meet the needs of most users. For this reason,the third generation mobile communication systems are entering the commercial stagegradually.As one of them, TD-SCDMA system is also facing large-scale commercial. Butduring the period of operation, mobile communication network is bound to emerge avariety of failures and problems. By reading related materials, It will be given thathow to carry out the optimization of TD-SCDMA work from a theoretical point ofview in this paper. For example, it has introduced the significance, target, process andcontent of the TD-SCDMA optimization and how to analyze, locate and solve theproblem eventually when facing different types of failures and problems that mayarise in TD-SCDMA network.Knowledge of computing methods of modern optimization has been described inthe article. It included Simulated Annealing Algorithm and Genetic Algorithm.Corresponding improvement to the algorithms has been made on this base whichcombine Simulated Annealing Algorithm and Genetic Algorithm organically. It caneliminate the singularity of solutions from Genetic Algorithm as much as possible byintroducing the idea of simulated annealing during selecting operation of GeneticAlgorithm. Then, knowledge of the TD-SCDMA code resources has been describedand elaborate the significance of code resources optimization during the process ofTD-SCDMA network optimization. Design the executing process of optimization andallocation program of scrambling code on the base that the designing of optimizationand allocation strategy of TD-SCDMA code resources via combine the characteristicof TD-SCDMA code resources. Design the mathematical model of the work which need optimization and showthe target function in the basis of reading of information and the strategy and programof scrambling code optimization and allocation. Convert the real problem to thesolving of target function Finally, the combination of Simulated Annealing Algorithmand Genetic Algorithm highlight the advantages of both algorithms and avoid theshortcomings as much as possible. The completion of the experiment of code resourceoptimization on the TD-SCDMA system is under the help of the two class libraries.One is Genetic Algorithm Library, the other is Metaheuristics Library which includesSimulated Annealing Algorithm. One is Genetic Algorithm Library, the other isMetaheuristics Library which includes Simulated Annealing Algorithm. Show that thealgorithm can play a certain effect in the TD-SCDMA network optimization. However,the feasibility and rationality of designing of mathematical model, algorithm itself andthe process of algorithm executing and whether this process can apply in the realitystill need more research.