Tree Multipliers are frequently used to reduce the delay of array multipliers. The objective of tree multipliers is to utilize the concept of carry save adders in reducing the partial product. Two well known tree multipliers Wallace and Dadda uses full adders and half adders for the aforesaid purpose. This paper implements a multiplier which will perform reduction of partial products using 4 bi...

Abstract This paper hopes to show that, for Wallace Stevens, God and human imagination are closely identified. Moreover, the feeling of rightness, which so long a time existed with old religious idea God, may be accessed once again. His notion “supreme fiction” will compare Descartes’ “idea Infinite” as interpreted by Emmanuel Levinas. epistemological reality, central our being, can also become...

A 64 X64-bit iterating multiplier, the Stanford Pipelined Iterative Multiplier (SPIM), is presented. Tbe pipelined array consists of a small tree of 4:2 adders. The 4:2 tree is better suited than a Wallace tree for a VLSI implementation because it is a more regular structure. A 4:2 carry-save accumulator at the bottom of the array is used to iteratively accumulate partial products, allowing a p...

We survey graph theoretic analogues of the Selberg trace and pretrace formulas along with some applications. This paper includes a review of the basic geometry of a k-regular tree Ξ (symmetry group, geodesics, horocycles, and the analogue of the Laplace operator). A detailed discussion of the spherical functions is given. The spherical and horocycle transforms are considered (along with three b...