國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Methodologies and tools for yield im...

Maidee, Pongstorn.

Methodologies and tools for yield improvement of field-programmable logic architectures.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Methodologies and tools for yield improvement of field-programmable logic architectures.
作者:	Maidee, Pongstorn.
面頁冊數:	160 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-01, Section: B, page: 0519.
附註:	Adviser: Kia Bazargan.
Contained By:	Dissertation Abstracts International71-01B.
標題:	Engineering, Computer.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3389341
ISBN:	9781109558296

Methodologies and tools for yield improvement of field-programmable logic architectures.
Maidee, Pongstorn.

Methodologies and tools for yield improvement of field-programmable logic architectures. - 160 p.

Source: Dissertation Abstracts International, Volume: 71-01, Section: B, page: 0519.

Thesis (Ph.D.)--University of Minnesota, 2009.

According to the international technology roadmap for semiconductors (ITRS) predictions, controlling manufacturing yield is going to be a challenging task in future technologies. It was shown that the effective yield of the future field programmable gate arrays (FPGAs) will be too low to make a profit [1]. Several FPGA yield improvement techniques have been proposed such as clustering, spare column and node covering. However, the challenges of future fabrication technologies are so great that these techniques cannot fully address high yield demands of the future. Thus, novel techniques should be explored.

ISBN: 9781109558296Subjects--Topical Terms:

384375
Engineering, Computer.

Methodologies and tools for yield improvement of field-programmable logic architectures.
LDR:05487nmm 2200361 4500 001 280760
005 20110119094947.5
008 110301s2009 ||||||||||||||||| ||eng d
020 $a 9781109558296
035 $a (UMI)AAI3389341
035 $a AAI3389341
040 $a UMI $c UMI
100 1 $a Maidee, Pongstorn. $3 492855
245 1 0 $a Methodologies and tools for yield improvement of field-programmable logic architectures.
300 $a 160 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-01, Section: B, page: 0519.
500 $a Adviser: Kia Bazargan.
502 $a Thesis (Ph.D.)--University of Minnesota, 2009.
520 $a According to the international technology roadmap for semiconductors (ITRS) predictions, controlling manufacturing yield is going to be a challenging task in future technologies. It was shown that the effective yield of the future field programmable gate arrays (FPGAs) will be too low to make a profit [1]. Several FPGA yield improvement techniques have been proposed such as clustering, spare column and node covering. However, the challenges of future fabrication technologies are so great that these techniques cannot fully address high yield demands of the future. Thus, novel techniques should be explored.
520 $a We propose three approaches for FPGA yield improvement in this thesis: one adds redundant components to the FPGA architecture to tolerate permanent faults. Another technique speeds up a synthesis technique used in a rewiring engine to allow for replacement or enforcement of faulty wires in a circuit. The third technique uses a search space pruning technique to speedup the optimization of FPGA architecture development. The proposed yield improvement techniques can be applied in conjunction with other existing techniques, resulting in an effective framework for FPGA yield improvement.
520 $a Chapter 2 addresses fault tolerant FPGA architectures that introduce redundancies in the architecture to replace faulty components. A methodology is proposed for estimating the effectiveness. Effectiveness of existing defect-tolerant schemes such as clustering, spare column and node covering for contemporary FPGA architectures. Furthermore, a number of new schemes to further improve yield are proposed in Chapter 2. Several techniques for tolerating defects in switch boxes were also introduced. The results show that the spare column scheme is very effective in maintaining a satisfactory yield. However, our studies show that to maintain reasonable yields, the number of spare columns must increase in the future. We also show that having redundancy for routing channels increases the absolute yield, but the benefit is outweighed by the area overhead for some types of routing channels. As a result, we show that redundancy must be judicially applied to the routing architecture to result in high yield numbers.
520 $a Chapter 3 addresses yield improvement at the synthesis level. Circuit rewiring is proposed in this thesis to enhance effectiveness of existing approaches, namely customization and design-specific approaches. The success of rewiring depends on both the quality and speed of the rewiring engine. Among several rewiring techniques that have been purposed, a Set-of-Pairs-of-Functions-to-be-Distinguished (SPFD)-based rewiring was shown to be more effective than the others both in theory and practice. However, due to its longer runtime, it is not a viable rewiring technique. A novel algorithm is proposed to avoid expressing SPFDs explicitly. Instead, a few satisfiability problem (SAT) instances are solved, allowing rewiring of one instance in the order of milliseconds. The experimental results show that our proposed technique's runtime is only a fraction of that of a conventional one and it scales well with the number of candidate wires considered. The existing SPFD-based rewiring approaches also limit where a new wire can be added. We present a theory that allows us to add a new wire virtually anywhere in the circuit structure. An algorithm based on this theory is also presented. Experiments show that the number of wires which can be rewired increases significantly and the number of alternate wires for a given wire also increases.
520 $a Chapter 4 deals with designing a family of FPGA chips. The goal of this chapter is to minimize area across a large number of designs. Minimizing area in turn helps improve yield. We formulate the family selection process as an FPGA family composition problem and propose an efficient algorithm for solving it. The formulation can capture an increasingly complex specialized functional block selection problem for FPGA families. The technique is applied to an architecture similar to Xilinx Virtex FPGAs. The results show that a smart composition technique can significantly reduce the expected silicon area. The benefit of providing specialized blocks can also be investigated using the technique and thus it can be used as an important tool for determining the benefits of specialized blocks for future FPGAs.
590 $a School code: 0130.
650 4 $a Engineering, Computer. $3 384375
650 4 $a Engineering, Electronics and Electrical. $3 226981
690 $a 0464
690 $a 0544
710 2 $a University of Minnesota. $b Electrical Engineering. $3 492856
773 0 $t Dissertation Abstracts International $g 71-01B.
790 1 0 $a Bazargan, Kia, $e advisor
790 1 0 $a Sobelman, Gerald $e committee member
790 1 0 $a Riedel, Marc $e committee member
790 1 0 $a Shragowitz, Eugene $e committee member
790 $a 0130
791 $a Ph.D.
792 $a 2009
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3389341