The well-known Jazwinski's limited memory filter, Schweppe's finite memory filter, and Kwon's optimal finite impulse response (FIR) filter are compared in the filter structures, system models, and optimality criterions, and are shown to be equivalent on condition that they are applied to the discrete system with no process noise and unknown prior information of the system state. The different properties such as stability and computation burden are briefly discussed. Kwon's optimal FIR filter is shown to have some advantages in terms of stability and modeling constraints.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Equivalence of finite memory filters


    Contributors:
    Kwon, W.H. (author) / Suh, Y.S. (author) / Lee, Y.I. (author) / Kwon, O.K. (author)


    Publication date :

    1994-07-01


    Size :

    402569 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Equivalence of Finite Memory Filters

    Kwon, W.H. | Online Contents | 1994


    Homotopy Equivalence in Finite Digital Images

    Haarmann, J. | British Library Online Contents | 2015


    Fixed-Memory Filters

    Musoff, Howard / Zarchan, Paul | AIAA | 2009


    Fixed-Memory Filters

    Zarchan, Paul / Musoff, Howard | AIAA | 2015


    Pitch/Plunge Equivalence for Dynamic Stall of Swept Finite Wings

    Garmann, Daniel J. / Visbal, Miguel R. | AIAA | 2022