mlsanityData to 7 Oct 2026

Painting on Placement: Forecasting Routing Congestion using Conditional Generative Adversarial Nets

arXiv 1904.07077 ↗First posted 15 Apr 2019cs.LG cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

Physical design process commonly consumes hours to days for large designs, and routing is known as the most critical step. Demands for accurate routing quality prediction raise to a new level to accelerate hardware innovation with advanced technology nodes. This work presents an approach that forecasts the density of all routing channels over the entire floorplan, with features collected up to placement, using conditional GANs. Specifically, forecasting the routing congestion is constructed as an image translation (colorization) problem. The proposed approach is applied to a) placement exploration for minimum congestion, b) constrained placement exploration and c) forecasting congestion in real-time during incremental placement, using eight designs targeting a fixed FPGA architecture.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Apr 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 3; 2025: 0; 2026: 1.

8 papers.