文档介绍：EDA()Day17SequentialLogicSynthesis(FSMOptimization)TodayStateEncoding“exact”two-levelheuristicmulti-levelFinite-StateMachineLogicalbehaviordependsonstateInresponsetoinputs,maychangestate1/00/0-/10/11/0FiniteStateMachine1/00/0-/10/11/00S1S111S1S201S2S200S2S301S3S310S3S31Problem:Real:pickstateencodings(si’s)soastominimizetheimplementationareatwo-levelmulti-levelSimplifiedvariantsminimizeproducttermsachievingminimumproductterms,minimizestatesizeminimizeliteralsTwo-LevelA=(2*inputs+outputs)*products+flops*wflopinputs=PIs+state_bitsoutputs=state_bits+POsproductsdependonstate-bitencodingMultilevelMoresharing->moncubesEffectsofmulti-levelminimizationhardtocharacterize(notpredictable)Two-LevelIdea:dosymbolicminimizationoftwo-levelformThisrepresentseffectsofsharingGenerateencodingconstraintsfromthisCoverSelectCodesTwo-mon-cube,next-stateexpressions[DeMicheli+Brayton+SV/TRCADv4n3p269]MultipleValuedInputSetTreatinputstatesasamulti-valued(notjust0,1)inputvariableEffectivelyencodeinone-hotformUsetomergetogetherinputstatesets0S1S111S1S201S2S200S2S301S3S310S3S310100S111100S201010S200010S301001S310001S31