The Community for Technology Leaders
Green Image
Issue No. 02 - February (2000 vol. 11)
ISSN: 1045-9219
pp: 182-191
<p><b>Abstract</b>—Preparata and Vuillemin proposed the cube-connected cycles (<tmath>${\cal {CCC}}$</tmath>) and its compact layout in 1981 [<ref type="bib" rid="bibL018217">17</ref>]. We give a new layout of the <tmath>${\cal {CCC}}$</tmath> which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the <tmath>${\cal {CCC}}$</tmath>. The area of the new layout deviates from this bound by a small constant factor. If we “unfold” the cycles in the <tmath>${\cal {CCC}}$</tmath>, the resulting structure can be laid out in optimal area. </p>
Interconnection networks, cube-connected cycles, VLSI, embedding, routing, layout.

G. Chen and F. C. Lau, "Tighter Layouts of the Cube-Connected Cycles," in IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 182-191, 2000.
84 ms
(Ver 3.3 (11022016))