National Taiwan Ocean University Institutional Repository:Item 987654321/18114
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27454/39300
Visitors : 2533805      Online Users : 30
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item:

Title: 可重新安排二元樹交換網路之FPGA繞線架構
A Rearrangeable Binary Tree Switching Network for FPGA Routing Arcitecture
Authors: 陳儀珊
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: 可重新安排;二元樹;可重新安排交換網路
rearrangeable;binary tree;rearrangeable switching network
Date: 2009
Issue Date: 2011-07-04
Abstract: 繞線資源的結構在FPGA設計中是最關鍵的部份。在本論文中,我們第一個提出可重新安排二元數交換網路(rearrangeable binary tree switching network, BTSNU),且針對階層式的連接架構所使用。BTSNU主要包含了數個開關區塊(switch blocks)、連接閂(crossbars)。另外也有以clique架構為基礎,所衍伸的交換網路,BTSNC。既使與BTSNU有相同開關區塊數量,甚至每一個開關區塊內的開關個數相同的情況,BTSNC不會是一個可重新安排的交換網路。而在我們所提出的交換網路中,所需要的開關個數以N×ln(N)成比例,其中N為連接端點數量。近年來,這種類型的交換網路越來越成功的使用在繞線架構上。
Routing architecture is a very important task in FPGA. In this thesis, we first propose a rearrangeable binary tree switching network (BTSNU) for the hierarchical interconnection. The main component of this BTSNU consists of many switch blocks and crossbars. With the same size and the same number of switches as our BTSNU, a clique-based BTSNC switching network is shown not rearrangeable. We derive that a rearrangeable one-sided switching network with switches proportional to N×ln(N) is most suitable to interconnect N terminals. Besides, this polygonal switching network has been successfully applied to the design of routing architecture.
Appears in Collections:[Department of Computer Science and Engineering] Dissertations and Theses

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback