How Much Can Logic Perturbation Help from Netlist to Final Routing for FPGAs.

Catherine L. Zhou Wai-Chung Tang Wing-Hang Lo Yu-Liang Wu

Published in: DAC (2007)

Keyphrases

modal logic
logic programming
routing algorithm
predicate logic
network topology
field programmable gate array
data sets
shortest path
routing problem
computational properties
proof theory
classical logic
set theory
digital circuits
asynchronous circuits
perturbation method