Algebraic Recurrence Transformations for Massive Parallelism

@inproceedings{Fettweis1993AlgebraicRT,
  title={Algebraic Recurrence Transformations for Massive Parallelism},
  author={Gerhard P. Fettweis},
  year={1993}
}
If an algorithm needs to he implemented for a high-speed application, a recursive loop is often found to he a bottleneck. Therefore, for some practical examples much work has been done so far to show how to transform single-step recursions into M-step recursions using socalled “look-ahead computations.” In this paper, we show that certain algebraic structures are sufficient for the operations of the loop, to allow the application of the well-knwn look-ahead computation. This provides a unifying… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Algorithm transformations for unlimited parallelism,

G. Fettweis, L. Thiele, H. Meyr
in Proc. IEEE Int. Symp. Circuits and Systems, • 1990

Fast block processing via new IIR digital filter structure

C. Nikias
IEEE Trans . Acoustics , Speech , Signal Proc . • 1989

High speed recursive digital filter realization

B. Shina
1989

Improving the iteration bound of finite state machines

D. Messerschmitt
Proc . Int . Symp . Circuits and Systems • 1989

On the hierarchical design of VLSI processor arrays

L. Thiele
Proc . IEEE Symp . Circuits and Systems ( ISCAS ) • 1988

Regular iterative algorithms and their implementation on processor arrays,

S. Rao, T. Kailath
Proc. IEEE, • 1988

Concurrent architectures for two - dimensional recursive filtering

D. Messerschmidt
Circuits and Syst . • 1984

Similar Papers

Loading similar papers…