Efficient state encoding algorithm based on hypercube construction

Author

Park, S.-S. ; Kyung, C.M. ; Hwang, S.H.

Author_Institution

Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea

Volume

142

Issue

3

fYear

1995

fDate

5/1/1995 12:00:00 AM

Firstpage

225

Lastpage

232

Abstract

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=log₂(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

Keywords

combinational circuits; computational complexity; encoding; finite state machines; hypercube networks; logic CAD; minimisation of switching nets; Boolean hypercube vertex coordinates; CPU time; SECH; combinational logic area minimization; finite-state machines; hypercube construction; state affinities; state encoding algorithm;

fLanguage

English

Journal_Title

Computers and Digital Techniques, IEE Proceedings -

Publisher

iet

ISSN

1350-2387

Type

jour

DOI

10.1049/ip-cdt:19951752

Filename

392509