Skip to main navigation
Skip to search
Skip to main content
Hong Kong Baptist University Home
Help & FAQ
Link opens in a new tab
Search content at Hong Kong Baptist University
Home
Scholars
Departments / Units
Research Output
Projects / Grants
Prizes / Awards
Activities
Press/Media
Student theses
Datasets
Length-matching routing for high-speed printed circuit boards
Muhammet Mustafa Ozdal
,
Martin D. F. Wong
Office of the Provost
Research output
:
Chapter in book/report/conference proceeding
›
Conference proceeding
›
peer-review
27
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Length-matching routing for high-speed printed circuit boards'. Together they form a unique fingerprint.
Sort by:
Weight
Alphabetically
Keyphrases
Length Matching
100%
Length Constraint
100%
High-speed Printed Circuit Board
100%
Tight
60%
Minimum Length
40%
Routing Problem
40%
Min-max
40%
Routing Resources
40%
Maximum Length
40%
Graph Model
20%
Time Constraints
20%
Industrial Application
20%
Novel Algorithm
20%
Resource Allocation
20%
Routing Algorithm
20%
Lagrangian Relaxation
20%
Clock Frequency
20%
Length Minimization
20%
Computer Science
Routing Problem
100%
Printed Circuit Board
100%
Routing Resource
100%
Industrial Application
50%
Routing Algorithm
50%
Resource Allocation
50%
Lagrangian Relaxation
50%
Clock Frequency
50%
Timing Requirement
50%
Engineering
Printed Circuit Board
100%
Constraint Length
100%
Max
50%
Routing Problem
50%
Industrial Application
25%
Routing Algorithm
25%
Lagrangian Relaxation
25%
Clock Frequency
25%