Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Press/Media
Student theses
Datasets
Search by expertise, name or affiliation
Timing-driven routing for FPGAs based on Lagrangian relaxation
Seokjin Lee
,
D. F. Wong
Office of the Provost
Research output
:
Chapter in book/report/conference proceeding
›
Conference proceeding
›
peer-review
7
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Timing-driven routing for FPGAs based on Lagrangian relaxation'. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Keyphrases
Lagrangian Relaxation
100%
Timing-driven
100%
FPGA-based
100%
Router
66%
Exclusivity
33%
Time Constraints
33%
Cost Function
33%
Routing Algorithm
33%
Lagrangian multiplier
33%
Circuit Performance
33%
Routing Resources
33%
FPGA Routing
33%
Benchmark Circuits
33%
Routing Tree
33%
Subgradient Method
33%
Interconnect Delay
33%
Critical Path Delay
33%
Computer Science
Field Programmable Gate Array
100%
Lagrangian Relaxation
100%
Experimental Result
25%
Routing Algorithm
25%
Timing Constraint
25%
Lagrangian Multiplier
25%
Benchmark Circuit
25%
Routing Resource
25%
Critical Path Delay
25%
Exclusivity Constraint
25%