This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Design of a Testable Parallel Multiplier
March 1990 (vol. 39 no. 3)
pp. 411-416

A scheme for an easily testable multiplier and the corresponding test generation procedures are presented. To provide 100% controllability of the summand-counter, the summand-generator is modified. The modified summand-generator can be implemented with little hardware overhead. Since the summands are 100% controllable, the summand-counter can be constructed with the minimum number of adder cells. The multiplier is not C-testable, but can be tested with a small numbers of test vectors, i.e. 3n+60 vectors. It requires only one extra input, whereas C-testable multipliers usually require at least four or five extra inputs and more adder cells along with extra circuitry. Using the modified summand-generator, other types of multipliers can be easily constructed to be testable with only one extra input. Test sets for these multipliers can be obtained using the same test generation approach.

[1] T. Williams and K. Parker, "Design for testability--A survey,"IEEE Trans. Comput., vol. C-31, pp. 2-15, Jan. 1982.
[2] J. P. Shen and F. J. Ferguson, "The design of easily testable VLSI array multipliers,"IEEE Trans. Comput., vol. C-33, pp. 554-560, June 1984.
[3] A. Chatterjee and J. A. Abraham, "Test generation for arithmetic units by graph labelling," inProc. 17th Annu. Symp. Fault-Tolerant Comput., July 1987, pp. 284-289.
[4] K. Hwang,Computer Arithmetic: Principles, Architecture, and Design. New York: Wiley, 1979.
[5] C. R. Baugh and B. A. Wooley, "Two's complement parallel array multiplication algorithm,"IEEE Trans. Comput., vol. C-22, pp. 1045-1047, Dec. 1973.
[6] Y. Kaji, N. Sugiyama, Y. Kitamura, S. Ohya, and M. Kikuchi, "A 45ns 16×16 CMOS multiplier," inISSCC 84 Dig. Tech. Papers, 1985, pp. 84-85.
[7] C. Y. Ho, R. T. Jerdonek, S. E. Noujaim, and D. L. Schumacher, "A high performance 1.5 micron CMOS 24×24 bit multiplier," inProc. IEEE CICC, 1984, pp. 30-33.

Index Terms:
testable parallel multiplier; summand-counter; test generation; digital arithmetic; multiplying circuits.
Citation:
S.J. Hong, "The Design of a Testable Parallel Multiplier," IEEE Transactions on Computers, vol. 39, no. 3, pp. 411-416, March 1990, doi:10.1109/12.48874
Usage of this product signifies your acceptance of the Terms of Use.