Improvement of statistical complexity to measure the complexities of two-dimensional arrays

In order to quantitatively describe the complexity of traffic flow system,hence two eigen indexes of nonlinear dynamics,ie approximate entropy and statistical complexity were introduced.

In order to quantitatively describe the complexity of traffic flow system,the paper analyzed the traffic flow complexity on road based on introducing the statistical complexity and its property.

Based on this property,the definition of k-error intensive statistical complexity is presented and two basic properties of it are proved in this paper,which can be used to measure the stability of complexity of chaos-based pseudorandom sequences.

Low computation complexity and fast convergence Caponspectral estimation algorithm;

Relationship between quantity of BP network hiding nodes and computation complexity;

A fast inter mode decision algorithm is proposed to reduce the computation complexity of mode deci- sion procedure during coding process.

The introduction of independent slice and adaptive selection of reference frame modes greatly contribute to the increase of coding efficiency as well as the reduction of computational complexity of the method.

Aiming at the computational complexity of particle filtering in blind multi-user detection,a new fast algorithm for blind multi-user detection based on auxiliary particle filtering is developed.

The high computational complexity restricts the application of STTC.

By the way,layered clustering methods have more high computing complexity and are not suiting to large number of samples.

Furthermore, a novel suboptimal MA Greedy algorithm based on demand function has been proposed to reduce the computing complexity with subscribers\' fairness and QoS guaranteed.

In this study, concepts of ‘process based complexity’ and ‘design based complexity’ were introduced and the correlation between the complexities and assembly defect rates were validated based on field data.