In this paper, we consider a generalization of the MSM with a diagonal autoregressive linear stochastic model in Fourier space as a filter model for chaotic signals with long memory depth. With this generalization, the filter prior model becomes slightly more expensive than the MSM, but it is still less expensive relative to integrating the perfect model which is typically unknown in real problems. Furthermore, the associated Kalman filter on each Fourier mode is computationally as cheap as inverting a matrix of size , where is the number of observed variables on each Fourier mode (in our numerical example, ). Using the Lorenz 96 (L-96) model as a testbed, we show that the non-Markovian nature of this autoregressive model is an important feature in capturing the highly oscillatory modes with long memory depth. Second, we show that the filtering skill with autoregressive models supersedes that with MSM in weakly chaotic regime where the memory depth is longer. In strongly chaotic regime, the performance of the AR(p) filter is still better or at least comparable to that of the MSM. Most importantly, we find that this reduced filtering strategy is not as sensitive as standard ensemble filtering strategies to additional intrinsic model errors that are often encountered when model parameters are incorrectly specified.