Date store management in sliding window based on-line identification algorithms

Sliding window identification algorithms use information from a store of data to optimise on-line learning. A key element of this process is data store management. This paper provides a brief overview of several sliding window algorithms used in on-line identification. Various data store methods are then proposed. A new pre-window filtering strategy is also introduced. Simulation results demonstrate the potential of the approaches considered.