Computational origami: the folding of circuits and systems

Computational origami is an algorithm by which one can reshape another algorithm. This reshaping permits various time–hardware trade-offs to be explored. An algorithm, is first rearranged as feed forward with constant fan-in and fan-out. It is then regularized into certain predetermined geometries that break the lateral data dependencies. The result is then folded with the help of delay lines. This time–hardware trade-off technique is also applicable to the scheduling of multiple-instruction multiple-data parallel processors and bit serial VLSI designs.