(2003) Efficient static test compaction algorithms for combinational circuits based on test relaxation. Masters thesis, King Fahd University of Petroleum and Minerals.
|
PDF
10258.pdf Download (805kB) | Preview |
Arabic Abstract
التطور المذهل في تصميم وصناعة الرقائق ذات التكامل العالي جداً مهد الطريق لصناعة الرقائق الحاوية للأنظمة . أحد التحديات في هذه التقنية هو الحجم الكبير لبيانات الاختبار . يمكن حل هذه المشكلة بتقليص أو ضغط البيانات . في هذه الأطروحة نقدم طرق جديدة لتقليص بيانات الاختبار بعد إنتاجها ولإعادة ترتيب هذه البيانات للدوائر المنطقية غير التعاقبية . كما نقدم طائفة جديدة من خوارزميات تقليص بيانات الاختبار مبنية على تفكيك البيانات . النتائج التجريبية تعكس كفاءة الخوارزميات المقترحة .
English Abstract
Advances in the semi-conductor process and design technology have paved the way for system-on-chips (SoCs). Traditional IC design in which every circuit is designed from scratch and reuse is limited only to standard cell libraries is more and more replaced by the SoC design methodology. However, this new design methodology has its own challenges. A major challenge is to reduce the increasing volume of test data. Basically, there are two approaches: compression and compaction. In this thesis, the problems of static compaction and test vector reordering for combinational circuits are investigated. A new class of static compaction algorithms referred to as test vector decomposition (TVD) is introduced. Two new static compaction algorithms based on TVD are proposed. Besides, the use of the critical path tracing algorithm as a fault simulator in test vector reordering procedures is proposed. Experimental results are provided to demonstrate the efficiency and effectiveness of our algorithms.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Information and Computer Science |
| Committee Advisor: | El-Maleh, Aiman H. |
| Committee Members: | Sait, Sadiq M. and Amin, Alaaeldin A. M. |
| Depositing User: | Mr. Admin Admin |
| Date Deposited: | 22 Jun 2008 14:00 |
| Last Modified: | 01 Nov 2019 13:58 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/10258 |