Abstract/Details

Design mapping algorithms for hybrid FPGAs


2004 2004

Other formats: Order a copy

Abstract (summary)

The ongoing advancements in VLSI technology and Field Programmable Gate Array (FPGA) architectures have enabled the development of multi-million gate hybrid FPGAs containing diverse types of on-chip resources. Each type of resource in a hybrid FPGA is best suited for implementing a particular type of logic function. Given a target hybrid FPGA containing look-up tables (LUTs) and product term blocks (PLAs), this dissertation presents mapping approaches to minimize the design LUT count by packing PLAs, subject to user-defined performance constraints. The mapping approaches developed during the course of this dissertation support both gate-level and register transfer level (RTL) design descriptions.

Given a gate-level design description, potential design PLA partitions are identified using a subgraph identification heuristic. PLA candidate partitions are subsequently selected using fast area, delay and Pterm estimators that evaluate and rank the fitness of each potential PLA partition. Given an RTL design description, the design RTL constructs are initially characterized using rule-based RTL area, delay and Pterm estimators. Based on the estimations, RTL structures are appropriately sized for PLAs using a set of RTL partitioning and clustering algorithms. In both the gate-level and RTL approaches, the rest of the design that is not mapped to PLAs is considered to be the LUT partition and is fed to vendor tools along with PLA partitions for final synthesis, placement and routing.

It is shown that when tinning-constrained, our gate-level design mapping approach reduces LUT utilization for Apex20KE devices [1] by 8% and when unconstrained by 14% by migrating logic from LUTs to Pterm structures. Due to the presence of fewer number of PLA candidate subgraphs at RTL, the PLA logic identification procedure at RTL is twice as fast as the gate-level PLA subgraph identification procedure and saves about twice the number of LUTs.

Indexing (details)


Subject
Electrical engineering;
Computer science
Classification
0544: Electrical engineering
0984: Computer science
Identifier / keyword
Applied sciences, FPGAs, Look-up tables, Mapping algorithms, Register transfer level, VLSI
Title
Design mapping algorithms for hybrid FPGAs
Author
Krishnamoorthy, Srinivasaraghavan
Number of pages
140
Publication year
2004
Degree date
2004
School code
0118
Source
DAI-B 65/01, Dissertation Abstracts International
Place of publication
Ann Arbor
Country of publication
United States
Advisor
Tessier, Russell
University/institution
University of Massachusetts Amherst
University location
United States -- Massachusetts
Degree
Ph.D.
Source type
Dissertations & Theses
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
3118313
ProQuest document ID
305175833
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
http://search.proquest.com/docview/305175833
Access the complete full text

You can get the full text of this document if it is part of your institution's ProQuest subscription.

Try one of the following:

  • Connect to ProQuest through your library network and search for the document from there.
  • Request the document from your library.
  • Go to the ProQuest login page and enter a ProQuest or My Research username / password.