For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier
Nobutaka KITO Kensuke HANAI Naofumi TAKAGI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2010/10/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Information Network
multiplier, design for testability, 4-2 adder tree, C-testability,
Full Text: PDF(381.2KB)
>>Buy this Article
A C-testable 4-2 adder tree for an easily testable high-speed 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.