
Theoretically, chaotic systems or chaotic maps have ideal complex dynamics. However, due to the finite precisions of the simulation software and digital devices, dynamic degradation and short period phenomenon will occur which is known as the finite precision effect. Thus, the short period phenomenon severely affects the performances of chaotic system in its application of secure communication and multimedia encryption etc. In this paper, the hash table is used to fast position the period of chaotic sequence, then calculate and analyze the relationships between computational precision and period length of digital chaotic systems. The experimental results show that the finite precision has a great influence on the periods of chaotic systems. The proposed method provides a quantitative analysis for the finite precision effect of the chaotic systems, which can aid designing the mechanisms to counteract the dynamic degradations and enhance the security performance.
Spread spectrum technique becomes one of the most important secure communication techniques in the recent decades. One of the most important parameter in spread spectrum is the spreading sequence, especially in the direct sequence spread spectrum. Due to the huge increase in the applications and the demanded users, the traditional spreading codes become not sufficient to fulfill the development requirements. As an alternative solution, the chaotic codes appeared to solve most problems of the traditional spreading codes. Recently, many researches focused on the chaotic codes, due to its attractive security properties, in addition to its availability to generate a huge number of spreading codes, which is very useful in the multi-access applications. However, as the number of the multiple access interference is increased, the performance of the chaotic codes is degraded. One of the degradation reasons is the assigning of the initial condition of the chaotic map. This paper presents a comprehensive statistical analysis of an improved and optimized chaotic sequence code. In addition to the traditional chaotic code; the analysis is performed over improved codes such as the self-balanced, the zero mean, and the self-balanced zero mean chaotic code. The spreading chaotic codes are generated from optimized maps with optimum initial conditions. The analysis consists of the balance, orthogonality, the normalized maximum autocorrelation side lobe, and the normalized average cross correlation property. In addition, the performance of the mentioned code is evaluated and compared with the Gold code for different code lengths over different fading channel.
Although lithium battery has the characteristics of high charge and discharge rate and energy density, its chemical activity is very high. Since the SOC of lithium battery cannot be directly tested, this paper presents a method of estimating the SOC of the battery by the T-S fuzzy neural network regression. Firstly, a T-S fuzzy neural network regression model was constructed. Take the battery voltage, battery current and battery temperature as the training input of the model, and take the corresponding SOC as the training output of the model. And then, used the T-S fuzzy neural network algorithm for model training . Finally, the training model was applied to the battery SOC estimation. The experimental results show that this method can estimate the SOC effectively, improve the estimation accuracy, and has high computational efficiency. This model may provide a theoretical reference for the model construction of future battery charge estimation system.
Network function vitalization (NFV) as a new research concept, for both academia and industry, faces many challenges to network operators before it can be accepted into mainstream. One challenge addressed in this paper is to find the optimal placement f or a set of incoming requests with VNF service chains to serve in suitable Virtual Machines (VMs) such that a set of conflicting objectives are met. Mainly, focus is placed on maximizing the total saving cost by increasing the total CPU utilization during the processing time and increasing the processing time for every service request in the cloud network. Moreover, we aim to maximize the admitted traffic simultaneously while considering the system constraints. We formulate the problem as a multi-objective optimization problem and use a Resource Utilization Multi-Objective Evolutionary Algorithm based on Decomposition (RU-MOEA/D) algorithm to solve the problem considering the two objectives simultaneously. Extensive simulations are carried out to evaluate the effects of the different network sizes, genetic parameters and the number of server resources on the acceptable ratio of the arrival chains to serve in the available VMs. The empirical results illustrate that the proposed algorithm can solve the problem efficiently and compute the optimal solution for two objectives together within a reasonable running time.