Skip to main content
Log in

An easily testable optimal-time VLSI-multiplier

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We consider the design of a ‘tree-multiplier’, which is a modified version of a Wallace tree-multiplier [16] made suitable for VLSI design by Luk and Vuillemin [12]. It is shown that 4 log(n) + 3 test patterns suffice to exhaustively test the multiplier with respect to the ‘cellular fault model’ (which includes tests for all single stuck at faults). Some slight modifications of the multiplier prove, that these tests can be applied without increasing the number of input ports substantially.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abraham, J.A., Gajski, D.D.: Design of Testable Structures Defined by Simple Loops. IEEE Trans. Comput. C-30, 875–883 (1981)

    Google Scholar 

  2. Abadir, M.S., Reghbati, H.K.: Functional Testing of Semiconductor Random Access Memories. Comput. Surv. 15, 175–198 (1983)

    Google Scholar 

  3. Becker, B.: Efficient Testing of Optimal-Time Adders. T.R., 4/1985, SFB 124, Saarbrücken

  4. Becker, B., Hotz, G., Kolla, R., Molitor, P.: Ein CAD-System zum Entwurf integrierter Schaltungen. T.R., 16/1984, SFB 124, Saarbrücken

  5. Brent, R.P., Kung, H.T.: A Regular Layout for Parallel Adders. IEEE Trans. Comput. C-31, 260–264 (1982)

    Google Scholar 

  6. Cook, S.A.: The Complexity of Theorem Proving Procedures. 3rd ACM Symp. on Theory of Computing. May 3–5, 1971, Shaker Heights, Ohio, pp. 151–158 (1971)

  7. Dadda, L.: Some Schemes for Parallel Multipliers. Alta Frequenza 34, 349–356 (1965)

    Google Scholar 

  8. Ferguson, J., Shen, J.P.: The Design of Two Easily-Testable VLSI Array Multipliers. Proc. 6th Symp. on Comp. Arithmetic. June 20–22, 1983, Aarhus, Denmark, IEEE Catalog No. 83 CH 1892–9

  9. Friedman, A.D.: Easily Testable Iterative Systems. IEEE Trans. Comput. C-22, 1061–1064 (1973)

    Google Scholar 

  10. Hotz, G., Becker, B., Kolla, R., Molitor, P.: Ein logisch-topologischer Kalkül zur Konstruktion von integrierten Schaltkreisen, INFORMATIK Forschung und Entwicklung, Band 1. Berlin, Heidelberg, New York, Tokyo: Springer 1986

    Google Scholar 

  11. Kautz, W.H.: Testing for Faults in Cellular Logic Arrays. Proc. of 8th Symp. on Switch. Autom. Th. pp. 161–174 (1967)

  12. Luk, W.K., Vuillemin, J.: Recursive Implementation of Optimal Time VLSI Integer Multipliers. VLSI'83, F. Anceau, E.J. Aas (Eds.), pp. 155–168. North Holland: Elsevier 1983

    Google Scholar 

  13. Milne, B.: Testability. 1985 Technology Forecast, Electronic Design. pp. 143–166 (1985)

  14. Sklansky, J.: Conditional-sum Addition Logic. IRE-EC 9, pp. 226–231 (1960)

  15. Smith, J.E.: Detection of Faults in PLA's. IEEE Trans. Comput. C-28, 845 (1979)

    Google Scholar 

  16. Wallace, C.S.: A Suggestion for a Fast Multiplier. IEEE 13, 14–17 (1964)

    Google Scholar 

  17. Williams, T.W., Parker. K.P.: Design for Testability. A Survey. IEEE Trans. Comput. C-31, 2–15 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Becker, B. An easily testable optimal-time VLSI-multiplier. Acta Informatica 24, 363–380 (1987). https://doi.org/10.1007/BF00292108

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00292108

Keywords

Navigation