VLSI implementation of a shift-enabled reconfigurable array

We describe the implementation of a coarse-grain reconflgurable array that implements shift operations within its interconnection network. The connection point of such an array is a triangular matrix of switches. The reconflgurable array is geared toward the implementation of sequential Shift-and- Add algorithms. We show that a triangular switch-box that uses a level-restoring buffer with an unfolded multiplexer exhibits improved propagation delay and power consumption against prior art. This leads to a coarse-grain reconflgurable array that efficiently implements transcendental functions.