Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Buffer and Controller Minimization for Time-Constrained Testing of System-On-Chip

Författare

Summary, in English

Test scheduling and Test Access Mechanism (TAM)design are two important tasks in the development of a System-on-Chip (SOC)test solution.Previous test scheduling techniques assume a dedicated designed TAM which have the advantage of high exibility in the scheduling process. However,hardware verhead for implementing the TAM and additional routing is required of the TAMs.In this paper we propose a technique that makes use of the existing functional buses for the test data transportation inside the SOC.We have dealt with the test scheduling problem with this new assumption and developed a technique to minimize the test-controller and buffer size for a bus- based multi-core SOC.We have solved the problem by using a constraint logic pr gramming (CLP) technique and demonstrated the ef ciency of our approach by running experiments on benchmark designs.

Publiceringsår

2003

Språk

Engelska

Sidor

385-392

Publikation/Tidskrift/Serie

[Host publication title missing]

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • test access mechanisms
  • TAM
  • system-on-chip
  • SOC
  • data transportation
  • constraint logic programming
  • test scheduling

Conference name

18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems DFT03

Conference date

2003-11-03 - 2003-11-05

Conference place

Boston, MA, United States

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1550-5774
  • ISBN: 0-7695-2042-1