About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
MWSCAS 2004
Conference paper
On entropic aspects of VLSI designs
Abstract
In this paper, we revisit entropic aspects of modern VLSI designs. In particular, we discuss design guidelines for specific computation problems, considering issues associated with dynamic datapath multiplexing due to branching and sharing. We apply these design guidelines to parallel decoder designs of Reed-Solomon codes as an example and show that an appropriate choice of the decoding algorithm, without excess entropy generation in the datapath, results in a better implementation than algorithms that are more efficient just arithmetically. We expect that the present entropic considerations will become more important as the datapath becomes wider and more complex.