Layout Area of the Hypercube
Shimon Even, Roni Kupershtok · Journal of Interconnection Networks · 2003
In this paper we study the square grid area required for laying out Hl, the Boolean hypercube of N=2l vertices. It is shown that this area is [Formula: see text]. We describe a layout which occupies this much area and prove that no layout of less area exists.