Smoothing is a better tool for denoising at some past data point. Since the computational complexity of smoothing algorithms is usually not an issue in practice, their usefulness is appreciated in many areas of signal processing. This chapter discusses optimal finite impulse response (OFIR) smoothing techniques and problems by looking at and using various combinations of forward and backward models and filtering schemes. A simple and quite straightforward smoothing technique is fixed‐interval two‐filter smoothing . Smoothing solutions can be found mainly in post‐processing algorithms, although some real‐time estimators also incorporate smoothing procedures where the lag q does not introduce significant bias errors. Finite impulse response smoothing algorithms that operate with full block noise and error matrices are preferable in terms of accuracy over recursive schemes that are available when such matrices are diagonal.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal FIR Smoothing


    Contributors:


    Publication date :

    2022-08-09


    Size :

    29 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimal linear smoothing: continuous data case

    Lainiotis, D.G. | Tema Archive | 1973


    Optimal Control of Autonomous Vehicles for Traffic Smoothing

    Wang, Shian / Stern, Raphael / Levin, Michael W. | IEEE | 2022



    An Optimal Smoothing Technique for Altitude Using Radar Data

    Klosinski, Krista / Lauderbaugh, Ken / Slane, Jean et al. | AIAA | 2010