Uniform Non-Bernoulli Sequences Oriented Locating Method for Reliability-Critical Gates

Hardening reliability-critical gates in a circuit is an important step to improve the circuit reliability at a low cost.However,accurately locating the reliability-critical gates is a key prerequisite for the efficient implementation of the hardening operation.In this paper,a probabilistic-based calculation method developed for locating the reliabilitycritical gates in a circuit is described.The proposed method is based on the generation of input vectors and the sampling of reliability-critical gates using uniform non-Bernoulli sequences,and the criticality of the gate reliability is measured by combining the structure information of the circuit itself.Both the accuracy and the efficiency of the proposed method have been illustrated by various simulations on benchmark circuits.The results show that the proposed method has an efficient performance in locating accuracy and algorithm runtime.

Bipartite asynchronous impulsive tracking consensus for multi-agent systems

In this study,we discuss how multi-agent systems(MASs)with a leader can achieve distributed bipartite tracking consensus using asynchronous impulsive control strategies.The proposed asynchronous impulsive control approach does not require the impulse to occur simultaneously for all agents.The communication links between neighboring nodes of MASs are antagonistic.When the leader’s control input is non-zero,sufficient conditions are obtained to achieve bipartite asynchronous impulsive tracking consensus in closed-loop MASs.More extensive ranges of asynchronous impulsive effects are discussed,and the designed controller’s feedback can effectively work against adverse impulsive permutation.Simple algebraic conditions for estimating the impulsive gain boundary and asynchronous impulsive interval are presented.Theoretical results are demonstrated with illustrative examples.

A joint image compression and encryption scheme based on a novel coupled map lattice system and DNA operations

In this paper,an efficient image encryption scheme based on a novel mixed linear–nonlinear coupled map lattice(NMLNCML)system and DNA operations is presented.The proposed NMLNCML system strengthens the chaotic characteristics of the system,and is applicable for image encryption.The main advantages of the proposed method are embodied in its extensive key space;high sensitivity to secret keys;great resistance to chosen-plaintext attack,statistical attack,and differential attack;and good robustness to noise and data loss.Our image cryptosystem adopts the architecture of scrambling,compression,and diffusion.First,a plain image is transformed to a sparsity coefficient matrix by discrete wavelet transform,and plaintext-related Arnold scrambling is performed on the coefficient matrix.Then,semi-tensor product(STP)compressive sensing is employed to compress and encrypt the coefficient matrix.Finally,the compressed coefficient matrix is diffused by DNA random encoding,DNA addition,and bit XOR operation.The NMLNCML system is applied to generate chaotic elements in the STP measurement matrix of compressive sensing and the pseudo-random sequence in DNA operations.An SHA-384 function is used to produce plaintext secret keys and thus makes the proposed encryption algorithm highly sensitive to the original image.Simulation results and performance analyses verify the security and effectiveness of our scheme.