SMOOTH uses a vectorized implementation that may be slow when X and/or fr a me_LENGTH are very large. The number of elements that are used for calculation is length(X)*fr a me_LENGTH. The algorithm vectorizes the operation by creating a matrix of indexes and extracting its diagonals. E.g. for a vector of length 4 and fr a me_length of 2, the algorithm creates a temporary zero-padded matrix x2 from which it creates a set of indexes: