Another Approach of Mesh-Connected trees

Abstract

Mesh network is commonly seen in parallel computation network, as it is straightforward and easy to expand. Two- dimensional mesh network also attract considerable attention in the VLSI layout due to its simplicity. In applying binary tree to the layout of VLSI array in the form of H, better flexibility and regularity might be achieved. Based on the advantages of mesh architecture and binary trees, we present a new approach of mesh-connected trees that are different to those previously. They unite mesh architecture and binary trees into a new architecture and apply it to the layout of VLSI array. This architecture is free from the problems of crossing, saving the area of overall layout. In addition, this improves the problem that traditional meshes of trees and meshconnected tree difficult to expanded in terms of number of levels. Furthermore, now that we have another mesh-connected architecture, the new meshconnected tree architecture provided by us will be more efficient than traditional binary tree. Concentrating on the communications between binary trees.