Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-Span'96)
DOI: 10.1109/ispan.1996.508985
|View full text |Cite
|
Sign up to set email alerts
|

Efficient reconfiguration scheme for mesh-connected network: the recursive shift approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 6 publications
0
3
0
Order By: Relevance
“…Kung proposed an algorithm based on graph theory [6] and Numata proposed a heuristic algorithm (HS method) which gives highly system yield [3]. in each wafer and there are no shifting in inter-wafer.…”
Section: Shift Directionmentioning
confidence: 99%
See 2 more Smart Citations
“…Kung proposed an algorithm based on graph theory [6] and Numata proposed a heuristic algorithm (HS method) which gives highly system yield [3]. in each wafer and there are no shifting in inter-wafer.…”
Section: Shift Directionmentioning
confidence: 99%
“…There are many algorithms to determine the shift direction for mesh network. The HS algorithm [3] can obtain good system yields. This algorithm determines the shift direction randomly so that there are no biases for the shift direction.…”
Section: Biased Shiftingmentioning
confidence: 99%
See 1 more Smart Citation