Energy consumption in multilective and boundary VLSI computations

A VLSI computation is said to be m-way multilective when each input bit is available m times in either space or time or both. The repeated availability of input bits can save computational energy. For a uniswitch m-way multilective computation, where a wire can switch at most once, it is shown that the energy savings can be as much as a factor of m. A multiswitch m-way multilective computation can save up to a factor of square root m switching energy. Tighter energy lower bounds are derived for a circuit with the input/output (I/O) pads located on the border. These boundary computations seem to cost an additional factor ranging from square root log n to log n in switching energy. The author extends the energy lower bounds for the multilective case, for a chip with aspect ratio a. The additional energy cost ranges from a factor of square root a to a factor of a.<
>