CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Least Squares Order-Recursive Lattice Smoothers
Authors
John A. Stuller
Jenq Tay Yuan
Publication date
1 January 1995
Publisher
Scholars\u27 Mine
Doi
Cite
Abstract
Conventional Least Squares Order-Recursive Lattice (LSORL) Filters Use Present and Past Data Values to Estimate the Present Value of a Signal. This Paper Introduces LSORL Smoothers Which Use Past, Present and Future Data for that Purpose. Except for an overall Delay Needed for Physical Realization, LSORL Smoothers Can Substantially Outperform LSORL Filters While Retaining All the Advantages of an Order-Recursive Structure. © 1995 IEE
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Missouri University of Science and Technology (Missouri S&T): Scholars' Mine
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:scholarsmine.mst.edu:ele_c...
Last time updated on 12/06/2023