The DOI matches its Crossref record.
FPGA routing architecture: segmentation and buffering to optimize speed and density
Abstract
In this work we investigate the routing architecture of FPGAs, focusing primarily on determining the best distribution of routing segment lengths and the best mix of pass transistor and tri-state buffer routing switches. While most commercial FPGAs contain many length 1 wires (wires that span only one logic block) we find that wires this short lead to FPGAs that are inferior in terms of both delay and routing area. Our results show instead that it is best for FPGA routing segments to have lengths of 4 to 8 logic blocks. We also show that 50% to 80% of the routing switches in an FPGA should be pass transistors, with the remainder being tri-state buffers. Architectures that employ the best segmentation distributions and the best mixes of pass transistor and tri-state buffer switches found in this paper are not only 11% to 18% faster than a routing architecture very similar to that of the Xilinx XC4000X but also considerably simpler. These results are obtained using an architecture investigation infrastructure that contains a fully timing-driven router and detailed area and delay models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Reconfigurable computing: a survey of systems and software
Compton, K., & Hauck, S. (2002) · ACM Computing Surveys · doi:10.1145/508352.508353 · Cited by 1,240
Nanowire-based programmable architectures
Dehon, A. (2005) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1084748.1084750 · Cited by 257
Trimberger, S. M. S. (2018) · IEEE Solid-State Circuits Magazine · doi:10.1109/mssc.2018.2822862 · Cited by 77
Metadata
- Authors
- Betz, V., & Rose, J.
- Venue
- Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
- Publisher
- ACM
- Published
- 1999-02
- Pages
- 59-68
- OpenAlex
- W2007049691
- Cited by
- 169
- References
- 0
- FWCI
- 9.73
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: FPGA routing architecture: segmentation and buffering to optimize speed and density. https://app.cochat.ai/papers/10.1145/296399.296428
- The paper
- Betz, V., & Rose, J. (1999). FPGA routing architecture: segmentation and buffering to optimize speed and density. Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays. https://doi.org/10.1145/296399.296428
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.