File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: High level synthesis for loop-based BIST

TitleHigh level synthesis for loop-based BIST
Authors
Issue Date2000
Citation
Journal Of Computer Science And Technology, 2000, v. 15 n. 4, p. 338-345 How to Cite?
AbstractArea and test time are two major overheads encountered during data path high level synthesis for BIST. This paper presents an approach to behavioral synthesis for loop-based BIST. By taking into account the requirements of the BIST scheme during behavioral synthesis processes, an area optimal BIST solution can be obtained. This approach is based on the use of test resources reusability that results in a fewer number of registers being modified to be test registers. This is achieved by incorporating self-testability constraints during register assignment operations. Experimental results on benchmarks are presented to demonstrate the effectiveness of the approach.
Persistent Identifierhttp://hdl.handle.net/10722/155121
ISSN
2015 Impact Factor: 0.475
2015 SCImago Journal Rankings: 0.437

 

DC FieldValueLanguage
dc.contributor.authorLi, Xen_US
dc.contributor.authorCheung, PYSen_US
dc.date.accessioned2012-08-08T08:31:56Z-
dc.date.available2012-08-08T08:31:56Z-
dc.date.issued2000en_US
dc.identifier.citationJournal Of Computer Science And Technology, 2000, v. 15 n. 4, p. 338-345en_US
dc.identifier.issn1000-9000en_US
dc.identifier.urihttp://hdl.handle.net/10722/155121-
dc.description.abstractArea and test time are two major overheads encountered during data path high level synthesis for BIST. This paper presents an approach to behavioral synthesis for loop-based BIST. By taking into account the requirements of the BIST scheme during behavioral synthesis processes, an area optimal BIST solution can be obtained. This approach is based on the use of test resources reusability that results in a fewer number of registers being modified to be test registers. This is achieved by incorporating self-testability constraints during register assignment operations. Experimental results on benchmarks are presented to demonstrate the effectiveness of the approach.en_US
dc.languageengen_US
dc.relation.ispartofJournal of Computer Science and Technologyen_US
dc.titleHigh level synthesis for loop-based BISTen_US
dc.typeArticleen_US
dc.identifier.emailCheung, PYS:paul.cheung@hku.hken_US
dc.identifier.authorityCheung, PYS=rp00077en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0033717539en_US
dc.identifier.volume15en_US
dc.identifier.issue4en_US
dc.identifier.spage338en_US
dc.identifier.epage345en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLi, X=8228906100en_US
dc.identifier.scopusauthoridCheung, PYS=7202595335en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats