By Topic

A semi-Gray encoding algorithm for low-power state assignment

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
$33 $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

3 Author(s)
Chunhong Chen ; Dept. of Electr. & Comput. Eng., Windsor Univ., Ont., Canada ; Jiang Zhao ; M. Ahmadi

In sequential circuit synthesis, state encoding is to assign binary codes to given symbolic states such that a specific objective function such as area or power dissipation can be minimized in the final implementation. For low power design, reducing the switching activity of state bits is of special interest. In this paper we present a near-optimal semi-Gray encoding technique to minimize the switching activity for any given state transition graphs. Experiments with standard benchmarks show that there is a significant improvement over previous algorithms in terms of both speed and result quality.

Published in:

Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on  (Volume:5 )

Date of Conference:

25-28 May 2003