On Concurrent Test of Core-Based SOC Design

  • Authors:
  • Yu Huang;Wu-Tung Cheng;Chien-Chung Tsai;Nilanjan Mukherjee;Omer Samman;Yahya Zaidan;Sudhakar M. Reddy

  • Affiliations:
  • Mentor Graphics Corporation, 8005 S.W. Boeckman Rd., Wilsonville, OR 97070, USA. Yu_Huang@mentor.com;Mentor Graphics Corporation, 8005 S.W. Boeckman Rd., Wilsonville, OR 97070, USA. Wu-Tung_Cheng@mentor.com;Mentor Graphics Corporation, 8005 S.W. Boeckman Rd., Wilsonville, OR 97070, USA. Chien-Chung_Tsai@mentor.com;Mentor Graphics Corporation, 8005 S.W. Boeckman Rd., Wilsonville, OR 97070, USA. Nilanjan_Mukherjee@mentor.com;Mentor Graphics Corporation, 8005 S.W. Boeckman Rd., Wilsonville, OR 97070, USA. Omer_Samman@mentor.com;Mentor Graphics Corporation, 8005 S.W. Boeckman Rd., Wilsonville, OR 97070, USA. Yahya_Zaidan@mentor.com;Department of Electrical & Computer Engineering, University of Iowa, Iowa City, IA 52242, USA. Reddy@engineering.uiowa.edu

  • Venue:
  • Journal of Electronic Testing: Theory and Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, a method to solve the resource allocation and test scheduling problems together in order to achieve concurrent test for core-based System-On-Chip (SOC) designs is presented. The primary objective for concurrent SOC test is to reduce test application time under the constraints of SOC pins and peak power consumption. The methodology used in this paper is not limited to any specific Test Access Mechanism (TAM). Additionally, it can also be applied to SOC budgeting at design phase to predict a tradeoff between test application time and SOC pins needed. The contribution of this paper is the formulation of the problem as a well-known 2-dimensional bin-packing problem. A best-fit heuristic algorithm is adopted to achieve optimal solution.