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.

Test Scheduling and Scan-Chain Division Under Power Constraint

In English

Författare

Summary, in English

An integrated technique for test scheduling and scan-chain division under power constraints is proposed in this paper. We demonstrate that optimal test time can be achieved for systems tested by an arbitrary number of tests per core using scan-chain division and we define an algorithm for it. The design of wrappers to allow different lengths of scan-chains per core is also outlined. We investigate the practical limitations of such wrapper design and make a worst case analysis that motivates our integrated test scheduling and scan-chain division algorithm. The efficiency and usefulness of our approach have been demonstrated with an industrial design.

Publiceringsår

2001

Språk

Engelska

Sidor

259-259

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

  • scan-chain
  • test scheduling
  • wrapper design
  • testing
  • embedded systems

Conference name

Tenth Asian Test Symposium ATS 2001

Conference date

2001-11-19 - 2001-11-21

Conference place

Kyoto, Japan

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1081-7735
  • ISBN: 0-7695-1378-6