scispace - formally typeset
Journal ArticleDOI

Fast time-invariant implementations for linear least-squares smoothing filters

Reads0
Chats0
TLDR
In this article, a new solution for the fixed interval linear least-squares smoothing of a random signal, finite dimensional or not, inadditive white noise is presented, where the smoothed estimate for stationary processes is expressed entirely in terms of time-invariant causal and anticausal filtering operations.
Abstract
We present a new solution for the fixed interval linear least-squares smoothing of a random signal, finite dimensional or not, inadditive white noise. By using the so-called Sobolev identity of radiative transfer theory, the smoothed estimate for stationary processes is expressed entirely in terms of time-invariant causal and anticausal filtering operations; these are interpreted from a stochastic point of view as giving certain constrained (time-invariant) filtered estimates of the signal. Then by using a recently introduced notion of processes close to stationary, these results are extended in a natural way to general nonstationary processes. From a computational point of view, the representations presented here are particularly convenient, not only because time-invariant filters can be used to find the smoothed estimate, but also because a fast algorithm based on the so-called generalized Krein-Levinson recursions can be used to compute the time-invariant filters themselves.

read more

Citations
More filters
Book

Lectures on Wiener and Kalman Filtering

TL;DR: In this paper, the authors consider two random variables X, Y with a known joint density function fx,y(.,.). Assume that in a particular experiment, the random variable Y can be measured and takes the value y. What can be said about the corresponding value of the unobservable variable X?
Journal ArticleDOI

FIR filters and recursive forms for discrete-time state-space models

TL;DR: It is shown in this paper that impulse responses of both the FIR filter and the FIR smoother are easily obtained from Riccati-type difference equations for discrete-time state-space models with system noise.
Journal ArticleDOI

FIR filters and recursive forms for continuous time-invariant state-space models

TL;DR: In this paper, an FIR (finite impulse response) filter and an FIR smoother are introduced for continuous time-invariant state-space models, which can be easily determined by solving a simple Riccati-type matrix differential equation on a finite interval.

The factorization and representation of operators in the algebra generated by

TL;DR: In this article, the authors studied the factorization and representation of Fredholm operators belonging to the algebra R generated by inversion and composition of Toeplitz integral operators and derived a set of efficient algorithms (generalized fast-Cholesky and Levinson recursions) for factorization.
Journal ArticleDOI

Displacement operator based decompositions of matrices using circulants or other group matrices

TL;DR: It is shown how an arbitrary square matrix can be expressed as sums of products of circulant and upper or lower triangular Toeplitz matrices, and as sumsof products of matrices derived from finite groups (group matrices) and matrices which are “close” to group matrices.
References
More filters
Journal ArticleDOI

An exact recursion for the composite nearest‐neighbor degeneracy for a 2×N lattice space

TL;DR: In this paper, a set theoretic argument is used to develop a recursion relation that yields exactly the composite nearest-neighbor degeneracy for simple, indistinguishable particles distributed on a 2×N lattice space.
Journal ArticleDOI

A view of three decades of linear filtering theory

TL;DR: Developments in the theory of linear least-squares estimation in the last thirty years or so are outlined and particular attention is paid to early mathematica[ work in the field and to more modern developments showing some of the many connections between least-Squares filtering and other fields.
Journal ArticleDOI

An Algorithm for the Inversion of Finite Toeplitz Matrices

TL;DR: In this paper, an exact recursive procedure for numerical inversion of an arbitrary positive definite Toeplitz matrix of finite order was derived, which takes full advantage of the strong restrictions placed on its elements by (1.1), (1 2 ), and (1 3 ).
Journal ArticleDOI

Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials

TL;DR: In this article, the authors describe several interconnections between the topics mentioned in the title and show how some previously known formulas for inverting Toeplitz operators in both discrete and contirected setting can be used to obtain the same result.
Related Papers (5)