• Computer Science
• Published in FPGA '99 1999
• DOI:10.1145/296399.296450

Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT

@inproceedings{Nam1999SatisfiabilitybasedLR,
  title={Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT},
  author={Gi-Joon Nam and Karem A. Sakallah and Rob A. Rutenbar},
  booktitle={FPGA '99},
  year={1999}
}

• Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar

1. ABSTRACT lier BDD-based methods. Boolean-based routing transforms the geometric FPGA routing task into a single, large Boolean equation with the property that any assignment of input variables that “satisfies” the equation (that renders equation identically “1”) specifies a valid routing. The formulation has the virtue that it considers all nets simultaneously, and the absence of a satisfying assignment implies that the layout is unroutable. Initial Boolean-based approaches to routing used… CONTINUE READING

View on ACM

Save to Library

Create Alert

Cite