Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/307418.307507acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
Article
Free access

Efficient BIST hardware insertion with low test application time for synthesized data paths

Published: 01 January 1999 Publication History
First page of PDF

References

[1]
{1} V.D., Agrawal, C.R., Kime, and K.K. Saluja. A tutorial on built-n self - part 1: Principles. IEEE Design & Test of Computers, pp. 73-92, March 1993.
[2]
{2} V.D., Agrawal, C.R., Kime, and K.K. Saluja. A tutorial on built-in self test - part 2: Applications. IEEE Design & Test of Computers, pp. 69-77, June 1993.
[3]
{3} P.R. Chalsani, S. Bhawmik, A. Acharya, and P. Palchaudhuri. Design of testable VLSI circuits with minimum area overhead. In IEEE Transactions on Computers, 38(9), pp. 1460-1462, 1989.
[4]
{4} A. Basu, T.C. Wilson, D.K. Banerji, and J.C. Majithia. An approach to minimize testability for BILBO based built-in self-test. In Proc. 5th Int. Conf on VLSI Design, pp. 354-355, 1992.
[5]
{5} S.P. Lin, C.A. Njinda, and M.A. Breuer. Generating a family of testable designs using the BILBO methodology. In Journal of Electronic Testing: Theory and Applications (JETTA) 4, pp. 71- 89, April 1993.
[6]
{6} C.I.H. Chen. Graph partitioning for concurrent test scheduling in VLSI circuits. In Proc. 28th Design Automation Conference, pp. 287-290, 1991.
[7]
{7} G.L. Craig, C.R. Kime, and K.K. Saluja. Test scheduling and control for VLSI built-in self-test. IEEE Transactions on Computers, 37(9), pp. 1099-1109, 1988.
[8]
{8} W.B. Jone, C.A. Papachristou, and M. Pereira. A scheme for overlaying concurrent testing of VLSI circuits. In Proc. 26th Design Automation Conference, pp. 531-536, June 1989.
[9]
{9} A. Orailoglu., and I.G. Harris. Test path generation and test scheduling for self-testable designs. In Proc. International Conference on Computer Design, pp. 528-531, 1993.
[10]
{10} I.G. Harris, and A. Orailoglu. Fine-grained test concurrency in test scheduling for partial-intrusion BIST. In Proc. European Design & Test Conference, pp. 119-123, 1994.
[11]
{11} S. Chiu, and C.A. Papachristou. A design for testability scheme with application to data path synthesis. In Proc. 28th Design Automation Conference, pp. 271-277, June 1991.
[12]
{12} A.P. Stroele, and H.J. Wunderlich. Hardware-optimal test register insertion. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 17(6), pp. 531-539, 1998.
[13]
{13} C.R. Reeves. Modern heuristic techniques for combinatorial problems, McGraw-Hill Book Company, 1995.
[14]
{14} P. Kollig, and B.M. Al-Hashimi. Simultaneous scheduling, allocation and binding in high level synthesis. IEE Electronics Letters, 33(18), pp. 1516-1518, 1997.

Cited By

View all
  • (2000)BISTing Data Paths at Behavioral LevelProceedings of the 2000 IEEE International Test Conference10.5555/839295.843665Online publication date: 3-Oct-2000
  • (2000)Power Conscious Test Synthesis and Scheduling for BIST RTL Data PathsProceedings of the 2000 IEEE International Test Conference10.5555/839295.843664Online publication date: 3-Oct-2000
  • (2000)Power conscious test synthesis and scheduling for BIST RTL data pathsProceedings International Test Conference 2000 (IEEE Cat. No.00CH37159)10.1109/TEST.2000.894261(662-671)Online publication date: 2000

Index Terms

  1. Efficient BIST hardware insertion with low test application time for synthesized data paths

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    DATE '99: Proceedings of the conference on Design, automation and test in Europe
    January 1999
    730 pages
    ISBN:1581131216
    DOI:10.1145/307418
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 January 1999

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    DATE99
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 518 of 1,794 submissions, 29%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 13 Sep 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2000)BISTing Data Paths at Behavioral LevelProceedings of the 2000 IEEE International Test Conference10.5555/839295.843665Online publication date: 3-Oct-2000
    • (2000)Power Conscious Test Synthesis and Scheduling for BIST RTL Data PathsProceedings of the 2000 IEEE International Test Conference10.5555/839295.843664Online publication date: 3-Oct-2000
    • (2000)Power conscious test synthesis and scheduling for BIST RTL data pathsProceedings International Test Conference 2000 (IEEE Cat. No.00CH37159)10.1109/TEST.2000.894261(662-671)Online publication date: 2000

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media