DocumentCode
1150808
Title
The Design of Easily Testable VLSI Array Multipliers
Author
Shen, John Paul ; Ferguson, F. Joel
Author_Institution
SRC-CMU Center for Computer-Aided Design, Department of Electrical and Computer Engineering, Carnegie-Mellon University
Issue
6
fYear
1984
fDate
6/1/1984 12:00:00 AM
Firstpage
554
Lastpage
560
Abstract
Array multipliers are well suited for VLSI implementation because of the regularity in their iterative structure. However, most VLSI circuits are difficult to test. This correspondence shows that, with appropriate cell design, array multipliers can be designed to be very easily testable. An array multiplier is called C-testable if all its adder cells can be exhaustively tested while requiring only a constant number of test patterns. The testability of two well-known array multiplier structures is studied in detail. The conventional design of the carry–save array multiplier is modified. The modified design is shown to be C-testable and requires only 16 test patterns. Similar results are obtained for the Baugh–Wooley two´s complement array multiplier. A modified design of the Baugh–Wooley array multiplier is shown to be C-testable and requires 55 test patterns. The C-testability of two other array multipliers, namely the carry–propagate and the TRW designs, is also presented.
Keywords
Array multipliers; C-testability; VLSI testing; design for testability; exhaustive testing; Adders; Circuit faults; Circuit testing; Design automation; Design for testability; Logic arrays; Logic circuits; Observability; Test pattern generators; Very large scale integration; Array multipliers; C-testability; VLSI testing; design for testability; exhaustive testing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1984.1676480
Filename
1676480
Link To Document