H tree

As an H- tree, a special tree in graph theory is referred. It involves the embedding of a binary tree in a rectangular grid - root in the middle - so that tree and subtrees show the shape of the capital letter H. Each node can be the center of a Hs again.

The H- tree is a FASS - curve, that is, it fills the whole plane out. His fractal Hausdorff dimension is 2 With each new iteration, the total length of the curve multiplied by.

H- trees play in the design of synchronous digital circuits for signal distribution a role. So in those circuits via H- trees the transfer of centrally supplied clock signals is ensured to all circuit components on the chip with identical transmission times.

Another example of the use of H - tree is the picture of the structure of a communication program of the processor in a computer cluster.

288683
de