This preview shows page 1. Sign up to view the full content.
Unformatted text preview: bvious. Since the leaves are in a straight line, the distance between the leftmost and
rightmost leaves must be at least � �. By the triangle inequality, one of the roottoleaf paths (just considering the
leftmost and rightmost leaves) is at least � � �� �
� � �. � � � � �� � Theorem 3For any VLSI layout of a complete binary tree with leaves in a straight line, the total wire area is �� �� ��� �. Proof. We can prove this lemma with a simple recurrence. Consider any VLSI layout of a complete binary tree with
leaves in a straight line. We let � � be the minimum total wire area, not counting the longest roottoleaf path in
the tree, of any such layout. Then we will show that the recurrence is � � � � � �� � � � � � � � �� � � �,
which can be solved with the master method to get � � � �� ��� �. � �� ��
�� �� � �� �� � �� �� Consider any complete subtree � with � leaves in the VLSI layout. The tree � is composed of two � ��leaf subtrees,
�� and ��, with a root node connecting to the roots of � � and ��. Without loss of generality, the longest roottoleaf
path in � includes t...
View Full
Document
 Spring '07
 BradleyKuszmaul

Click to edit the document details