No title
The problem of reducing the number of multiplications in infinite response filtering is considered. We show how this operation may be decomposed on finite response filtrations and so-named halfconvolutions. Examples of the efficient procedures for filters of low order are presented.
