A new FPGA detailed routing approach via search-based Booleansatisfiability

@article{Nam2002ANF,
  title={A new FPGA detailed routing approach via search-based Booleansatisfiability},
  author={Gi-Joon Nam and Karem A. Sakallah and Rob A. Rutenbar},
  journal={IEEE Trans. on CAD of Integrated Circuits and Systems},
  year={2002},
  volume={21},
  pages={674-684}
}
Boolean-based routing methods transform the geometric FPGA routing task into a large but atomic Boolean function with the property that any assignment of input variables that satisfies the function specifies a valid routing solution. Previous attempts at FPGA routing using Boolean methods were based on binary decision diagrams which limited their scopes, because of size limitations, to only individual FPGA channels. Thus, FPGA layouts were decomposed into channel-wise slices that are handled… CONTINUE READING
Highly Cited
This paper has 45 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…