OpenAlex ·
FAPO: Fanout-Aware Post-Mapping Optimization for LUT-Based FPGAs
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.06937
- Original
- Read it at the publisher
- Topics
Abstract
Reducing logic depth during FPGA technology mapping can leave fanout bottlenecks in the resulting LUT network. LUT replication redistributes these loads but consumes area and increases loading on shared fanins. We propose FAPO, a mapper-independent post-mapping optimizer that jointly refines sink assignments and LUT cuts under a final-area constraint. It evaluates replication, cut switching, and recovery by the resulting live LUT count and full-network timing. A necessary all-critical-path condition motivates minimum-cut proposals that complement greedy refinement. Within a fixed critical graph and a restricted same-cut action family, each proposal minimizes the number of copy actions needed to cover all current critical paths. Experiments on EPFL benchmarks show that FAPO reduces the geometric-mean fanout-aware area-timing product (ATP) by up to 14.48% with only a small increase in area. VPR evaluation gives a 6.82% geometric-mean routed-delay reduction relative to ABC if.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Hardware Architecture
JASPER: Special Session on Joint Reliability And Security Assessment of SPlit Computing for Edge Robustness
Trinity: One Differentiable Physics for Training, Refining and Scoring Generative Floorplanners
SparseCraft: Agentic Hardware-Software Co-Optimization for Sparse Computing
WakeKV: Reactive, Reversible KV Residency for Heads That Change Their Minds
Beyond LLM Serving: Characterizing Vision-Language-Action Workloads for Embodied AI System Design
Get the few papers worth your time in Hardware Architecture every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.