Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95)   p. 30
Analytic approach for error masking elimination in on-line multipliers

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1995.465380
Send link to a friend

Abstract
Several systematic design approaches are known to be representatives of the techniques well adapted for testing sequential circuits (partial and full scan, LSSD...). However in some cases, like for the test of on-line operators, ad-hoc DFT (design for testability) schemes become more suitable. Indeed, on-line arithmetic are used for high precision numbers resulting on high length operators. Thus the length of a test sequence for a scan design approach can grow quite large due to the shift in (shift out) of test values (test responses) and therefore the test application time would become prohibitive. Moreover, the arithmetic nature of these operators imply that some errors detected locally are masked before their observation at the primary outputs. In this paper we describe an analytic approach for testing on-line multipliers that allows to avoid error masking without adding extra hardware for internal state observability while maintaining a 100% fault coverage. Compared to a DFT approach using parity trees, this method leads to a reduction of the area overhead from 7% to 1% and of the extra pins count from 6 to 3 in the case of the on-line multipliers considered in this paper.
Additional Information
Index Terms- multiplying circuits; digital arithmetic; error masking elimination; online multipliers; sequential circuits; high precision numbers; scan design approach; internal state observability; fault coverage; DFT approach; area overhead

Citation:  H. Bederr, M. Nicolaidis, A. Guyot, "Analytic approach for error masking elimination in on-line multipliers," arith, p. 30,  12th IEEE Symposium on Computer Arithmetic (ARITH-12 '95),  1995

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback