⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

January 1, 1993IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Segmented channel routing

V.P. Roychowdhury Jonathan Greene Abbas El Gamal

View at Publisher

Ask AI

Bookmark

Share

Abstract

Novel problems concerning routing in a segmented routing channel are introduced. These problems are fundamental to routing and design automation for field programmable gate arrays (FPGAs), a new type of electrically programmable VLSI. The first known theoretical results on the combinatorial complexity and algorithm design for segmented channel routing are presented. It is shown that the segmented channel routing problem is in general NP-complete. Efficient polynomial time algorithms for a number of important special cases are presented.>

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Roychowdhury et al. (1993) studied this question.

synapsesocial.com/papers/6a9480c5874e279cb4c51f33 https://doi.org/10.1109/43.184845

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Wire routing by optimizing channel assignment within large aperturesOriginal Research · 1971 · 687 citations
2Two-dimensional stochastic model for interconnections in master slice integrated circuitsOriginal Research · 1981 · 159 citations
3Design and Evaluation of an RFET Standard Cell Library Compatible with 22 nm FDSOIIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · Wed,
4SparseMap: A Sparse Tensor Accelerator Framework Based on Evolution StrategyIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · Wed,
5LEAP: Lightweight Neural Network Inference Through Proactive Early-Exiting PredictionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · Tue,

More from IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

PIMapping: A Tile-Level Dataflow Optimization Framework for PIM ArchitectureTue,
CD-FiLM: Contrastive Masked Decoder With Feature-Wise Linear Modulation for Power–Signal Integrity Co-Analysis of High-Speed TransmittersTue,
LightPlace: A Lightweight and Connectivity-Aware Macro Placement Framework for Mixed-Size 3-D ICsFri,
MiniBRNN: A Low-Resource Inference Processor for Binary-Weight Recurrent Neural Networks Based on Speculative Operation Pruning and Interleaved Thread SchedulingWed,
Terafly: A Multinode FPGA-Based Accelerator Design for Efficient Cooperative Inference in LLMsMon,