Laplacian spectrum analysis and spanning tree algorithm for circuit partitioning problems.pdfVIP

维普资讯 VoI．46No．6 SCIENCE INCHINA (SeriesF、 December2003 Laplacianspectrum analysisandspanningtree algorithm forcircuitpartitioningproblem s YANGHuazhong(杨华中)’＆HUGuanzhang(胡冠章)2 1．DepartmentofElectronicEngineering，TsinghuaUniversity，Beijing100084，China； 2．DepartmentofMathematicalScience，TsinghuaUniversity，Beijing100084，China CorrespondenceshouldbeaddressedtoYangHuazhong(email：yanghz@lsInghua．edu．cn) ReceivedFebrua~ 16，2003 Abstract Thespectrum ofagraph isthesetofalleigenvaluesoftheLaplacianmatrixofthegraph． There isaclosed relationship betweentheLaplacian spectrum ofgraphsand some propertiesofgraphs suchasconnectivity．In the recentyearsLaplacian spectrum ofgraphshasbeenwidelyapplied in many fields．TheapplicationofLaplacian spectrum ofgraphstocircuitpartitioning problem sisreviewed inthis paper．A new criterion ofcircuitpartitioning is proposed and the bounds ofthe partition ratio for weighted graphsarealso presented．Moreover，the deficiency ofgraph—partitioning algorithm sby Lapla— cian eigenvectorsisaddressed and an algorithm by m eansofthe m Inimalspanning tree ofa graph is proposed．Byvirtueoftaking thegraph structure into considerationthisalgorithm canfuIfillgeneralre— quirementsofcircuitpartitioning． Keywords：graphpartitioning，Laplacianspectrum ofagraph，partitionratio，spanningtreeofagraph． W ith theappearing ofsystem-on-a-chip，manynew problems，such assoftware-hradwrae partitioning，reusableIPbaseddesign，platform based design，andlow powerdesignetc．，raebe- comingmoreandmoredifficultbutcriticaltoelectronicdesignautomation．Alltheseproblems raeconcernedwiththepartitioningofweightedgraphs(eitherwithedgeweights，vertexweights， orboth)．Theweightedgraphsraemorecomplicated．Itiswellknownthatthecriterionofparti- tioning isofgreatimportancebywhichwecandiscriminatetheoptimalpartitionfrom others．In thispaperwewills