New results on periodic symbolic sequences of second order digital filters with two’s complement arithmetic

In this article, the second order digital filter with two’s complement arithmetic in [1] is considered. Necessary conditions for the symbolic sequences to be periodic after a number of iterations are given when the filter parameters are at b=a+1 and b=-a+1. Furthermore, for some particular values of a, even when one of the eigenvalues is outside the unit circle, the system may behave as a linear system after a number of iterations and the state vector may toggle between two states or converge to a fixed point at the steady state. The necessary and sufficient conditions for these phenomena are given in this article

Synchronization in random networks with given expected degree sequences

Synchronization in random networks with given expected degree sequences is studied. We also investigate in details the synchronization in networks whose topology is described by classical random graphs, power-law random graphs and hybrid graphs when N goes to infinity. In particular, we show that random graphs almost surely synchronize. We also show that adding small number of global edges to a local graph makes the corresponding hybrid graph to synchroniz