Optimal embedding of hypercube into cylinder

Abstract

We study the problem of Embedding Wirelength of $n$-dimensional Hypercube $Q_n$ into Cylinder $C_{2^{n_1}}\times P_{2^{n_2}}$, where $n_1+n_2=n$, called EWHC. We show that such wirelength corresponding to Gray code embedding is $2^{n_2}(3\cdot 2^{2n_1-3}-2^{n_1-1})+2^{n_1}(2^{2n_2-1}-2^{n_2-1})$. In addition, we prove that Gray code embedding is an optimal strategy of EWHC.

References in corpus (1)

• A note on circular wirelength for hypercubes