On three-dimensional layout of pyramid networks

Pyramid networks are well-known as suitable structures for parallel computations such as image processing. This paper shows a practical 3D VLSI layout of the N-vertex pyramid network with volume O(N) and wire-length O(/sup 3//spl radic/N). Since the known best lower bounds for the volume and wire-length of a 3D layout for an N-vertex pyramid network are /spl Omega/(N) and /spl Omega/(/sup 3//spl radic/N/log N), respectively, the volume of our layout is optimal, and the wire-length of our layout is close to the optimal.