Bibliographic Details
| Title: |
Timing-Driven-Testable Convergent Tree Adders. |
| Authors: |
Huang, Johnnie A.1, Chen, Chien-In Henry2 |
| Source: |
VLSI Design. Nov2002, Vol. 15 Issue 3, p637-645. 9p. |
| Subjects: |
Very large scale circuit integration, Integrated circuits, Integrated circuit interconnections, Cellular automata, Computer engineering |
| Abstract: |
Carry lookahead adders have been, over the years, implemented in complex arithmetic units due to their regular structure which leads to efficient VLSI implementation for fast adders. In this paper, timing-driven testability synthesis is first performed on a tree adder. It is shown that the structure of the tree adder provides for a high fanout with an imbalanced tree structure, which likely contributes to a racing effect and increases the delay of the circuit. The timing optimization is then realized by reducing the maximum fanout of the adder and by balancing the tree circuit. For a 56-b testable tree adder, the optimization produces a 6.37% increase in speed of the critical path while only contributing a 2.16% area overhead. The full testability of the circuit is achieved in the optimized adder design. [ABSTRACT FROM AUTHOR] |
|
Copyright of VLSI Design is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
