Technology Mapping for Complex FPGAs

博士 === 國立交通大學 === 電子工程系 === 89 === This dissertation explores the technology mapping problem for complex Field-Programmable Gate Arrays (FPGAs). FPGAs have been widely used for implementing prototypes of ASICs for their short turnaround time. Complex FPGAs further support faster speed and...

Full description

Bibliographic Details
Main Authors: Hsien-Ho Chuang, 莊咸和
Other Authors: Jing-Yang Jou
Format: Others
Language:en_US
Published: 2000
Online Access:http://ndltd.ncl.edu.tw/handle/31693560935642042335
id ndltd-TW-089NCTU0428015
record_format oai_dc
spelling ndltd-TW-089NCTU04280152016-01-29T04:28:14Z http://ndltd.ncl.edu.tw/handle/31693560935642042335 Technology Mapping for Complex FPGAs 複合式用戶可規劃閘陣列之技術映射 Hsien-Ho Chuang 莊咸和 博士 國立交通大學 電子工程系 89 This dissertation explores the technology mapping problem for complex Field-Programmable Gate Arrays (FPGAs). FPGAs have been widely used for implementing prototypes of ASICs for their short turnaround time. Complex FPGAs further support faster speed and higher density. Its architecture features hard-wired connections, non-homogeneous logic blocks, and limited accessible fanouts. This dissertation proposes two new technology mapping algorithms for optimizing for area and delay respectively. In the area-driven algorithm, we use a multiple-fanout pattern graph library to model the complex logic block architecture and a pre-mapping technique to generate the subject graph dynamically. A new matching algorithm and a new covering algorithm are also developed for the subject graph covering. In the delay-driven algorithm, we present a guaranteed delay optimal technology mapping algorithm for hard-wired non-homogeneous FPGAs. To handle the hard-wired features with traditional labeling-mapping algorithm, we propose a two-dimensional labeling approach and a complex node cut algorithm. Jing-Yang Jou C. Bernard Shung 周景揚 項春申 2000 學位論文 ; thesis 0 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 博士 === 國立交通大學 === 電子工程系 === 89 === This dissertation explores the technology mapping problem for complex Field-Programmable Gate Arrays (FPGAs). FPGAs have been widely used for implementing prototypes of ASICs for their short turnaround time. Complex FPGAs further support faster speed and higher density. Its architecture features hard-wired connections, non-homogeneous logic blocks, and limited accessible fanouts. This dissertation proposes two new technology mapping algorithms for optimizing for area and delay respectively. In the area-driven algorithm, we use a multiple-fanout pattern graph library to model the complex logic block architecture and a pre-mapping technique to generate the subject graph dynamically. A new matching algorithm and a new covering algorithm are also developed for the subject graph covering. In the delay-driven algorithm, we present a guaranteed delay optimal technology mapping algorithm for hard-wired non-homogeneous FPGAs. To handle the hard-wired features with traditional labeling-mapping algorithm, we propose a two-dimensional labeling approach and a complex node cut algorithm.
author2 Jing-Yang Jou
author_facet Jing-Yang Jou
Hsien-Ho Chuang
莊咸和
author Hsien-Ho Chuang
莊咸和
spellingShingle Hsien-Ho Chuang
莊咸和
Technology Mapping for Complex FPGAs
author_sort Hsien-Ho Chuang
title Technology Mapping for Complex FPGAs
title_short Technology Mapping for Complex FPGAs
title_full Technology Mapping for Complex FPGAs
title_fullStr Technology Mapping for Complex FPGAs
title_full_unstemmed Technology Mapping for Complex FPGAs
title_sort technology mapping for complex fpgas
publishDate 2000
url http://ndltd.ncl.edu.tw/handle/31693560935642042335
work_keys_str_mv AT hsienhochuang technologymappingforcomplexfpgas
AT zhuāngxiánhé technologymappingforcomplexfpgas
AT hsienhochuang fùhéshìyònghùkěguīhuàzházhènlièzhījìshùyìngshè
AT zhuāngxiánhé fùhéshìyònghùkěguīhuàzházhènlièzhījìshùyìngshè
_version_ 1718170889671933952