Learn More
In this paper, we investigate the disturbance attenuation properties of time-controlled switched systems consisting of several linear time-invariant subsystems by using a dwell time approach incorporated with piecewise Lyapunov functions. First, we show that when all subsystems are Hurwitz stable and achieve a disturbance attenuation level smaller than γ 0(More)
We study the stability properties of linear switched systems consisting of both Hurwitz stable and unstable subsystems using an average dwell time approach. We show that if the average dwell time is chosen sufficiently large and the total activation time of unstable subsystems is relatively small compared with that of Hurwitz stable subsystems , then(More)
In contrast to the usual types of neural networks which utilize two states for each neuron, a class of synchronous discrete-time neural networks with multilevel threshold neurons is developed. A qualitative analysis and a synthesis procedure for the class of neural networks considered constitute the principal contributions of this paper. The applicability(More)
A qualitative analysis is presented for a class of synchronous discrete-time neural networks defined on hypercubes in the state space. Analysis results are utilized to establish a design procedure for associative memories to be implemented on the present class of neural networks. To demonstrate the storage ability and flexibility of the synthesis procedure,(More)
We consider digital feedback control systems with time-varying sampling periods consisting of an interconnection of a continuous-time nonlinear plant, a nonlinear digital controller and appropriate interface elements between the plant and controller (A/D and D/A converters). For such systems we study the stability properties of an equilibrium (in the(More)
The authors present a new training algorithm to be used on a four-layer perceptron-type feedforward neural network for the generation of binary-to-binary mappings. This algorithm is called the Boolean-like training algorithm (BLTA) and is derived from original principles of Boolean algebra followed by selected extensions. The algorithm can be implemented on(More)