Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead

Built-in self-test (BIST) techniques have evolved as cost-effective techniques for testing digital circuits. These techniques add test circuitry to the chip such that the chip has the capability to test itself. A prime concern in using BIST is the area overhead due to the modification of normal registers to be test registers. This paper presents data path allocation algorithms that 1) maximize the sharing of test registers resulting in a fewer number of registers being modified for BIST, and 2) minimize the number of CBILBO registers.

[1]  Parimal Pal Chaudhuri,et al.  Design of Testable VLSI Circuits with Minumum Area Overhead , 1989, IEEE Trans. Computers.

[2]  Haidar Harmanani,et al.  A data path synthesis method for self-testable designs , 1991, 28th ACM/IEEE Design Automation Conference.

[3]  Daniel P. Siewiorek,et al.  Automated Synthesis of Data Paths in Digital Systems , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Donald E. Thomas,et al.  Exploiting the special structure of conflict and compatibility graphs in high-level synthesis , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  ASHUTOSH MUJUMDAR,et al.  Incorporating testability considerations in high-level synthesis , 1994, J. Electron. Test..

[6]  Magdy Abadir,et al.  A Knowledge-Based System for Designing Testable VLSI Chips , 1985, IEEE Design & Test of Computers.

[7]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[8]  Miodrag Potkonjak,et al.  Synthesizing designs with low-cardinality minimum feedback vertex set for partial scan application , 1994, Proceedings of IEEE VLSI Test Symposium.

[9]  Haidar Harmanani,et al.  An improved method for RTL synthesis with testability tradeoffs , 1993, ICCAD.

[10]  Christos A. Papachristou,et al.  An improved method for RTL synthesis with testability tradeoffs , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[11]  LaNae J. Avra,et al.  ALLOCATION AND ASSIGNMENT IN HIGH-LEVEL SYNTHESIS FOR SELF-TESTABLE DATA PATHS , 1991, 1991, Proceedings. International Test Conference.

[12]  Barry M. Pangrle,et al.  On the complexity of connectivity binding , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Niraj K. Jha,et al.  Behavioral Synthesis of Highly Testable Data Paths under the Non-Scan and Partial Scan Environments , 1993, 30th ACM/IEEE Design Automation Conference.

[14]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..