Pipeline-Driven Floorplanning Using TCG
Date Issued
2005
Date
2005
Author(s)
Tang, Kai-Fu
DOI
en-US
Abstract
To reduce clock period and facilitate sequential data transfer, it is desired to abut pipeline blocks one by one without predefined directions. In this thesis, we handle the floorplanning with pipeline constraints using the TCG representation. The TCG representation has been shown a flexible and efficient representation. We first explore the necessary conditions with pipeline constraints, and then propose algorithms that can guarantee a feasible floorplan with pipeline constraints during each operation. The experimental results have shown that our algorithm can obtain superior results compared to the method using the sequence-pair representation.
Subjects
電子設計自動化
平片規劃
Electronic Design Automation
Floorplanning
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92921033-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):9d94709323f5204aad39d85c2bfcf3d6