special issue on vlsi design and cad algorithm an efficient fpga technology mapping tightly

《special issue on vlsi design and cad algorithm an efficient fpga technology mapping tightly》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。

1、IEICETRANS.,VOL.,NO.1SpecialIssueonVLSIDesignandCADAlgorithmAnEcientFPGATechnologyMappingTightlyCoupledwithLogicMinimizationyyyyKangYi,SeongYongOhm,andChuShikJhon,NonmembersSUMMARYTheFPGAlogicsynthesisconsistsoflogicmin-reducetheimplementationeortsfortech

2、nologymap-imizationstepandtechnologymappingstep.Thesetwostepsping.Thetechnologymappingsteptransformstheareusuallyperformedseparatelytoreducethecomplexityofthenetworksothateachnodecanbeimplementedbyanproblem.Conventionallogicminimizationmethodstrytomin-FPGAb

3、asicblock,whileminimizinggivenobjectives.imizethenumberofliteralsofagivenBooleannetwork,whileTheobjectivesoftechnologymappingareareaand/orFPGAtechnologymappingtechniquesattempttominimizethenumberofbasicblocks.However,minimizingthenumberofliter-delayofthelog

4、iccircuits.als,whichistargetarchitecture-independentfeature,doesnotal-TherearesomeexistingMUX-basedFPGAlogicwaysleadtominimizationofbasicblockcount,whichisaFPGAsynthesissystems:mis-pga(old)[2],mis-pga(new)architecturespecicfeature.Therefore,mostoftheexisti

5、ngtech-[3],Amap[4],proserpine[5],andTOS[6].Mis-nologymappingsystemstakeintoaccountreorganizationofitsinputcircuitstogetbettermappingresults.Suchalooselycou-pga(old)andmis-pga(new)performresynthesisusingpledlogicsynthesisparadigmmaycausedicultiesinndingthe

6、BDD(BinaryDecisionDiagram)orITE(If-Then-Else)optimalsolution.graphforeachnodethatcannotbeimplementeddi-Inthispaper,weproposeanewlogicsynthesisapproachrectlybyanFPGAbasicblock.Mis-pga(new)giveswherelogicminimizationandtechnologymappingstepsareper-aspecialize

7、dexactBooleanmatchingalgorithmforformedtightlycoupled.OursystemtakesintoaccountFPGAspecicfeaturesinlogicminimizationstepandthusourtech-ACT1FPGAandproducesthebestresultsamongex-nologymappingstepdoesnotneedtoresynthesizetheBooleanistingmethods.Amaprepresents

8、thewholeBooleannetwork.WeformulatethetechnologymappingproblemasanetworkasanITEdatastructureandperformsmap-graphcoveringproblem.Suchformulationprovidesmoreglobalpinginagreedyfashion.Itisveryfastbutdoesn