Computational Aspects of Vlsi
Citations
Cites methods from "Computational Aspects of Vlsi"
...A most e cient way to lay out a complete tree T (h) in a 2-d grid is to use the well known H-tree layout [27]....
[...]
..., algorithms using a divide-and-conquer strategy) and these networks arise in many applications [2, 5, 4, 7, 10, 14, 20, 25, 27]....
[...]
...We rst consider one of the fundamental problems in parallel computation, namely the computation of parallel pre x sum [2, 8, 15, 27], and show that given an algorithm to compute parallel prex sum on a complete binary tree T (h), the algorithm can be converted with the same time complexity, rather in a straight forward way, to run on a compressed tree CT k(h)....
[...]
Cites background or methods from "Computational Aspects of Vlsi"
...To achieve this goal, numerous layout design automation tools [12] [13] [14] [15] have been developed and are being used selectively in accordance with the design styles....
[...]
...Figure 1 shows how this router finds the shortest path connecting points A and B [15]....
[...]