Results 241 to 250 of about 22,289,271 (287)
Some of the next articles are maybe not open access.

Discrete-Time Signals and Systems

2014
Abstract 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

On Totally Positive Discrete- Time Systems

2019 27th Mediterranean Conference on Control and Automation (MED), 2019
A 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), 1999
A 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

Discrete-Time Systems

2021
In the chapter, Discrete-time Systems, system classification, system response, system stability and realization of systems are presented. The discretization of continuous systems into discrete-time systems if first presented. Computation of the response of discrete-time systems by iteration, solving the difference equation and by convolution are ...
openaire   +2 more sources

Stability and linearization: discrete-time systems

2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), 2002
AbstractA theorem by Hadamard gives a two‐part condition under which a map from one Banach space to another is a homeomorphism. The theorem, while often very useful, is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met.
openaire   +4 more sources

Discrete-Time Queueing Systems and Their Networks

IEEE Transactions on Communications, 1980
Queueing 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

On Information-Lossless Discrete-Time Systems

IEEE Transactions on Computers, 1970
The 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 Systems

2017
The last chapter of the book is devoted to the study of discrete-time systems with input delays.
Michael Santina, Allen R. Stubberud
openaire   +2 more sources

Discrete-Time Systems

1991
A signal is defined as continuous within a time range if its amplitude is specified for all t in that range, except possibly at a finite number of discontinuities. If a continuous time variable is quantized, that is, if t is represented by a set of distinct values denoted by tk, where k takes on positive integer values exclusively, the signal is ...
openaire   +1 more source

Discrete-Time Systems

2009
M. Sami Fadali, Antonio Visioli
openaire   +1 more source

Home - About - Disclaimer - Privacy