There have been many 2D (two–dimensional) VLSI structures introduced in the literature for 1D (one–dimensional) recursive digital filters with high throughput. The technique applied for the implementations is mainly based on block–state–variable filter descriptions. This paper introduces a high throughput systolic implementation of direct form second order recursive filters. The systolic structure has the advantages of regularity and modularity over implementations of the block–state–variable form, as it is regular and an n th order recursive filter is simply formed by cascading second order recursive filters. Therefore it is more suitable for the VLSI implementation. We first introduce an L × M systolic ring structure for the linear convolution equation Zi = � M j=0 wjxi−j. We show that the most efficient 1D systolic array for solving linear convolution problems is just a special case of our systolic ring structure with L = 1. Next we modify the recursive convolution equation yi = � 2 j=1 rjyi−j and construct a 2D structure for solving this problem; then we combine these two problems together to obtain our desired systolic architecture. After analyzing the modified algorithm, we see that, in some cases, the algorithm is sensitive to the effect of finite wordlenghth. We then derive a new algorithm which is insensitive to this source of error. The structure based on this new algorithm is similar to the old one, but its implementation takes more space. Finally we comment on the number of multiplications per output in our implementation and in the implementation of the block–state–variable form
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.