Investigations on circuit level Evolutionary partitioning algorithms For vlsi physical design automation

dc.contributor.guideVaithianathan, V
dc.coverage.spatialInvestigations on circuit level Evolutionary partitioning algorithms For vlsi physical design automation
dc.creator.researcherPavithra guru, R
dc.date.accessioned2023-02-08T06:43:16Z
dc.date.available2023-02-08T06:43:16Z
dc.date.awarded2022
dc.date.completed2022
dc.date.registered
dc.description.abstractDesigning the circuit partitioning becomes extensively interconnect dominated and holds unmanageable difficulties; hence it is considered one of the pivotal optimization issues in Computer-aided Design (CAD) automation. The trait and the practicability of automatic placement, routing function and procedures are profoundly estimated on the partitioning quality solutions. Moreover, the present partitioning model techniques analyze and identify the pros and cons and recommend new effective partitioning techniques. This thesis presents the novel partitioning methods widely utilized in large scale designs, and the main goal is to enhance the partitioning solutions quality and feasibility. Primarily, a hmetis based circuit-partitioning presented that is emulated and directed by visual hierarchies. Then, a hypergraph partitioning (netlist) and a design hierarchy are logically utilized to partition the Kernighan-Lin (KL) algorithm. Furthermore, stability is defined as an additional measure in quality for partitioning solutions. And a modification based partitioning methodology is executed. newlineIn addition, the provided previous results on partitioning utilizing an original hypergraph (netlist) and mutated hypergraph (netlist), a novel cost function and a parallel factor are determined to generate partitions on a hyper graph, which is identical to the original partition. Thirdly, a new evolutionary-based partitioning approach is proposed that is aware of the minimum cut size and required interconnection: a novel and efficient evolutionary partitioning algorithm utilized based on Graph Cellular Automata (GCA). In the proposed GCA, the concept of graph theory combined with cellular automata theory is used to get an optimum solution newline
dc.description.note
dc.format.accompanyingmaterialNone
dc.format.dimensions21cm
dc.format.extentxvi,162p.
dc.identifier.urihttp://hdl.handle.net/10603/457219
dc.languageEnglish
dc.publisher.institutionFaculty of Information and Communication Engineering
dc.publisher.placeChennai
dc.publisher.universityAnna University
dc.relationp.150-161
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordEngineering and Technology
dc.subject.keywordEngineering
dc.subject.keywordEngineering Electrical and Electronic
dc.subject.keywordCircuit partitioning
dc.subject.keywordGraph cellular automata
dc.subject.keywordCut cost
dc.titleInvestigations on circuit level Evolutionary partitioning algorithms For vlsi physical design automation
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 12
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
53.55 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
2.02 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_content.pdf
Size:
182.72 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
173.76 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter 1.pdf
Size:
254.94 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: