State smoothing and filtering using a constant memory for dynamic systems with nonlinear interference and missing obvservations (Q916628): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0016-0032(90)90013-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002801019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A suboptimum decoding-based smoothing algorithm for dynamic systems with or without interference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of data smoothing for linear and nonlinear dynamic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A view of three decades of linear filtering theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimal linear smoothing for systems with uncertain observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: State estimation for nonlinear discrete dynamic systems with missing observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convolutional codes II. Maximum-likelihood decoding / rank
 
Normal rank

Latest revision as of 09:52, 21 June 2024

scientific article
Language Label Description Also known as
English
State smoothing and filtering using a constant memory for dynamic systems with nonlinear interference and missing obvservations
scientific article

    Statements

    State smoothing and filtering using a constant memory for dynamic systems with nonlinear interference and missing obvservations (English)
    0 references
    0 references
    1990
    0 references
    The estimation of the state of a partially observed nonlinear discrete-time stochastic system by finite-state approximation is proposed. Previous schemes require an exponentially increasing memory with time. Here the state estimation is carried out in blocks so that its implementation requires only a constant memory. Numerical simulations are presented. No convergence property is discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite-state approximation
    0 references
    0 references