Characterization of discrete linear shift-invariant systems (original) (raw)
Related papers
A Unifying Analysis of Shift Operators on a Graph
2019
The maximum entropy principle is employed to introduce a general class of shift operators (GSO) for random signals on a graph. By virtue of the assumed probabilistic framework, the proposed GSO is shown to be both bounded and to exhibit the desired property of asymptotic power preservation over graph shifts. For rigour, the sensitivity of the GSO to a graph topology misspecification is also addressed. The advantages of the proposed operator are demonstrated in a real-world multi-sensor signal average setting.
Generalized Shift-Invariant Systems
Constructive Approximation, 2005
A countable collection X of functions in L 2 (IR d) is said to be a Bessel system if the associated analysis operator T * X : L 2 (IR d) → 2 (X) : f → (f, x) x∈X is well-defined and bounded. A Bessel system is a fundamental frame if T * X is injective and its range is closed. This paper considers the above two properties for a generalized shift-invariant system X. By definition, such a system has the form X = ∪ j∈J Y j , where each Y j is a shift-invariant system (i.e., is comprised of lattice translates of some function(s)) and J is a countable (or finite) index set. The definition is general enough to include wavelet systems, shift-invariant systems, Gabor systems, and many variations of wavelet systems such as quasi-affine ones and non-stationary ones. The main theme of this paper is the 'fiberization' of T * X , which allows one to study the frame and Bessel properties of X via the spectral properties of a collection of finite-order Hermitian non-negative matrices.
tuiasi.ro
The existence of important connections between the dynamics of discrete-time linear systems and matrix algebra is well-known even at the level of undergraduate courses dealing with state-space models. Nevertheless the emphasis is traditionally placed on the eigenvalues and their location in the complex plane as a standard instrument for stability tests. Concomitantly one can say that another tool, equally relevant for the dynamics analysis, remains almost hidden; we refer to the use of matrix norms that support investigations complementary to the eigenvalue-based ones. This paper develops a systematic construction that discusses, in parallel, the significance of the mathematical results expressed in terms of eigenvalue location and matrix-norm inequalities, respectively. Our discussion covers discrete-time linear dynamics described by both single and polytopic state-space representations.
On the time invariance of linear systems
ABSTRACT In this paper we revise the concept of time invariance of a system, using exclusively a time domain approach. To this aim, we adopt a group theoretical formulation which let us recognize that the concept of time invariance is truly confined to a few possible cases. This depends on the fact that, for a general multirate linear system, the shift invariance property depends not only on the kernel, but also on the input and output domains.
On similarity classes of discrete-time Floquet transformations
American Control Conference, 2009
This paper considers discrete-time Floquet transformations, by which a discrete-time periodic linear system can be transformed to a time-invariant one. The previous researches have made clear when a discrete-time periodic system has its Floquet transformations and also it is known that the system has a lot of Floquet transformations if it has one. This paper defines three new similarities between
Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
Sampling Theory, Signal Processing, and Data Analysis, 2022
Polynomial graph filters and their inverses play important roles in graph signal processing. In this paper, we introduce the concept of multiple commutative graph shifts and polynomial graph filters, which could play similar roles in graph signal processing as the one-order delay and finite impulse response filters in classical multi-dimensional signal processing. We implement the filtering procedure associated with a polynomial graph filter of multiple shifts at the vertex level in a distributed network on which each vertex is equipped with a data processing subsystem for limited computation power and data storage, and a communication subsystem for direct data exchange only to its adjacent vertices. In this paper, we also consider the implementation of inverse filtering procedure associated with a polynomial graph filter of multiple shifts, and we propose two iterative approximation algorithms applicable in a distributed network and in a central facility. We also demonstrate the effectiveness of the proposed algorithms to implement the inverse filtering procedure on denoising time-varying graph signals and a dataset of US hourly temperature at 218 locations.
17 On the Network Analysis of the State Space of Discrete Dynamical Systems.pdf
This paper discusses the letter entitled "Network analysis of the state space of discrete dynamical systems" by A. Shreim et al. [Phys. Rev. Lett. 98, 198701 (2007)]. We found that some theoretical analyses are wrong and the proposed indicators based on two parameters of the state-mapping network cannot discriminate the dynamical complexity of the discrete dynamical systems composed of a 1D cellular automata.