Sampled-data sliding mode observer for robust fault reconstruction: A time-delay approach

A sliding mode observer in the presence of sampled output information and its application to robust fault reconstruction is studied. The observer is designed by using the delayed continuous-time representation of the sampled-data system, for which sufficient conditions are given in the form of linear matrix inequalities (LMIs) to guarantee the ultimate boundedness of the error dynamics. Though an ideal sliding motion cannot be achieved in the observer when the outputs are sampled, ultimately bounded solutions can be obtained provided the sampling frequency is fast enough. The bound on the solution is proportional to the sampling interval and the magnitude of the switching gain. The proposed observer design is applied to the problem of fault reconstruction under sampled outputs and system uncertainties. It is shown that actuator or sensor faults can be reconstructed reliably from the output error dynamics. An example of observer design for an inverted pendulum system is used to demonstrate the merit of the proposed methodology compared to existing sliding mode observer design approaches

Effective synchronization of a class of Chua's chaotic systems using an exponential feedback coupling

In this work a robust exponential function based controller is designed to synchronize effectively a given class of Chua's chaotic systems. The stability of the drive-response systems framework is proved through the Lyapunov stability theory. Computer simulations are given to illustrate and verify the method.Comment: 12 pages, 18 figure

Sliding mode adaptive state observation for time-delay uncertain nonlinear systems

In this paper a method to design robust adaptive sliding mode observers (ASMO) for a class of nonlinear time- delay systems with uncertainties, is proposed. The objective is to achieve insensitivity and robustness of the proposed sliding mode observer to matched disturbances. A novel systematic design method is synthesized to solve matching conditions and compute observer stabilizing gains. The Lyapunov-Krasovskii theorem is employed to prove the ultimate stability with arbitrary boundedness radius of the estimation error of the proposed filter. Finally, the ability of ASMO for fault reconstruction is studied

Orthogonal Codes for Robust Low-Cost Communication

Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which exhibit uncertainties in their input-output statistical relationships. A minimax formulation is adopted to attain robustness. First, a class of achievable rates per unit cost (ARPUC) is derived, and its utility is demonstrated through several representative case studies. Second, when the uncertainty set of channel transition statistics satisfies a convexity property, optimization is performed over the class of ARPUC through utilizing results of minimax robustness. The resulting CPUC lower bound indicates the ultimate performance of the orthogonal coding scheme, and coincides with the CPUC under certain restrictive conditions. Finally, still under the convexity property, it is shown that the CPUC can generally be achieved, through utilizing a so-called mixed strategy in which an orthogonal code contains an appropriate composition of different nonzero-cost input symbols.Comment: 2nd revision, accepted for publicatio