Frank Schmiedle
- 1.R. Bryant. Graph- based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677- 691, 1986. Google Scholar
Digital Library
- 2.S. Devadas. Optimal layout via Boolean satisfiability. In Int'l Conf. on CAD, pages 294-297, 1989.Google Scholar
- 3.N. GSckel, R. Drechsler, and B. Becker. A multi-layer detailed routing approach based on evolutionary algorithms. In Int'l Conference on Evolutionary Computation, pages 557-562, 1997.Google Scholar
- 4.T. Kam, T. Villa, R. Brayton, and A. Sangiovanni- Vincentelli. Multi-valued decision diagrams: Theory and applications. Multiple Valued Logic - An International Journal, pages 9-62, 1998.Google Scholar
- 5.T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner, Wiley, 1990. Google ScholarDigital Library
- 6.G.-J. Nam, K. Sakallah, and R. Rutenbar. Satisfiability-based layout revisted: Detailed routing of complex fpgas via search-based boolean sat. In Int'l Syrup. on FPGAs for Custom Computing Machines, pages 167-175, 1999. Google Scholar
- 7.F. Schmiedle, R. Drechsler, and B. Becker. Exact routing using symbolic representation. In Int'l Syrup. Circ. and Systems, pages VI:394-VI:397, 1999.Google Scholar
- 8.N. Sherwani. Algorithms for VLSI Physical Design Automation. Kluwer Academic Publishers, Norwell, Massachusetts, second edition, 1995. Google ScholarDigital Library
- 9.F. Somenzi. CUDD: CU Decision Diagram Package Release 2.3.0. University of Colorado at Boulder, 1998.Google Scholar
- 10.A. Srinivasan, T. Kam, S. Malik, and R. Brayton. Algorithms for discrete function manipulation. In Int'l Conf. on CAD, pages 92-95, 1990.Google Scholar
- 11.T. Szymanski. Dogleg channel routing is NP-complete. IEEE Trans. on CAD, 4(1):31-41, 1985.Google ScholarDigital Library
- 12.R. Wood and R. Rutenbar. FPGA routing and routability estimation via Boolean satisfiability. IEEE Trans. on VLSI Systems, 6(2):222-231, 1998. Google ScholarDigital Library
- 13.T. Yoshimura and E. Kuh. Efficient algorithms for channel routing. IEEE Trans. on CAD, CAD-1(1):23- 35, Jan. 1982.Google Scholar
Recommendations
Exact switchbox routing with search space reduction
ICCAD '00: Proceedings of the 2000 international conference on Computer-aided designWe present an approach for exact switchbox routing that complements traditional routing techniques. It is particularly well suited for an application to dense problem instances and the completion of routing in subregions which turn out to be difficult ...
Exact routing with search space reduction
The layout problem in VLSI-design can be broken up into the subtasks partitioning, floorplanning, placement, and routing. In the routing phase, a large number of connections between the blocks and cells have to be established, while intersections lead ...
Search space reduction technique for constrained optimization with tiny feasible space
GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computationThe hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solution quality. It becomes even more challenging when the feasible space is ...
Comments