A study of bounds on limit cycles in digital filters (Q1908845): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Sandberg, Irwin W. / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: A. Akutowicz / rank
Normal rank
 
Property / author
 
Property / author: Sandberg, Irwin W. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: A. Akutowicz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:12, 5 March 2024

scientific article
Language Label Description Also known as
English
A study of bounds on limit cycles in digital filters
scientific article

    Statements

    A study of bounds on limit cycles in digital filters (English)
    0 references
    0 references
    0 references
    7 March 1996
    0 references
    Due to quantization errors, the state of a realization of a stable linear multivariable digital filter may tend to a limit cycle described by \[ x(n)= Ax(n- 1)+ u(n),\tag{1} \] where \(n\in \mathbb{N}\), \(x(0)= x_0\), \(A\) is stable, \(u(n)\) is T-periodic and is related to the equantization errors (and possibly to constant inputs), \(x(n)\) is T-periodic. After using the periodicity condition in (1), bounds for \(\max|x(n)|_2\) using the induced 2-norm or for \(|x(n)|\) (for all \(n\)) replacing the elements of the matrices or vectors involved by their absolute value, are given. Taking the discrete Fourier series representation of both sides in (1), allows to find the bound \[ |x|_{rms}\leq \overset l= {T}{\underset l= {1}\max} \Biggl|\Biggl(Id- \exp\Biggl(- i {2\pi l\over T}\Biggr) A\Biggr)^{- 1} \Biggr|_{i2} |u|_{rms}, \] where \(|x|^2_{rms}= {1\over T} \sum^{j= T}_{j= 1} x^t(j) x(j)\). A numerical comparison (when looking at the components of the vectors) in the 2-dimensional case shows that the last bound is the best and it improves previous results.
    0 references
    periodic
    0 references
    quantization errors
    0 references
    linear
    0 references
    digital filter
    0 references
    limit cycle
    0 references
    discrete Fourier series
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references