We study the problem of Embedding Wirelength $n$-dimensional Hypercube $Q_n$ into Cylinder $C_{2^{n_1}}\times P_{2^{n_2}}$, where $n_1+ n_2=n$, called EWHC. 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 an optimal strategy

We present a new design methodology for constructing three-dimensional space-invariant hypercube interconnection networks. The methodology is based on a graph bipartitioning technique and allows the construction of larger hypercube networks from smaller networks in a systematic and incremental fashion. Due to its totally space-invariant nature, the resulting three-dimensional hypercube networks...