Combining State Assignment with PLA Folding
Chunduri Rama Mohan, P.P. Chakrabarti, S. Ghose · 2005
The problem of minimizing the area of a fwo-level implementation of a finite state machine(FSM comreduced to that of jindiyg suitable length encoding for the states, inputs land 0:utpuis of an FSM, such that the resultant area is minimized by pair-wise row folding and symbolic minimizafion. An algorithm is proposed for maximizing the number of pairwise row folds. Experimental resuli!s have ielded areas averaging 17% less fhan those of 1VOVA b].