Results 241 to 250 of about 23,280,557 (293)
Some of the next articles are maybe not open access.
Invertibility of Discrete-Time Systems
IFAC Proceedings Volumes, 1992Abstract Formulae which permit the computation of the rank of discrete-time systems are given. We are utilizing some classical mathematical tools, such as the notion of filtrations and the associated Hilbert polynomials.
S. El Asml, M. Fliess
openaire +1 more source
Linearizing Discrete-Time Hybrid Systems
IEEE Transactions on Automatic Control, 2017Model-based design approaches for embedded systems aim at generating correct-by-construction control software, guaranteeing that the closed-loop system (controller and plant) meets given system level formal specifications. This technical note addresses control synthesis for safety and reachability properties of possibly nonlinear discrete-time hybrid ...
ALIMGUZHIN, VADIM +4 more
openaire +4 more sources
Discrete-Time Systems with the Decomposition Property
IEEE Transactions on Computers, 1970The decomposition property, a necessary condition for linearity, is defined for discrete-time systems. N-state machines with this property have finite memory μ≤N−1. Linear and autonomous systems are important classes of systems with decomposition. Several representations of systems with decomposition are given and a general form of the discrete-time ...
Keith L. Doty, Howard Frank
openaire +1 more source
Nonlinear Systems in Discrete Time
1986The paper deals with a survey presentation of recent results obtained in the area of nonlinear discrete time systems following an approach based on the functional expansions of the state and output behaviours.
MONACO, Salvatore, Normand Cyrot D.
openaire +2 more sources
Discrete-Time Signals and Systems
2014Abstract In this chapter we will investigate the fundamental topic of discrete-time signals and systems. We first introduce some basic and useful discrete-time signals, like the unit impulse, the sinusoidal and white Gaussian random sequences. Then we define and represent discrete-time systems.
Leonardo G. Baltar, Josef A. Nossek
openaire +1 more source
Resonance, 2000
Let us first consider the context of discrete-time systems. Input and output signals are no longer physical quantities, but sequences of dimensionless numbers. Having in mind a physical meaning behind a discrete-time signal, the physical quantity can always be recovered by multiplying the numbers of the sequence by a reference value of this quantity ...
A. Ramakalyan +2 more
+4 more sources
Let us first consider the context of discrete-time systems. Input and output signals are no longer physical quantities, but sequences of dimensionless numbers. Having in mind a physical meaning behind a discrete-time signal, the physical quantity can always be recovered by multiplying the numbers of the sequence by a reference value of this quantity ...
A. Ramakalyan +2 more
+4 more sources
On Totally Positive Discrete- Time Systems
2019 27th Mediterranean Conference on Control and Automation (MED), 2019A matrix is called totally positive (TP) if all its minors are positive. A linear time-varying system is called a totally positive discrete-time system (TPDTS) if the matrix defining its evolution is TP for all time. It was recently shown that this can be used to prove strong asymptotic properties of certain time-varying nonlinear discrete-time systems.
Rami Katz +2 more
openaire +2 more sources
On the robust stability of discrete-time systems
IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242), 1999A sufficient stability condition for monic Schur polynomials is obtained via the so-called reflection coefficients of polynomials and the discrete version of Kharitonov's weak theorem. The discrete Kharitonov theorem defines only (n - 1)-dimensional stable hyperrectangle for n-degree monic polynomials.
Ülo Nurges, Ennu Rüstern
openaire +2 more sources
On Information-Lossless Discrete-Time Systems
IEEE Transactions on Computers, 1970The concept of lossless state or system is generalized by the definition of k-losslessness. If k>N( N-1)/2 for an N-state machine, k-lossless implies lossless. The series connection of a set of discrete time systems {Ai}, where Ai is ki-lossless, results in a system which is min{ki}-lossless. This result is a simple verification of the intuitive notion
openaire +2 more sources
Discrete-Time Queueing Systems and Their Networks
IEEE Transactions on Communications, 1980Queueing systems in descrete time that can model certain computer communication systems are considered. First, a single-resource model consisting of a geometric server with feedback facility, to which packets arrive in independent bulks, is analyzed.
openaire +2 more sources