The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2000 vol.11)
pp: 182-191
ABSTRACT
<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>
INDEX TERMS
Interconnection networks, cube-connected cycles, VLSI, embedding, routing, layout.
CITATION
Guihai Chen, Francis C.M. Lau, "Tighter Layouts of the Cube-Connected Cycles", IEEE Transactions on Parallel & Distributed Systems, vol.11, no. 2, pp. 182-191, February 2000, doi:10.1109/71.841753
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool