Share Email Print
cover

Proceedings Paper

Optimization of spanning tree adders
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper compares several designs of spanning tree adders for 16 and 32 bit widths. The carry select part of the spanning tree is done using ripple carry and carry skip adders (4, 8 and 16 bits) and compared in terms of delay, complexity and power consumption. The spanning tree design is also compared with that of a conventional carry lookahead adder. All the designs are done using only 2 input NAND and NOR gates and inverters in 0.18 μm CMOS technology. The delay and power consumption is determined by use of simulations performed with Synopsys and Cadence design tools. The spanning tree adder realized with carry skip adders is about 40% faster than the carry lookahead adder with an approximate increase of 17% in complexity and 22% in power.

Paper Details

Date Published: 25 August 2006
PDF: 8 pages
Proc. SPIE 6313, Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, 631301 (25 August 2006); doi: 10.1117/12.681615
Show Author Affiliations
Megha Ladha, Univ. of Texas at Austin (United States)
Earl E. Swartzlander, Univ. of Texas at Austin (United States)


Published in SPIE Proceedings Vol. 6313:
Advanced Signal Processing Algorithms, Architectures, and Implementations XVI
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top