Data Path Synthesis in Field Programmable Gate Arrays
碩士 === 國立交通大學 === 電子研究所 === 81 === In this thesis, we proposed and implemented some procedures to do the data path synthesis in Field Programmable Gate Arrays (FPGAs). This thesis involves the following issues : (1). How to build and select...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Online Access: | http://ndltd.ncl.edu.tw/handle/27866826707734970764 |
id |
ndltd-TW-081NCTU0430102 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-081NCTU04301022016-07-20T04:11:37Z http://ndltd.ncl.edu.tw/handle/27866826707734970764 Data Path Synthesis in Field Programmable Gate Arrays 用戶可程式邏輯閘陣列之資料流合成器 Wei-Chang Tsai 蔡維昌 碩士 國立交通大學 電子研究所 81 In this thesis, we proposed and implemented some procedures to do the data path synthesis in Field Programmable Gate Arrays (FPGAs). This thesis involves the following issues : (1). How to build and select the cell library. (2). The input format. (3). To select the intermediate representation. (4). The algorithm of cell placement. (5). Select the routing algorithm and routability analysis. (6). Algorithm of pin assignment. (7). Transfer the result to the Xilinx's format. Due to the bit sliced nature of the data path,the two dimensional placing and routing problem of symmetrical architecture is reduced to a one dimensional one. We studied and implemented several placement algorithms and compared results. The router is using a modified version of a previously published method called Coarse graph expansion (CGE).The current system is deigned for Xilinx XC3000 FPGA chips. In the future, we hope to upgrade the result to XC4000 series and extend our algorithms to two dimensional placement and routing problems. C. Bernard Shung 項春申 學位論文 ; thesis 132 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 電子研究所 === 81 === In this thesis, we proposed and implemented some procedures to
do the data path synthesis in Field Programmable Gate Arrays
(FPGAs). This thesis involves the following issues : (1). How
to build and select the cell library. (2). The input format.
(3). To select the intermediate representation. (4). The
algorithm of cell placement. (5). Select the routing algorithm
and routability analysis. (6). Algorithm of pin assignment.
(7). Transfer the result to the Xilinx's format. Due to the bit
sliced nature of the data path,the two dimensional placing and
routing problem of symmetrical architecture is reduced to a one
dimensional one. We studied and implemented several placement
algorithms and compared results. The router is using a modified
version of a previously published method called Coarse graph
expansion (CGE).The current system is deigned for Xilinx XC3000
FPGA chips. In the future, we hope to upgrade the result to
XC4000 series and extend our algorithms to two dimensional
placement and routing problems.
|
author2 |
C. Bernard Shung |
author_facet |
C. Bernard Shung Wei-Chang Tsai 蔡維昌 |
author |
Wei-Chang Tsai 蔡維昌 |
spellingShingle |
Wei-Chang Tsai 蔡維昌 Data Path Synthesis in Field Programmable Gate Arrays |
author_sort |
Wei-Chang Tsai |
title |
Data Path Synthesis in Field Programmable Gate Arrays |
title_short |
Data Path Synthesis in Field Programmable Gate Arrays |
title_full |
Data Path Synthesis in Field Programmable Gate Arrays |
title_fullStr |
Data Path Synthesis in Field Programmable Gate Arrays |
title_full_unstemmed |
Data Path Synthesis in Field Programmable Gate Arrays |
title_sort |
data path synthesis in field programmable gate arrays |
url |
http://ndltd.ncl.edu.tw/handle/27866826707734970764 |
work_keys_str_mv |
AT weichangtsai datapathsynthesisinfieldprogrammablegatearrays AT càiwéichāng datapathsynthesisinfieldprogrammablegatearrays AT weichangtsai yònghùkěchéngshìluójízházhènlièzhīzīliàoliúhéchéngqì AT càiwéichāng yònghùkěchéngshìluójízházhènlièzhīzīliàoliúhéchéngqì |
_version_ |
1718354673142857728 |