Computer aided design for microcomputer systems

Lewin, Douglas

doi:10.1007/3-540-11172-7_3

Search citation statements

Order By: Relevance

Paper Sections

Select...

Construction Of the Adjacency Graph2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1997

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In an adjacency graph, each node represents a state. Between any two nodes, there exists a weighted edge if these two nodes (states) have to be adjacent to reduce the circuit area after state assignment and logic minimization [13].…”

Section: Construction Of the Adjacency Graphmentioning

confidence: 99%

See 1 more Smart Citation

State assignment based on two-dimensional placement and hypercube mapping

Liu¹,

Pedram

Despain

1997

Integration

View full text Add to dashboard Cite

This paper addresses the problem of state assignment for Finite State Machines (FSM). This is an important problem in digital system design where added functionality often comes at the expense of a larger (and slower) FSM to control the system. We present a new scheme to solve the graph embedding problem which is the main step in the state assignment process. This new approach places the graph in a two-dimensional array (grid) while minimizing the total edge length, and then maps this two-dimensional array into an n-dimensional hypercube with dilation of at most 2. Experimental results are presented and compared against those of NOVA. These results demonstrate the effectiveness of the proposed approach.

show abstract

Section: Construction Of the Adjacency Graphmentioning

confidence: 99%

“…It is desirable to give states in each group adjacent codes. This kind of grouping is actually the combination of Type-I and Type-III adjacency heuristics in [13] and is also the state grouping which creates face constraints in [6].…”

Section: Construction Of the Adjacency Graphmentioning

confidence: 99%