Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers &Amp; Processors
DOI: 10.1109/iccd.1992.276201
|View full text |Cite
|
Sign up to set email alerts
|

Routability-driven technology mapping for lookup table-based FPGAs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
30
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 51 publications
(30 citation statements)
references
References 14 publications
0
30
0
Order By: Relevance
“…In this example, input nodes x and c have only one cut each, however, if instead they had multiple cuts, all possible cut merges would be attempted to form the complete cut set for z. This provides a general picture of how the cut generation procedure works, however, there are several special cases to consider and the reader is referred to [7] for details.…”
Section: Fpga Technology Mappingmentioning
confidence: 99%
See 2 more Smart Citations
“…In this example, input nodes x and c have only one cut each, however, if instead they had multiple cuts, all possible cut merges would be attempted to form the complete cut set for z. This provides a general picture of how the cut generation procedure works, however, there are several special cases to consider and the reader is referred to [7] for details.…”
Section: Fpga Technology Mappingmentioning
confidence: 99%
“…[5,6]). Recent technology mappers are based on the notion of cuts [7,8], which we review here. The combinational portion of a circuit can be represented by a directed acyclic graph (DAG) G(V, E), where each node, z ∈ V , represents a single-output logic function and edges between nodes, e ∈ E, represent input/output dependencies among the corresponding logic functions.…”
Section: Fpga Technology Mappingmentioning
confidence: 99%
See 1 more Smart Citation
“…Similarly, we can attempt to merge C a2 and C b to create another cut, C z2 , for node z. This provides a general picture of how the cut generation procedure works; however, there are several special cases to consider, and the interested reader is referred to [13] for full details.…”
Section: Generating K-feasible Cutsmentioning
confidence: 99%
“…Traversing the network from primary inputs to primary outputs, the cuts for each node, z, are generated by merging cuts from its fanin nodes using the method described in [12,13]. At a high level, this works as follows: Consider a node z with two fanin nodes, a and b.…”
Section: Generating K-feasible Cutsmentioning
confidence: 99%