Reencoding for cycle-time minimization under fixed encoding length
Balakrishnan Iyer, Maciej J. Ciesielski · 1998
Abs/rucf-Thii paper presents effisient reerscoding and reayntfs-is algorithms for cycle-time mirdmtition of rnrdtilevel tiplensentatimrs of synchronom finite state machines @Shfs)under a tied encoding length.me proposed technique is appficahle to both gate-level and technology independent synchmnom network rep~enfstimrs.We pr~ent two algorithm for identifying srsefulreencmfbrgs-one is based on Boolmn cube reprwentation apptieafrle to technology independent ayrrchmrsmssnetworks and tbe other employs recursive learning techniques appmpfiate for gate ne~.We show that the proposed XOtixNOR based reencadbsg technique mplores a sufficientlyrich set of encodings to identify implementations with smalIer cycle-times.The Boolwn and stmctural interpretations of reencoding are explored and ik relationship to isomorphic sequentially redundant faults is presented.We afso show that the reencoded circuit always has a vatid initial state and present a simple procedureto deriveiL The effectiveness of the proposedtechniqueis iUnstratedon a largeset of benchmarkcircuitswhichindfratman averagecycle-timeimprovement of 15.26%for a smallam overbcadof336Yaoverthat ofperfomsance~rivencombbsatfmsal logicoptimizafiom