대한전자공학회논문지 (Journal of the Korean Institute of Telematics and Electronics)
- 제23권2호
- /
- Pages.217-224
- /
- 1986
- /
- 1016-135X(pISSN)
혼합-교환도 작성을 위한 새 알고리즘
A New Algorithm for Drawing the Shuffle-Exchange Graph
- 이성우 (동양공업전문대학 전자공학과) ;
- 황호정 (중앙대학교 전자과)
- Lee, Sung Woo (Dept. of Elec. Dong-yang Tech. College) ;
- Hwang, Ho Jung (Dept. of Elec. Eng., Jung-Ang Univ.)
- 발행 : 1986.02.01
초록
In case of VLSI design, the shuffle-exchange graph is useful for optimal layout. HOEY and LEISERSON proposed the method of drawing a N-nodes shuffle-exchange graph on O(N2/log N) layout area by using the complex plane digram. [2] In this paper, a new algorithm for drawing the shuffle-exchange graph is proposed. This algorithm is not by using the complex plane diabram, but the table of e decimal represented nodes of shuffle-edge relations. And the structural properties for optimal layout of the graph are summarized and verified. By using this more simplified algorithm, a FORTRAN program which can be treated faster is written. Aimed near optimal shuffle-exchange graphs are printed out by giving inputs` the number of nodes.
키워드