國立高雄大學圖資館 |

Language: English

Back

Improvements to field-programmable g...

Ling, Andrew C.

Improvements to field-programmable gate array design efficiency using logic synthesis.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Improvements to field-programmable gate array design efficiency using logic synthesis.
Author:	Ling, Andrew C.
Description:	175 p.
Notes:	Source: Dissertation Abstracts International, Volume: 71-06, Section: B, page: 3849.
Contained By:	Dissertation Abstracts International71-06B.
Subject:	Engineering, Electronics and Electrical.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR61007
ISBN:	9780494610077

Improvements to field-programmable gate array design efficiency using logic synthesis.
Ling, Andrew C.

Improvements to field-programmable gate array design efficiency using logic synthesis. - 175 p.

Source: Dissertation Abstracts International, Volume: 71-06, Section: B, page: 3849.

Thesis (Ph.D.)--University of Toronto (Canada), 2009.

As Field-Programmable Gate Array (FPGA) capacity can now support several processors on a single device, the scalability of FPGA design tools and methods has emerged as a major obstacle for the wider use of FPGAs. For example, logic synthesis, which has traditionally been the fastest step in the FPGA Computer-Aided Design (CAD) flow, now takes several hours to complete in a typical FPGA compile. In this work, we address this problem by focusing on two areas. First, we revisit FPGA logic synthesis and attempt to improve its scalability. Specifically, we look at a binary decision diagram (BDD) based logic synthesis flow, referred to as FBDD, where we improve its runtime by several fold with a marginal impact to the resulting circuit area. We do so by speeding up the classical cut generation problem by an order-of-magnitude which enables its application directly at the logic synthesis level. Following this, we introduce a guided partitioning technique using a fast global budgeting formulation, which enables us to optimize individual "pockets" within the circuit without degrading the overall circuit performance. By using partitioning we can significantly reduce the solution space of the logic synthesis problem and, furthermore, open up the possibility of parallelizing the logic synthesis step.

ISBN: 9780494610077Subjects--Topical Terms:

226981
Engineering, Electronics and Electrical.

Improvements to field-programmable gate array design efficiency using logic synthesis.
LDR:02925nmm 2200253 4500 001 280826
005 20110119095003.5
008 110301s2009 ||||||||||||||||| ||eng d
020 $a 9780494610077
035 $a (UMI)AAINR61007
035 $a AAINR61007
040 $a UMI $c UMI
100 1 $a Ling, Andrew C. $3 492960
245 1 0 $a Improvements to field-programmable gate array design efficiency using logic synthesis.
300 $a 175 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-06, Section: B, page: 3849.
502 $a Thesis (Ph.D.)--University of Toronto (Canada), 2009.
520 $a As Field-Programmable Gate Array (FPGA) capacity can now support several processors on a single device, the scalability of FPGA design tools and methods has emerged as a major obstacle for the wider use of FPGAs. For example, logic synthesis, which has traditionally been the fastest step in the FPGA Computer-Aided Design (CAD) flow, now takes several hours to complete in a typical FPGA compile. In this work, we address this problem by focusing on two areas. First, we revisit FPGA logic synthesis and attempt to improve its scalability. Specifically, we look at a binary decision diagram (BDD) based logic synthesis flow, referred to as FBDD, where we improve its runtime by several fold with a marginal impact to the resulting circuit area. We do so by speeding up the classical cut generation problem by an order-of-magnitude which enables its application directly at the logic synthesis level. Following this, we introduce a guided partitioning technique using a fast global budgeting formulation, which enables us to optimize individual "pockets" within the circuit without degrading the overall circuit performance. By using partitioning we can significantly reduce the solution space of the logic synthesis problem and, furthermore, open up the possibility of parallelizing the logic synthesis step.
520 $a The second area we look at is the area of Engineering Change Orders (ECOs). ECOs are incremental modifications to a design late in the design flow. This is beneficial since it is minimally disruptive to the existing circuit which preserves much of the engineering effort invested previously in the design. In a design flow where most of the steps are fully automated, ECOs still remain largely a manual process. This can often tie up a designer for weeks leading to missed project deadlines which is very detrimental to products whose life-cycle can span only a few months. As a solution to this, we show how we can leverage existing logic synthesis techniques to automatically modify a circuit in a minimally disruptive manner. This can significantly reduce the turn-around time when applying ECOs.
590 $a School code: 0779.
650 4 $a Engineering, Electronics and Electrical. $3 226981
690 $a 0544
710 2 $a University of Toronto (Canada). $3 212652
773 0 $t Dissertation Abstracts International $g 71-06B.
790 $a 0779
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NR61007