Smoothing and Prediction of Time Series by Cascaded Simple Averages

Optimum smoothing and prediction of sampled data frequently requires very large numbers of storage slots (for data and for multipliers), and correspondingly large numbers of multiplications and additions per computing cycle. Several schemes are available for reducing these numbers substantially, at a very small sacrifice in smoothing efficiency. One of these schemes is described in this article.