On computational complexity of a detailed routing problem in two-dimensional FPGAs

Proceedings of the IEEE Great Lakes Symposium on VLSI

Volumn , Issue , 1994, Pages 70-75

  Wu, Yu Liang ^a   Tsukiyama, Shuji ^a   Marek Sadowska, Malgorzata ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTION FLEXIBILITY; DETAILED ROUTING PROBLEM; DOGLEGS; FIELD PROGRAMMABLE GATE ARRAYS; SWITCH BOX TOPOLOGY;

APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; ELECTRIC NETWORK TOPOLOGY; NUMERICAL METHODS; PROBABILITY;

LOGIC GATES;

EID: 0028756829     PISSN: 10661395     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)