By Topic

Energy consumption in multilective and boundary VLSI computations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Tyagi, A. ; Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA

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 √ 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 √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 √a to a factor of a

Published in:

Solid-State Circuits, IEEE Journal of  (Volume:26 ,  Issue: 9 )