By Topic

Efficient state encoding algorithm based on hypercube construction

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 $33
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)
S. -S. Park ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea ; C. -M. Kyung ; S. -H. Hwang

Presents a new, efficient algorithm for the state encoding of finite-state machines which minimises the area of the combinational logic. The encoding problem is modelled as the construction of a hypercube, where the encoding of each state is given by the co-ordinate of the corresponding vertex of the D-dimensional Boolean hypercube [D=log2(number of states)]. The proposed state encoding scheme consists of computing the encoding affinities between states and placing states with strong encoding affinities closely in the hypercube. The algorithms are implemented as a program called SECH (State Encoding by Construction of Hypercube). Experimental results show that SECH yields more than 20% better results than NOVA (Villa et al., 1990) in a comparable CPU time, and about 10% better results than NOVA in about 1/200 of the CPU time

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:142 ,  Issue: 3 )