Search

We study synchronization and consensus in a group of dynamical systems coupled via multiple directed networks. We show that even though the coupling in a single network may not be sufficient to synchronize the systems, combination of multiple networks can contribute to synchronization. We illustrate how the effectiveness of a collection of networks to synchronize the coupled systems depends on the graph topology. In particular, we show that if the graph sum is a directed graph whose reversal contains a spanning directed tree, then the network synchronizes if the coupling is strong enough. This is intuitive as there is a root node that influence every other node via a set of edges where each edge in the set is in one of the networks. [ABSTRACT FROM AUTHOR]

For a network of dynamical systems coupled via an undirected weighted tree, we consider the problem of which system to apply control, in the case when only a single system receives control. We abstract this problem into a study of eigenvalues of a perturbed Laplacian matrix. We show that this eigenvalue problem has a complete solution for arbitrarily large control by showing that the best and the worst places to apply control have well-known characterization in graph theory, thus linking the computational eigenvalue problem with graph-theoretical concepts. Some partial results are proved in the case when the control effort is bounded. In particular, we show that a local maximum in localizing the best place for control is also a global maximum. We conjecture in the bounded control case that the best place to apply control must also necessarily be a characteristic vertex and present evidence from numerical experiments to support this conjecture. [ABSTRACT FROM AUTHOR]

We study synchronization in an array of coupled nonlinear systems with delay and nonreciprocal time-varying coupling and present synchronization criteria which generalize previous synchronization results. We show that the array synchronizes when the nondelay coupling term is cooperative and large enough. Furthermore, we show that the synchronization criteria are related to several matrix quantities describing the coupling topology. These quantities can be considered as generalizations of the concept of algebraic connectivity to directed graphs. [ABSTRACT FROM AUTHOR]

Considers cellular neural/nonlinear networks (CNN) for efficient implementation of the most computationally intensive steps of dynamic image coding. Presentation of several CNN algorithms for the generation of binary image masks and image decomposition; Measurement results for the first CNN universal chips executing an analogic algorithm for a reconstruction operator.

Presents information on a study which proposed an approach for synthesizing a prescribed driving-point (DP) characteristics of a nonlinear resistor from the transfer characteristic (TC) of a two-port resistive element. Implementation of the TC-to-DP characteristic converter; Digital technique for synthesizing prescribed TC of two-port devices; Examples of DP characteristics synthesized by TC; Conclusions.

Investigates the possibility of coloring graphs with the use of synchronized coupled oscillators. Details on the coloring of 2-colorable graphs; Evaluation of the coloring of arbitrary connected graphs; Assessment of various complexity issues; Reference to the ability of Cellular Neural Networks to solve image processing problems.

Presents a study which examines the characteristics of quantized sampling as it relates to electric circuit analysis. How time and space is treated in engineering analysis; Methods and materials used in the study; Framework of quantized sampling.

Describes a torus-doubling phenomenon which was observed from four mutually coupled Chua's circuits while looking at coupled oscillators. What are coupled oscillators; Details on the qualitative dynamical behavior of the coupled system; Indepth look at the numerical simulation resulting from the system model.

Proposes a chaos-based secure communication scheme. Chaotic cryptosystem; Performance of the cryptosystem; Effects of parameter mismatch.

Presents the introductory editorial for this issue of the publication. [ABSTRACT FROM PUBLISHER]

The issue that you are holding represents a milestone for a new initiative called “Late Breaking News” (LBN). This is the inaugural Special Issue of IEEE Transaction on Circuits and Systems II (TCAS II), presenting the best work submitted to the LBN track of International Symposium on Circuits and Systems (ISCAS) 2016. The purpose of the LBN initiative is to recognize the quickly changing nature of innovation in circuits and systems. We believe that this poses a unique opportunity for the IEEE Circuits and Systems Society (CAS) to emerge as a forum in which innovations that cross boundaries and platforms from signal processing to architecture, and from theory to application, can all be evaluated holistically. With this in mind, we created the new effort of LBN to allow a small and elite set of the best and most timely new results in any given year to be presented at special sessions within ISCAS and then published in this special issue of TCAS II. We are delighted with the overwhelming response to the LBN call for papers. These papers were originally submitted as brief, one-page abstracts and a small subset were selected by a team of highly qualified reviewers and experts. The final selected papers were presented a few months later at ISCAS, giving audiences at ISCAS a chance to see very interesting work in a range of topics. For this year, the final sessions were organized around the following three themes: 1)

Emerging technologies and low-power subsystems; [ABSTRACT FROM PUBLISHER]

Presents the introductory editorial for this issue of the publication. [ABSTRACT FROM PUBLISHER]