A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier

作者：Kito Nobutaka^*; Hanai Kensuke; Takagi Naofumi

来源：IEICE Transactions on Information and Systems, 2010, E93D(10): 2783-2791.

DOI：10.1587/transinf.E93.D.2783

• multiplier
• design for testability
• 4-2 adder tree
• C-testability

A C-testable 4-2 adder tree for an easily testable highspeed multiplier is proposed, and a recursive method for test generation is shown. By using the specific patterns that we call 'alternately inverted patterns,' the adder tree, as well as partial product generators, can be tested with 14 patterns regardless of its operand size under the cell fault model. The test patterns are easily fed through the partial product generators. The hardware overhead of the 4-2 adder tree with partial product generators for a 64-bit multiplier is about 15%. By using a previously proposed easily testable adder as the final adder, we can obtain an easily testable high-speed multiplier.

• 出版日期2010-10