Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/34524
Title: TIME-MULTIPLEXED INTERCONNECTION NETWORK FOR FIELD-PROGRAMMABLE GATE ARRAYS
Authors: CHEN XIAOLEI
Keywords: FPGA, Algorithm Design, Digital Logic, Interconnection Network, Routing, Experimental Evaluation
Issue Date: 6-Feb-2012
Source: CHEN XIAOLEI (2012-02-06). TIME-MULTIPLEXED INTERCONNECTION NETWORK FOR FIELD-PROGRAMMABLE GATE ARRAYS. ScholarBank@NUS Repository.
Abstract: In FPGAs, interconnects account for a large part of the area and timing budget. Given the significant intra- clock cycle idleness of wire segments in conventional architecture, we in this work propose TM-ARCH, a time-multiplexed architecture for FPGA interconnects. In this architecture, a wire can be multiplexed among multiple nets within one clock cycle. Specially designed time-multiplexing switches (TM switches) are used to enable the multiplexing of wires. Correspondingly, we present a time-multiplexing -aware timing-driven routing algorithm. Based on the VPR 5 timing-driven routing algorithm, this algorithm actively identifies nets that can be scheduled to multiplex wires. This routing algorithm accepts placement results from conventional placement tool, and requires no changes to the upstream EDA tools in FPGA design flow. This is the 1st timing-driven routing algorithm that performs combined global and detailed routing on FPGA architectures with time-multiplexed interconnects.
URI: http://scholarbank.nus.edu.sg/handle/10635/34524
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ChenXL.pdf677.42 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

182
checked on Jan 12, 2018

Download(s)

41
checked on Jan 12, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.