loading
A sufficient condition for structural decouplability of linear nonsquare systems
1985 Edition, Volume 30, September 1, 1985 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This note presents a sufficient condition for structural decouplability of linear time-invariant nonsquare systems. Using graph representation for structured systems, the case of a square system (with m -inputs and m -outputs) is examined first. The...

Sufficient condition for a communication deadlock and distributed deadlock detection
1989 Edition, Volume 15, December 1, 1989 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The necessary and sufficient condition for deadlock in a distributed system and an algorithm for detection of a distributed deadlock based on the sufficient condition are formulated. The...

A Simple Sufficient Condition for Convergence of Projected Consensus Algorithm
Volume PP - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper studies the convergence property of the projected consensus algorithm. Under the assumption that i) the intersection of all constraint sets is nonempty, ii) the directed graph representing the communication among agents is time-invariant, strongly connected and aperiodic,...

Sufficient condition of extendibility for two-dimensional quadrant-symmetric autocorrelations
1987 Edition, Volume 35, May 1, 1987 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A sufficient condition for extendibility of two-dimensional (2-D) quadrant-symmetric measured correlations is derived via matrix decomposition. It is very simple to test whether such measured correlations satisfy this sufficiency condition because the test boils...

A mildly weaker sufficient condition in IIR adaptive filtering
1994 Edition, Volume 42, January 1, 1994 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The cross-covariance matrix of two stable autoregressive (AR) sequences is considered. A mildly weaker condition is identified that ensures the nonsingularity of this matrix. As one consequence of this result, a weaker sufficient condition is obtained that would...

A Necessary and Sufficient Condition for Consensus Over Random Networks
2008 Edition, Volume 53, April 1, 2008 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

We consider the consensus problem for stochastic discrete-time linear dynamical systems. The underlying graph of such systems at a given time instance is derived from a random graph process, independent of other time instances. For such a framework, we present...

A sufficient condition of nonergodicity of a Markov chain (Corresp.)
1979 Edition, Volume 25, July 1, 1979 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A natural and easily verifiable sufficient condition is given for the nonergodicity of a Markov chain. The result provides a converse to a theorem of Pakes and implies as special cases several recently published sufficient...

A sufficient condition for the stability of matrix polynomials
1989 Edition, Volume 34, May 1, 1989 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A sufficient condition is presented for the stability of the matrix polynomials based on algebraic properties of the matrix coefficients. The stability condition is derived from the Lyapunov theory by a multivariable feedback system that is...

Sufficient condition for invertibility of square FIR MIMO systems
2010 Edition, March 1, 2010 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

We derive a sufficient condition for a square FIR MIMO system to have a causal and stable IIR inverse. The condition requires that the spectral norm of the normalized channel impulse response (i.e., the first tap is the identity matrix) is...

A Necessary and Sufficient Condition for Generalized Demixing
2015 Edition, Volume 22, November 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Demixing is the problem of identifying multiple structured signals from a superimposed observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. We present a new solution to determine whether or not a...

Advertisement