Assignment and allocation of highly testable data paths under scan optimization

DOI10.1016/S0167-9260(96)00013-2MaRDI QIDQ4332044zbMATH OpenOpenAlexWikidataFDO

Authors Asad A. Ismaeel, Muhammad K. Dhodhi, Rajan Mathew

Publication date 27 February 1997

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-9260(96)00013-2

zbMATH Keywords

Design for testabilityFeedback loopHigh level synthesisModule allocationRegister allocationScan pathSchedulingSequential depthSequential loops

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Recommendations

• Design of Optimal Scan Tree Based on Compact Test Patterns for Test Time Reduction
• On the Switching Activity and Static Test Compaction of Multicycle Scan-Based Tests
• Reconfigured Scan Forest for Test Application Cost, Test Data Volume, and Test Power Reduction
• Optimal allocation of test case considering testing-resource in partition testing
• A storage-based built-in test pattern generation method for scan circuits based on partitioning and reduction of a precomputed test set

Cited in

(1)

• Data path synthesis

This page was built for publication: Assignment and allocation of highly testable data paths under scan optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332044)