MPRA implementation of a 1-D decimation filter

The main objective of this work is to explore possible implementations of a given algorithm on a MPRA (multi-phase multi-rate array). We have used a 1-D decimation filter as an example. The method used is to transform (with unimodular matrices) the recurrence equations describing the MPRA. The main relevant parameter of interest is the delay to produce one datum. An attempt has also been made to discover the optimum implementation (i.e. the implementation with smallest delay to produce a datum with respect to our criteria) as well as implementations with delays equal to multiples of the optimum delay. These latter implementations may be of interest when cascading decimation filters.