A New Multiple Weight Set Calculation Algorithm
|
|
- Andrew Hood
- 5 years ago
- Views:
Transcription
1 A New Multiple Weight Set Calculation Algorithm Hong-Sik Kim Jin-kyue Lee Sungho Kang Dept. of Electrical Eng. Yonsei Univ. Shinchon-dong 134, Seodaemoon Gu, Seoul, Korea Abstract The number of weighted random depends on the sampling probability of the corresponding deterministic test pattern. Therefore if the weight set is extracted from the deterministic pattern set with high sampling probabilities, the test length can be shortened. In this paper we present a new multiple weight set generation algorithm that generates high performance weight sets by removing deterministic with low sampling probabilities. In addition, the weight set that makes the variance of sampling probabilities for deterministic test small, reduces the number of the deterministic test with low sampling probability. Henceforth we present a new weight set calculation algorithm that uses the optimal candidate list and reduces the variance of the sampling probability. The Results on ISCAS 85 and ISCAS 89 benchmark circuits prove the effectiveness of the new weight set calculation algorithm. 1. Introduction As the integrity of VLSI circuits increases, the complexity and cost of their tests have increased. BIST (built-in self test) is one of the attractive solutions to these problems. As a BIST pattern generator, a pseudo-random test pattern generator or an LFSR (Linear feedback shift register) is widely adopted for its low hardware overhead. However since there are many random pattern resistive faults that can reduce the efficiency of the BIST test generator, a large number of random are required to achieve high fault coverage. To overcome this problem, several solutions have been proposed. One of the solutions is the reseeding of an LFSR [1,2]. But the amount of the seeds is quite large to reduce the test application time. Several DFT techniques such as the test point insertion can reduce test or the test time with high fault coverage. These DFT techniques are to modify the circuit under test (CUT) more random pattern testable [3-8]. But these kinds of DFT application can exert timing impact on the designed circuit by inserting redundant logic on the critical path. Weighted random tests have been proposed to solve this problem [9-13]. In weighted random tests, each primary input have different biased probability of logic value 1. A weighted random test pattern generator is composed of an LFSR and some combination logic to bias the input probability. The test generator biases the probability that logic value 1 occurs at each primary input through the weight calculation logic. It has been proved through many experiments that weighted random are very efficient for detecting random pattern resistant faults. The methodology of generating weighted random test can be classified into two kinds according to the source of weight calculation. One is the approach based on some structural analysis on the circuit topology [12-13], while the other is based on the deterministic test pattern set. The former has the advantage of being used in an ATPG (Automatic Test Pattern Generation) process and consumes less time to generate weight sets than the latter. But it cannot guarantee sufficient fault coverage with adequate test length. However, the latter can provide high fault coverage with the reasonable test length. The new algorithm is based on the approach with the deterministic test pattern set. The new weight generation algorithm consists of two stages. The first stage makes a candidate list for generating weight sets from the deterministic test. In the second stage, the variance of the sampling probabilities of test in the candidate list is reduced. The sampling probability of a deterministic test pattern with a weight set is defined as the probability that the test pattern occurs during the weighted random test generation cycle. Therefore a high sampling probability means less time to generate the corresponding test pattern. The deterministic test with low probability than those of an LFSR are removed from the deterministic test pattern set and the remaining are included in the candidate list to calculate a weight set. This comes out from the idea where the weighted random pattern generator should have better sampling probability than that of an LFSR. From the candidate list, the weight set and the sampling probability are calculated. The weight set that makes the sampling probabilities of the deterministic test in the candidate list low increases the test cycle. By means of reducing the variance ITC INTERNATIONAL TEST CONFERENCE /01 $ IEEE
2 of the sampling probabilities for the deterministic test in the candidate list, the low sampling probabilities can be increased [11]. Therefore the weight set calculated from the candidate list is modified to reduce the variance of the sampling probabilities. The simulation results show that the new algorithm has fewer weight sets and smaller test. The lower the number of weight sets, the lower the hardware overhead in multiple weight set BIST. Similarly, the lower the number of the test, the shorter the test application time. Therefore the new methodology can reduce the overall hardware overhead and the test time using the weighted random BIST. This paper would be organized as follows. Section 2 explains the basic notations that are used in this paper. In section 3, the method for selecting a candidate set from deterministic test is explained. The methodology of reducing the variance of sampling probabilities is described in section 4. In section 5, a new multiple weight set calculation algorithm is discussed. Section 6 shows the simulation results and finally section 7 concludes this paper. 2. Basic Notations To explain the process of the new weight set calculation algorithm, the following notations are used. Let a deterministic test pattern and a test pattern set be t j and T = t 1, t 2,,t l accordingly, where l is the test length. The i-th bit of a deterministic test pattern t j and the weight of bit position i are defined as t j [ and w i, respectively. w i is calculated by the equation (1). tj T tj[ = 1 wi = (1) tj T tj[ X Let W = w 1, w 2,,w m and P j be a weight set of an m-input circuit and the sampling probability of the test pattern t j. The sampling probability P j is the probability that each deterministic test pattern t j occurs during the test generation. The equation of calculating the P j is as follows. Pj = m t= 1, tj[ X ( wi tj[ ) + (1 wi) (1 tj[ ) (2) In addition, the concept of the sampling probability of a test pattern with an LFSR is required for the new weight calculation algorithm. The sampling probability of a test pattern with an LFSR, P(lfsr), can be easily calculated by the equation (2) with all the weight set to 0.5. To reduce the variance of sampling probabilities, the average is calculated first by the equation (3). l Pj j= A = 1 l (3) The variance of the sampling probabilities for the deterministic test, V, is calculated by the equation (4). V l j= = 0 ( Pj A) l To reduce the variance, the effect of modifying the weight of i-th bit is evaluated by E i. This is calculated by the equation (5). E j = m t= 1, tj[ X 2 (4) ( A Pj) tj[ ) + ( Pj A) (1 tj[ ) (5) In the fault simulation with weighted random, if the number of test that do not detect any fault exceeds a certain number, then the next weight generation must proceed. So the fixed number of test should be defined. In this paper the variable NP means the number of test that do not detect any fault continuously with a weight. After all the processes end, the applied by the weighted random pattern generator include the NP s that should be removed to calculate the total test. Therefore the test are computed as follows. test = total number of weighted random test ( 1) NP 3. Selecting Candidate from Deterministic Test Patterns The weight calculation is based on the probability mechanism. When a weight set is generated, the corresponding sampling probability of each test pattern is determined. Deterministic pattern whose sampling probability with the calculated weight set is lower than that of an LFSR, are deleted from the deterministic test pattern set and the remainders are used as candidates for the weight generation. It is motivated from the idea that weighted random should have better sampling probabilities than those of an LFSR. Figure 1 shows the process of making a candidate list from deterministic test for generating a weight set. First of all, deterministic test generation makes a deterministic test pattern set, or a structure Pattern_list, which will be used for the first weight calculation. Then 879
3 the weight set is calculated with the Pattern_list, and the sampling probabilities of all the deterministic test are calculated. The flag of each Pattern_list is designated, if the probability of each pattern is lower than that of an LFSR. The difference between the previous average sampling probability and the current average probability, sampling_prob, is calculated. This process is repeated while the sampling_prob is not being zero. After the sampling_prob becomes zero, the list with the whose flags are zero is the best candidate for weight calculation. deterministic_test_gen(); while( sampling_prob!= 0) calculate_weight_set(pattern_list); calculate_sampling_prob(); for( i = 0; i < num_vec; i ++) if ( P(t i ) < P(lfsr) ) Pattern_list[.flag = 1; update_candidate_set(pattern_list); sampling_prob = previous_prob current_prob; calculate_weight_set(pattern_list); Figure 1. Pseudo code for selecting candidate Table 1. Sampling probabilities of deterministic test bit1 bit 2 bit 3 bit 4 bit 5 P i P(lfsr) Test X X Test X X Test 3 X X Test 4 X X Test 5 X X Test 6 X 0 X Test 7 X X Test X X Test 9 X 1 X Test 10 X 0 X Weight The process shown in Figure 1 will be explained by using an example. Table 1 presents the first deterministic test. The last row includes the weight set and the last column includes the sampling probability of the j-th test pattern. The sampling probability of each test pattern with an LFSR is on the second to the last column. Since the probabilities of test 2 and test 3 are lower than those of the LFSR, they are removed from the candidate list and remainders are included in the candidate list. Table 2 shows the results after removing the test. The last column is the previous sampling probability and the seventh column is the current sampling probability. The current probability increased after removing the. This means that the test could be generated in less clock cycles. Table 2. Sampling probabilities after removing the test Bit1 bit 2 bit 3 bit 4 bit 5 P i Previous Test X X Test 4 X X Test 5 X X Test 6 X 0 X Test 7 X X Test X X Test 9 X 1 X Test 10 X 0 X Weight Variance of Sampling Probabilities It is important to generate a weight set that reduces the number of test. The minimum of the sampling probabilities should be increased since the test application cycle depends on the minimum sampling probability. One of the methods of increasing the minimum of the sampling probabilities is to decrease the variance of the sampling probabilities. The method for generating a weight set which decreases the variance of the sampling probabilities is shown in Figure 2. After calculating the weight set from the test in the candidate list, the average of the sampling probabilities, A, is computed by the equation (3), where l is the number of the deterministic. Then the variance of the sampling probabilities for the deterministic test, V, is calculated through the equation (4). To reduce the variance, the effect of modifying the weight set of i-th bit is evaluated by E i, which is calculated through the equation (5). V is decreased by increasing w i when t j [ is logic value 1 and P j is smaller than A, or when t j [ is logic value 0 and P j is larger than A. V is also decreased by decreasing w i when t j [ is logic value 0 and P j is smaller than A, or when t j [ is logic value 1 and P j is larger than A. Therefore, if E i is positive, w i should be increased, and if E i is negative, w i should be decreased. The rate α, the extent to which we increases or decreases the, should be confirmed. α is an userdefined constant larger than 1. When E i is positive, w i is multiplied by α and when E i is negative, w i is divided by α. 880
4 Reduce_variance(Candidate_list) calculate_weight_set(candidate_list); calculate_sampling_prob(candidate_list); calculate_average_variance(); while( V n < V p ) calculate_ei(); modify_weight_set(); calculate_weight_set(candidate_list); calculate_sampling_prob(candidate_list); calculate_average_variance(); generation and the fault simulation cycles, the easy-to-test faults with random are removed from the fault list. Then an ATPG generates the deterministic test pattern set for the remaining faults. After the deterministic test generation, a weight set and sampling probabilities are calculated, and the inefficient deterministic test are removed from the test list. In this cycle, the methodology described in the section 3 is adopted. The weighted random test are generated and fault simulation is performed. Finally the calculated weight set is rounded for a BIST implementation. An original weight is rounded to one of these values: 1/16, 1/8, 1/4, 3/8, 1/2, 5/8, 3/4, 15/16. The, 0 and 1 are replaced by 1/16 and 15/16, respectively. Figure 2. Pseudo code for reducing variance Table 3. E i and modified weight set Bit1 bit 2 bit 3 bit 4 bit 5 Ei Weight Table 4. Sampling probabilities after reducing variance Bit1 bit 2 bit 3 bit 4 bit 5 P i Previous Test X X Test 4 X X Test 5 X X Test 6 X 0 X Test 7 X X Test X X Test 9 X 1 X Test 10 X 0 X Weight Table 3 shows the value of E of each bit calculated by the equation (5) and the weight set modified according to the sign of E. In this example, the value of α is defined as The sampling probabilities generated by the equation (2) using the modified weight set are presented in table 3. The deterministic test pattern that is most unlikely to occur during weighted random test application cycle is the pattern with the minimum sampling probability. The minimum sampling probability before reducing the variance is but the minimum sampling probability after reducing the variance is Therefore the reducing the variance leads to the reduction of the test application length. 5. Total Weight Set Generation Algorithm Figure 3 shows the overall flow chart of a new weight set generation algorithm. First, in the pseudo random test Figure 3. New weight set generation algorithm The rounding is performed as follows. Let the variable x be the weight to be rounded and the function f() be the rounding function, respectively. And let the variable y be the rounded weight. y = f(x) if x < 1/8 then f(x) = 1/16 if n/8 < x < (n +1)/8, then f(x) = n /8 if 7/8 < x, then f(x) = 15/16 where n = 1, 2,,6 881
5 The deleted deterministic are used for calculating the next weight set. So the weight set with the deleted test and the corresponding sampling probabilities are calculated. And from the new deterministic test pattern set, the with lower probabilities than those of an LFSR are removed and the remainders are included in the new candidate set, which is used for calculating the next weight set. Until all the testable faults excluding the redundant faults are removed from the fault list, this process is repeated. Example : Let us assume that the following test are made during the deterministic test pattern generation. t 1 = 1, 1, X, 1, 1 t 2 = 0, 1, 0, 1, 1 t 3 = 0, X, X, 0, 0 t 4 = 1, 0, 1, 1, 0 First of all, a weight set is calculated from the test set T = t 1, t 2, t 3, t 4 and the sampling probabilities of test are calculated. The weight set is W=w 1 =0.500, w 2 =0.667, w 3 =0.500, w 4 =0.750, w 5 =0.500 and the sampling probability is P=p1=0.125, p2=0.063, p3=0.063, p4= If the sampling probability of a test pattern is lower than that of an LFSR, the is removed and the remainders constitute the candidate list. Since the sampling probability of the LFSR is P lfsr = pl 1 =0.063, pl 2 =0.031, pl 3 =0.125, pl 4 =0.031, the pattern t 2 is removed and the remainders constitute the candidate list C=c 1 = t 1, c 2 = t 3, c 3 = t 4. From the candidate list, the weight set and the sampling probability are calculated. The weight set is W=w 1 =0.667, w 2 =0.500, w 3 =1.000, w 4 =0.667, w 5 =0.333, and the sampling probability is P = pl 1 =0.074, pl 2 =0.074, pl 3 = The average of the previous sampling probabilities is while the average of the current sampling probabilities is Therefore the average increases. And then the weight set is modified according to the sign of E i in order to reduce the variance of the sampling probabilities. Since the E = E 1 = 0.075, E 2 = 0.074, E 3 = 0.075, E 4 = 0.075, E 5 = 0.075, the weight set is modified as W=w 1 =0.635, w 2 =0.525, w 3 =0.952, w 4 =0.635, w 5 = After the modification of the weight set, the rounding on the weight set and the fault simulation are performed. The new weight set is calculated and the above procedure is repeated until the target fault coverage is achieved. 6. Simulation Results We have implemented the new weight set generation algorithm in C, on an Ultra Sparc 60 running Solaris operating system and the results are derived on ISCAS 85 and ISCAS 89 benchmark circuits. The efficiency of the weight calculation algorithm can be evaluated by the number of weight sets and the number of test. The number of weight sets directly affects the BIST hardware overhead. Similarly the nu mber of test affects the test time or the test cost. To prove the efficiency, the new algorithm is compared with the Minimum Variance [11] that has shown the best results on ISCAS 85 benchmark circuits. The results of comparison on ISCAS 85 benchmark circuits are shown in Table 5 when NP is 512. The in the Tables means the total number of weighted random test excluding NP which don t detect any new fault. In all cases, the new algorithm is more efficient than Minimum Variance. The number of test of the new algorithm is fewer than or almost equal to the number of test of [11]. And the number of weight sets of the new algorithm is much fewer than or equal to the number of weight sets of [11] on all circuits. For some circuits, the number of test is slightly larger than the number of [11]. However the number of weight sets is smaller in those cases. Table 5. Comparison with Minimum Variance (NP = 512) Minimum Variance[11] c c c c c c c c c Table 6 describes the results in case when NP = The number of weight sets of the new algorithm on some larger circuits decreased from the number of weight sets when NP = 512. The number of weight sets of the new algorithm is fewer than that of the weight sets of [11] and the number of test of the new algorithm is almost equal to or fewer than that of test of [11]. The results of the new algorithm have higher performance than those of Minimum Variance when NP is 1024, too. Table 7 describes the comparison with Minimum Variance in the case when NP = 256. The number of test increased slightly compared with the case when NP = 512. All the numbers of the weight sets of the new algorithm are equal to or fewer than those of Minimum Variance. And the number of test is almost equal to the number of test of [11]. The results of the 882
6 new algorithm have higher performance than those of Minimum Variance when NP is 256. Therefore results show that regardless of NP, the performance of the new algorithm is much higher than that of Minimum Variance on most of benchmark circuits. Table 6. Comparison with Minimum Variance (NP = 1024) Minimum Variance [11] c c c c c c c c c Table 7. Comparison with Minimum Variance (NP = 256) Minimum Variance[11] c c c c c c c c c The comparison with X-test [14] on ISCAS 85 and ISCAS 89 benchmark circuits is shown in Table 8. Since X-test shows the best results on ISCAS 89 benchmark circuits, it is used for performance comparison with our new algorithm. Table 8 shows the results when NP = 512 since X-test provide the results only when NP is 512. In the case of ISCAS 89 benchmark circuits, the results of large size benchmark circuits are summarized. All the weight sets of the new algorithm are fewer than or equal to those of X-test except for cs1196, cs1238 and cs In cs1196, cs1238 and cs38584, the new algorithm has much fewer test. In small size benchmark circuits, the test are nearly the same. And in large size circuits, the new algorithm makes a lower number of test than X-test. In almost all benchmark circuits, the new algorithm has weight sets fewer than or equal to X-test and test of the new algorithm are fewer than or equal to those of X-test. Table 8. Result of fault simulation (NP = 512) X-test[14] c c c c c c c c c cs cs cs cs cs cs cs cs cs According to the results on ISCAS 85 and ISCAS 89 benchmark circuits, the new algorithm generates fewer multiple weight sets and smaller test than those of previous works. 7. Conclusion Weighted random test pattern generation is widely known as a good solution for the test of circuits with random pattern resistant faults. This technique can be implemented as a Built-in Self Test or a built-off test schemes. The performance of a weight calculation algorithm can be evaluated by the number of weight sets and the number of test. The new algorithm for calculating weight sets is composed of two stages. One is for selecting the candidate list for weight calculation and the other is for reducing the variance of the sampling probabilities. The first stage is based on the fact that the weighted random test should have better sampling probability than those of an LFSR. And the second stage is based on the fact that the minimum sampling probability is one of the major factors increasing the number of test and reducing the variance of sampling probabilities can increase the minimum sampling probability. The new algorithm uses high performance candidate lists by removing the deterministic test 883
7 with lower sampling probability, and modifies the weight set by reducing the variance of sampling probabilities. The new algorithm can generate more efficient multiple weight sets than previously known methods. In most of benchmark circuits, the number of weight sets and the number of the test are quite lower than those of the previous works. In the case when the number of weight sets is larger, the number of test is much smaller. The simulation results on the ISCAS 85 and ISCAS 89 circuits prove that the new algorithm generates high performance weight sets. [12] M. Bershteyn, Calculation of Multiple Sets of Weighted Random Testing, Proc. of International Test Conference, 1993, pp [13] R. Lisanke, F. Brglez, A. J. Degeus and D. Gregory, Testability Driven Random Test Pattern Generation, IEEE Trans. on Computer Aided Design, 1997, pp [14] B. Reeb and H. J. Wunderlich, Deterministic pattern generation for weighted random pattern testing, Proc. of European Design and Test Conference, 1996, pp References [1] S. Venkataraman, J. Rajski, S. Hellebrand and S. Tamick, An Efficient BIST Scheme Based on Reseeding of Multiple Polynomial Linear Feedback Shift Registers, Proc. of International Conference on Computer Aided Design, 1993, pp [2] S. Hellebrand, S. Tamick, J. Rajski and B. Courtois, Generation of Vector Patterns thorough Reseeding of Multiple-polynomial Linear Feedback Shift Registers, Proc. of International Test Conference, 1992, pp [3] C. H. Chen, T. Karnik, and D. G. Saab, Structural and behavioral synthesis for testability techniques, IEEE Trans. on Computer-Aided Design, vol. 13, 1994, pp [4] V. S. Iyenhar and D. Brand, Synthesis and pseudorandom pattern testable designs, Proc. of International Test Conference, 1989, pp [5] B. Seiss, P. Trouborst, and M. Schalz, Test point insertion for scan based BIST, Proc. of European Test Conference, 1991, pp [6] Y. Savaria, M. Youssef, B. Kaminska, and M. Koudil, Automatic test point insertion for pseudo -random testing, Proc. of International Symposium on Circuits and Systems, 1991, pp [7] K. T. Cheng and C. J. Lin, Timing-driven test point insertion for full-scan and partial-scan BIST, Proc. of International Test Conference, 1995, pp [8] N. A. Touba and E. J. McCluskey, Test point insertion based on path tracing, Proc. of VLSI Test Symposium, 1996, pp [9] F. Brglez. C. Gloster, and G. Kedem, Hardware-based weighted random pattern generation for boundary scan, Proc. of Design Automation Conference, 1989, pp [10] H. J. Wunderlich, Multiple distribution for biased random test, IEEE Trans. on Computer-Aided Design, vol. 9, 1990, pp [11] H. K. Lee and S. Kang, A new weight set generation algorithm for weighted random pattern generation, Proc. of International Conference on Computer Design, 1999, pp
Logic BIST. Sungho Kang Yonsei University
Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern
More informationRelating Entropy Theory to Test Data Compression
Relating Entropy Theory to Test Data Compression Kedarnath J. Balakrishnan and Nur A. Touba Computer Engineering Research Center University of Texas, Austin, TX 7872 Email: {kjbala, touba}@ece.utexas.edu
More informationBuilt-In Test Generation for Synchronous Sequential Circuits
Built-In Test Generation for Synchronous Sequential Circuits Irith Pomeranz and Sudhakar M. Reddy + Electrical and Computer Engineering Department University of Iowa Iowa City, IA 52242 Abstract We consider
More informationTest Pattern Generator for Built-in Self-Test using Spectral Methods
Test Pattern Generator for Built-in Self-Test using Spectral Methods Alok S. Doshi and Anand S. Mudlapur Auburn University 2 Dept. of Electrical and Computer Engineering, Auburn, AL, USA doshias,anand@auburn.edu
More informationOn Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic
On Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic Irith Pomeranz 1 and Sudhakar M. Reddy 2 School of Electrical & Computer Eng.
More informationIntroduction to VLSI Testing
Introduction to 李昆忠 Kuen-Jong Lee Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan Class Problems to Think How are you going to test A 32 bit adder A 32 bit counter A 32Mb
More informationONE of the main challenges in very large scale integration
386 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 26, NO. 2, FEBRUARY 2007 Relationship Between Entropy and Test Data Compression Kedarnath J. Balakrishnan, Member,
More informationReduction of Detected Acceptable Faults for Yield Improvement via Error-Tolerance
Reduction of Detected Acceptable Faults for Yield Improvement via Error-Tolerance Tong-Yu Hsieh and Kuen-Jong Lee Department of Electrical Engineering National Cheng Kung University Tainan, Taiwan 70101
More informationUMBC. At the system level, DFT includes boundary scan and analog test bus. The DFT techniques discussed focus on improving testability of SAFs.
Overview Design for testability(dft) makes it possible to: Assure the detection of all faults in a circuit. Reduce the cost and time associated with test development. Reduce the execution time of performing
More informationOne-Dimensional Linear Hybrid Cellular Automata: Their Synthesis, Properties and Applications to Digital Circuits Testing
One-Dimensional Linear Hybrid Cellular Automata: Their Synthesis, Properties and Applications to Digital Circuits Testing M. Serra, K. Cattell, S. Zhang, J.C. Muzio, D.M. Miller Dept. of Computer Science
More informationBuilt-In Self-Test. Outline
Built-In Self-Test Outline Motivation for BIST Testing SoC with BIST Test per Scan and Test per Clock HW and SW based BIST Exhaustive and pseudoexhaustive test generation Pseudorandom test generation with
More informationDictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults
Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults Chidambaram Alagappan and Vishwani D. Agrawal Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849,
More informationSIGNATURE ROLLBACK WITH EXTREME COMPACTION A TECHNIQUE FOR TESTING ROBUST VLSI CIRCUITS WITH REDUCED HARDWARE OVERHEAD
Annales Univ. Sci. Budapest., Sect. Comp. 39 (2013) 161 180 SIGNATURE ROLLBACK WITH EXTREME COMPACTION A TECHNIQUE FOR TESTING ROBUST VLSI CIRCUITS WITH REDUCED HARDWARE OVERHEAD Thomas Indlekofer (Paderborn,
More informationBrief Contributions. Optimal Selective Huffman Coding for Test-Data Compression 1 INTRODUCTION 2 SELECTIVE HUFFMAN ENCODING REVIEW
1146 IEEE TRANSACTIONS ON COMPUTERS, VOL. 56, NO. 8, AUGUST 2007 Brief Contributions Optimal Selective Huffman Coding for Test-Data Compression Xrysovalantis Kavousianos, Member, IEEE, Emmanouil Kalligeros,
More informationVECTOR REPETITION AND MODIFICATION FOR PEAK POWER REDUCTION IN VLSI TESTING
th 8 IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems Sopron, Hungary, April 13-16, 2005 VECTOR REPETITION AND MODIFICATION FOR PEAK POWER REDUCTION IN VLSI TESTING M. Bellos
More informationVLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
VLSI Physical Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 54 Design for Testability So, in the last lecture we talked
More informationVLSI System Testing. Testability Measures
ECE 538 VLSI System Testing Krish Chakrabarty Testability Measures ECE 538 Krish Chakrabarty 1 Testability Measures Origins Controllability and observability SCOAP measures Sources of correlation error
More informationSIMULATION-BASED APPROXIMATE GLOBAL FAULT COLLAPSING
SIMULATION-BASED APPROXIMATE GLOBAL FAULT COLLAPSING Hussain Al-Asaad and Raymond Lee Computer Engineering Research Laboratory Department of Electrical & Computer Engineering University of California One
More informationECE 512 Digital System Testing and Design for Testability. Model Solutions for Assignment #3
ECE 512 Digital System Testing and Design for Testability Model Solutions for Assignment #3 14.1) In a fault-free instance of the circuit in Fig. 14.15, holding the input low for two clock cycles should
More informationOutline - BIST. Why BIST? Memory BIST Logic BIST pattern generator & response analyzer Scan-based BIST architecture. K.T. Tim Cheng 08_bist, v1.
1 Outline - BIST Why BIST? Memory BIST Logic BIST pattern generator & response analyzer Scan-based BIST architecture 2 Why Built-In Self Test? TYPES On-Line Self-Test (Concurrent Checking) Functional Self-Test
More informationEECS 579: Test Generation 4. Test Generation System
EECS 579: Test Generation 4 Other Combinational ATPG Algorithms SOCRATES Structure-Oriented Cost-Reducing Automatic TESt pattern generation [Schultz et al. 988] An ATPG system not just a test generation
More informationDesign for Testability
Design for Testability Outline Ad Hoc Design for Testability Techniques Method of test points Multiplexing and demultiplexing of test points Time sharing of I/O for normal working and testing modes Partitioning
More informationDesign for Testability
Design for Testability Outline Ad Hoc Design for Testability Techniques Method of test points Multiplexing and demultiplexing of test points Time sharing of I/O for normal working and testing modes Partitioning
More informationEGFC: AN EXACT GLOBAL FAULT COLLAPSING TOOL FOR COMBINATIONAL CIRCUITS
EGFC: AN EXACT GLOBAL FAULT COLLAPSING TOOL FOR COMBINATIONAL CIRCUITS Hussain Al-Asaad Department of Electrical & Computer Engineering University of California One Shields Avenue, Davis, CA 95616-5294
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Final Examination
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2013-2014 Final Examination CLOSED BOOK Kewal K. Saluja Date:
More informationCombinational Equivalence Checking using Boolean Satisfiability and Binary Decision Diagrams
Combinational Equivalence Checking using Boolean Satisfiability and Binary Decision Diagrams Sherief Reda Ashraf Salem Computer & Systems Eng. Dept. Mentor Graphics Egypt Ain Shams University Cairo, Egypt
More informationFault Tolerant Computing CS 530 Random Testing. Yashwant K. Malaiya Colorado State University
Fault Tolerant Computing CS 530 Random Testing Yashwant K. Malaiya Colorado State University February 5, 2018 1 Random Testing Random testing, in some form, is common for both hardware or software testing.
More informationCounting Two-State Transition-Tour Sequences
Counting Two-State Transition-Tour Sequences Nirmal R. Saxena & Edward J. McCluskey Center for Reliable Computing, ERL 460 Department of Electrical Engineering, Stanford University, Stanford, CA 94305
More informationDelay Testing from the Ivory Tower to Tools in the Workshop
Delay Testing from the Ivory Tower to Tools in the Workshop Einar Johan Aas Department of Electronics and Telecommunications, NTNU Nordic Test Forum, Tallinn, 25. November 2008 Name, title of the presentation
More informationPredicting IC Defect Level using Diagnosis
2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising
More informationSTATISTICAL FAULT SIMULATION.
STATISTICAL FAULT SIMULATION. JINS DAVIS ALEXANDER, GRADUATE STUDENT, AUBURN UNIVERSITY. ABSTRACT: Fault simulation is used for the development or evaluation of manufacturing tests. However with the increase
More informationAn Adaptive Decompressor for Test Application with Variable-Length Coding
Vol. 2 IPSJ Digital Courier June 2006 Regular Paper An Adaptive Decompressor for Test Application with Variable-Length Coding Hideyuki Ichihara, Masakuni Ochi,, Michihiro Shintani, and Tomoo Inoue Test
More informationIHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke
IHS 3: Test of Digital Systems R.Ubar, A. Jutman, H-D. Wuttke Integrierte Hard- und Softwaresysteme RT-Level Design data path and control path on RT-level RT level simulation Functional units (F1,..,F4)
More informationStructural Delay Testing Under Restricted Scan of Latch-based Pipelines with Time Borrowing
Structural Delay Testing Under Restricted Scan of Latch-based Pipelines with Borrowing Kun Young Chung and Sandeep K. Gupta University of Southern California, EE Systems Abstract High-speed circuits use
More informationOn Random Pattern Testability of Cryptographic VLSI Cores
On Random Pattern Testability of Cryptographic VLSI Cores A. Schubert, W. Anheier Institut für Theoretische Elektrotechnik und Mikroelektronik (ITEM) University of Bremen P.O. Box 33 04 40, D-28334 Bremen
More informationHow does the computer generate observations from various distributions specified after input analysis?
1 How does the computer generate observations from various distributions specified after input analysis? There are two main components to the generation of observations from probability distributions.
More informationFault Tolerant Computing CS 530 Random Testing. Yashwant K. Malaiya Colorado State University
Fault Tolerant Computing CS 530 Random Testing Yashwant K. Malaiya Colorado State University February 20, 2012 1 Random Testing Random testing, in some form, is common for both hardware or software testing.
More informationGeneration of High Quality Non-Robust Tests for Path Delay Faults
Generation of High Quality Non-Robust Tests for Path Delay Faults Kwang-Ting Cheng Hsi-Chuan Chen Department of ECE AT&T Bell Laboratories University of California Murray Hill, NJ 07974 Santa Barbara,
More informationEECS150 - Digital Design Lecture 21 - Design Blocks
EECS150 - Digital Design Lecture 21 - Design Blocks April 3, 2012 John Wawrzynek Spring 2012 EECS150 - Lec21-db3 Page 1 Fixed Shifters / Rotators fixed shifters hardwire the shift amount into the circuit.
More informationL9: Galois Fields. Reading material
L9: Galois Fields Reading material Muzio & Wesselkamper Multiple-valued switching theory, p. 3-5, - 4 Sasao, Switching theory for logic synthesis, pp. 43-44 p. 2 - Advanced Logic Design L9 - Elena Dubrova
More informationEECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs)
EECS150 - igital esign Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Nov 21, 2002 John Wawrzynek Fall 2002 EECS150 Lec26-ECC Page 1 Outline Error detection using parity Hamming
More informationLinear Feedback Shift Registers (LFSRs) 4-bit LFSR
Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple shift-registers with a small number of xor gates. Used for: random number generation
More informationTransition Faults Detection in Bit Parallel Multipliers over GF(2 m )
Transition Faults Detection in Bit Parallel Multipliers over GF( m ) Hafizur Rahaman Bengal Engineering & Science University, Shibpur Howrah-73, India rahaman_h@it.becs.ac.in Jimson Mathew Computer Science
More informationHardware testing and design for testability. EE 3610 Digital Systems
EE 3610: Digital Systems 1 Hardware testing and design for testability Introduction A Digital System requires testing before and after it is manufactured 2 Level 1: behavioral modeling and test benches
More informationOverview. 4. Built in Self-Test. 1. Introduction 2. Testability measuring 3. Design for testability. Technical University Tallinn, ESTONIA
Overview. Introduction 2. Testability measuring 3. Design for testability 4. Built in Self-Test Built-In Self-Test Outline Motivation for BIST Testing SoC with BIST Test per Scan and Test per Clock HW
More informationLow complexity bit-parallel GF (2 m ) multiplier for all-one polynomials
Low complexity bit-parallel GF (2 m ) multiplier for all-one polynomials Yin Li 1, Gong-liang Chen 2, and Xiao-ning Xie 1 Xinyang local taxation bureau, Henan, China. Email:yunfeiyangli@gmail.com, 2 School
More informationECE 3060 VLSI and Advanced Digital Design. Testing
ECE 3060 VLSI and Advanced Digital Design Testing Outline Definitions Faults and Errors Fault models and definitions Fault Detection Undetectable Faults can be used in synthesis Fault Simulation Observability
More informationResearch Article Antirandom Testing: A Distance-Based Approach
Hindawi Publishing Corporation VLSI Design Volume 2008, Article ID 165709, 9 pages doi:10.1155/2008/165709 Research Article Antirandom Testing: A Distance-Based Approach Shen Hui Wu, 1 Sridhar Jandhyala,
More informationA Compiled-Code Parallel Pattern Logic Simulator With Inertial Delay Model
JOURNAL OF INFORMATION PARALLEL PATTERN SCIENCE LOGIC AND ENGINEERING SIMULATOR WITH 15, 885-897 INERTIAL (1999) DELAY MODEL 885 A Compiled-Code Parallel Pattern Logic Simulator With Inertial Delay Model
More informationCircuit for Revisable Quantum Multiplier Implementation of Adders with Reversible Logic 1 KONDADASULA VEDA NAGA SAI SRI, 2 M.
ISSN (O): 2349-7084 International Journal of Computer Engineering In Research Trends Available online at: www.ijcert.org Circuit for Revisable Quantum Multiplier Implementation of Adders with Reversible
More informationAn Effective Test and Diagnosis Algorithm for Dual-Port Memories
An Effective Test and Diagnosis Algorithm for Dual-Port Memories Youngkyu Park, Myung-Hoon Yang, Yongjoon Kim, Dae-Yeal Lee, and Sungho Kang This paper proposes a test algorithm that can detect and diagnose
More informationTest Generation for Designs with On-Chip Clock Generators
Test Generation for Designs with On-Chip Clock Generators Xijiang Lin Mark Kassab Mentor Graphics Corp. 8005 SW Boeckman Rd. Wilsonville, OR 97068 {xijiang_lin, mark_kassab}@mentor.com Abstract High performance
More informationImproved Cascaded Stream Ciphers Using Feedback
Improved Cascaded Stream Ciphers Using Feedback Lu Xiao 1, Stafford Tavares 1, Amr Youssef 2, and Guang Gong 3 1 Department of Electrical and Computer Engineering, Queen s University, {xiaolu, tavares}@ee.queensu.ca
More informationTransforming FSMs for Synthesis by Fault Tolerant Nano-PLAs
Transforming FSMs for Synthesis by Fault Tolerant Nano-PLAs Ilya Levin, Osnat Keren Tel Aviv University, Israel; Bar Ilan University, Israel ilia1@post.tau.ac.il, kereno@eng.biu.ac.il Abstract The paper
More informationAN IMPROVED LOW LATENCY SYSTOLIC STRUCTURED GALOIS FIELD MULTIPLIER
Indian Journal of Electronics and Electrical Engineering (IJEEE) Vol.2.No.1 2014pp1-6 available at: www.goniv.com Paper Received :05-03-2014 Paper Published:28-03-2014 Paper Reviewed by: 1. John Arhter
More informationof an algorithm for automated cause-consequence diagram construction.
Loughborough University Institutional Repository Development of an algorithm for automated cause-consequence diagram construction. This item was submitted to Loughborough University's Institutional Repository
More informationSingle Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference
Single Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference Copyright 1998 Elizabeth M. Rudnick 1 Modeling the effects
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationWITH increasing complexity in systems design from increased
150 IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, VOL. 51, NO. 1, FEBRUARY 2001 Data Compression in Space Under Generalized Mergeability Based on Concepts of Cover Table and Frequency Ordering
More informationFPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials
FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials C. Shu, S. Kwon and K. Gaj Abstract: The efficient design of digit-serial multipliers
More informationINFORMATION THEORETIC AND SPECTRAL METHODS OF TEST POINT, PARTIAL-SCAN AND FULL-SCAN FLIP-FLOP INSERTION TO IMPROVE INTEGRATED CIRCUIT TESTABILITY
INFORMATION THEORETIC AND SPECTRAL METHODS OF TEST POINT, PARTIAL-SCAN AND FULL-SCAN FLIP-FLOP INSERTION TO IMPROVE INTEGRATED CIRCUIT TESTABILITY BY RAGHUVEER AUSOORI A thesis submitted to the Graduate
More informationPattern History Table. Global History Register. Pattern History Table. Branch History Pattern Pattern History Bits
An Enhanced Two-Level Adaptive Multiple Branch Prediction for Superscalar Processors Jong-bok Lee, Soo-Mook Moon and Wonyong Sung fjblee@mpeg,smoon@altair,wysung@dspg.snu.ac.kr School of Electrical Engineering,
More informationPLA Minimization for Low Power VLSI Designs
PLA Minimization for Low Power VLSI Designs Sasan Iman, Massoud Pedram Department of Electrical Engineering - Systems University of Southern California Chi-ying Tsui Department of Electrical and Electronics
More informationApplication of Artificial Neural Networks in Evaluation and Identification of Electrical Loss in Transformers According to the Energy Consumption
Application of Artificial Neural Networks in Evaluation and Identification of Electrical Loss in Transformers According to the Energy Consumption ANDRÉ NUNES DE SOUZA, JOSÉ ALFREDO C. ULSON, IVAN NUNES
More informationA Hardware Approach to Self-Testing of Large Programmable Logic Arrays
EEE TRANSACTONS ON COMPUTERS, VOL. C-30, NO. 11, NOVEMBER 1981 A Hardware Approach to Self-Testing of Large Programmable Logic Arrays 829 WLFRED DAEHN AND JOACHM MUCHA, MEMBER, EEE Abstract-A hardware
More informationDesign of an Online Testable Ternary Circuit from the Truth Table
Design of an Online Testable Ternary Circuit from the Truth Table N. M. Nayeem and J. E. Rice Dept. of Math & Computer Science University of Lethbridge, Lethbridge, Canada {noor.nayeem,j.rice}@uleth.ca
More informationCycle Error Correction in Asynchronous Clock Modeling for Cycle-Based Simulation
1 Cycle Error Correction in Asynchronous Clock Modeling for Cycle-Based Simulation Junghee Lee and Joonhwan Yi Telecommunication R&D Center Samsung Electronics {junghee77.lee, joonhwan.yi} @ samsung.com
More informationConfigurational Analysis beyond the Quine-McCluskeyMilan, algorithm 8 February / 29
Configurational Analysis beyond the Quine-McCluskey algorithm Adrian Dușa University of Bucharest Milan, 8 February 2018 Configurational Analysis beyond the Quine-McCluskeyMilan, algorithm 8 February 2018
More informationLINEAR FEEDBACK SHIFT REGISTER BASED UNIQUE RANDOM NUMBER GENERATOR
LINEAR FEEDBACK SHIFT REGISTER BASED UNIQUE RANDOM NUMBER GENERATOR HARSH KUMAR VERMA 1 & RAVINDRA KUMAR SINGH 2 1,2 Department of Computer Science and Engineering, Dr. B. R. Ambedkar National Institute
More informationDelay-Dependent Stability Criteria for Linear Systems with Multiple Time Delays
Delay-Dependent Stability Criteria for Linear Systems with Multiple Time Delays Yong He, Min Wu, Jin-Hua She Abstract This paper deals with the problem of the delay-dependent stability of linear systems
More informationA Low-Error Statistical Fixed-Width Multiplier and Its Applications
A Low-Error Statistical Fixed-Width Multiplier and Its Applications Yuan-Ho Chen 1, Chih-Wen Lu 1, Hsin-Chen Chiang, Tsin-Yuan Chang, and Chin Hsia 3 1 Department of Engineering and System Science, National
More informationOptimization of 1D and 2D Cellular Automata for Pseudo Random Number Generator.
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 4, Issue 6, Ver. I (Nov - Dec. 2014), PP 28-33 e-issn: 2319 4200, p-issn No. : 2319 4197 Optimization of 1D and 2D Cellular Automata for Pseudo
More informationDetermining Appropriate Precisions for Signals in Fixed-Point IIR Filters
38.3 Determining Appropriate Precisions for Signals in Fixed-Point IIR Filters Joan Carletta Akron, OH 4435-3904 + 330 97-5993 Robert Veillette Akron, OH 4435-3904 + 330 97-5403 Frederick Krach Akron,
More informationFault Collapsing in Digital Circuits Using Fast Fault Dominance and Equivalence Analysis with SSBDDs
Fault Collapsing in Digital Circuits Using Fast Fault Dominance and Equivalence Analysis with SSBDDs Raimund Ubar, Lembit Jürimägi (&), Elmet Orasson, and Jaan Raik Department of Computer Engineering,
More informationDISTANCE BASED REORDERING FOR TEST DATA COMPRESSION
DISTANCE BASED REORDERING FOR TEST DATA COMPRESSION Muthiah M. A. and E. Logashanmugam Department of Electronics and Communication Engineering, Sathyabama University, Chennai, India E-Mail: muthiah.m.a@outlook.com
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.
Outline EECS 150 - Components and esign Techniques for igital Systems Lec 18 Error Coding Errors and error models Parity and Hamming Codes (SECE) Errors in Communications LFSRs Cyclic Redundancy Check
More informationCase Studies of Logical Computation on Stochastic Bit Streams
Case Studies of Logical Computation on Stochastic Bit Streams Peng Li 1, Weikang Qian 2, David J. Lilja 1, Kia Bazargan 1, and Marc D. Riedel 1 1 Electrical and Computer Engineering, University of Minnesota,
More informationTechnology Mapping for Reliability Enhancement in Logic Synthesis
Technology Mapping for Reliability Enhancement in Logic Synthesis Zhaojun Wo and Israel Koren Department of Electrical and Computer Engineering University of Massachusetts,Amherst,MA 01003 E-mail: {zwo,koren}@ecs.umass.edu
More informationSignature Analysis for Test Responses
VLSI DESIGN 1999, Vol. 10, No. 2, pp. 127-141 Reprints available directly from the publisher Photocopying permitted by license only (C) 1999 OPA (Overseas Publishers Association) N.V. Published by license
More informationEECS150 - Digital Design Lecture 26 - Faults and Error Correction. Types of Faults in Digital Designs
EECS150 - Digital Design Lecture 26 - Faults and Error Correction April 25, 2013 John Wawrzynek 1 Types of Faults in Digital Designs Design Bugs (function, timing, power draw) detected and corrected at
More informationEECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)
EECS 150 - Components and esign Techniques for igital Systems Lec 26 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler
More informationFault Modeling. 李昆忠 Kuen-Jong Lee. Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan. VLSI Testing Class
Fault Modeling 李昆忠 Kuen-Jong Lee Dept. of Electrical Engineering National Cheng-Kung University Tainan, Taiwan Class Fault Modeling Some Definitions Why Modeling Faults Various Fault Models Fault Detection
More informationOptimal Common-Centroid-Based Unit Capacitor Placements for Yield Enhancement of Switched-Capacitor Circuits
Optimal Common-Centroid-Based Unit Capacitor Placements for Yield Enhancement of Switched-Capacitor Circuits CHIEN-CHIH HUANG, National Central University CHIN-LONG WEY, National Chiao Tung University
More informationAnalysis and Synthesis of Weighted-Sum Functions
Analysis and Synthesis of Weighted-Sum Functions Tsutomu Sasao Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka 820-8502, Japan April 28, 2005 Abstract A weighted-sum
More informationVHDL Implementation of Reed Solomon Improved Encoding Algorithm
VHDL Implementation of Reed Solomon Improved Encoding Algorithm P.Ravi Tej 1, Smt.K.Jhansi Rani 2 1 Project Associate, Department of ECE, UCEK, JNTUK, Kakinada A.P. 2 Assistant Professor, Department of
More informationELEC3227/4247 Mid term Quiz2 Solution with explanation
ELEC7/447 Mid term Quiz Solution with explanation Ang Man Shun Department of Electrical and Electronic Engineering, University of Hong Kong Document creation date : 015 1 05 This document explain the solution
More informationT st Cost Reduction LG Electronics Lee Y, ong LG Electronics 2009
Test Cost Reduction LG Electronics Lee, Yong LG Electronics 2009 Contents Introduction Key factors for test cost reduction in DFT Test vector volume Low cost ATE Test time Reuse a large block Test cost
More informationKeywords: Genetic algorithms, automatic test pattern generation, test data compression, test length, transition delay fault, skewed-load
Computing and Informatics, Vol. 32, 2013, 251 272 COMPRESSED SKEWED-LOAD DELAY TEST GENERATION BASED ON EVOLUTION AND DETERMINISTIC INITIALIZATION OF POPULATIONS Roland Dobai, Marcel Baláž Institute of
More informationCryptanalysis of Achterbahn
Cryptanalysis of Achterbahn Thomas Johansson 1, Willi Meier 2, and Frédéric Muller 3 1 Department of Information Technology, Lund University P.O. Box 118, 221 00 Lund, Sweden thomas@it.lth.se 2 FH Aargau,
More informationContributions to the Evaluation of Ensembles of Combinational Logic Gates
Contributions to the Evaluation of Ensembles of Combinational Logic Gates R. P. Ribas, S. Bavaresco, N. Schuch, V. Callegaro,. Lubaszewski, A. I. Reis Institute of Informatics FRGS, Brazil. ISCAS 29 &
More informationFault Tolerant Computing CS 530 Fault Modeling. Yashwant K. Malaiya Colorado State University
CS 530 Fault Modeling Yashwant K. Malaiya Colorado State University 1 Objectives The number of potential defects in a unit under test is extremely large. A fault-model presumes that most of the defects
More informationLongest Path Selection for Delay Test under Process Variation
2093 1 Longest Path Selection for Delay Test under Process Variation Xiang Lu, Zhuo Li, Wangqi Qiu, D. M. H. Walker and Weiping Shi Abstract Under manufacturing process variation, a path through a net
More informationEECS 579: Logic and Fault Simulation. Simulation
EECS 579: Logic and Fault Simulation Simulation: Use of computer software models to verify correctness Fault Simulation: Use of simulation for fault analysis and ATPG Circuit description Input data for
More informationScalable Systolic Structure to Realize Arbitrary Reversible Symmetric Functions
GESTS Int l Trans. Computer Science and Engr., Vol.18, No.1 7 Scalable Systolic Structure to Realize Arbitrary Reversible Symmetric Functions Soo-Hong Kim and Sung Choi Dep t of Computer Software Engineering,
More informationA COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER. Jesus Garcia and Michael J. Schulte
A COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER Jesus Garcia and Michael J. Schulte Lehigh University Department of Computer Science and Engineering Bethlehem, PA 15 ABSTRACT Galois field arithmetic
More informationResidue Number Systems Ivor Page 1
Residue Number Systems 1 Residue Number Systems Ivor Page 1 7.1 Arithmetic in a modulus system The great speed of arithmetic in Residue Number Systems (RNS) comes from a simple theorem from number theory:
More informationInterconnect Yield Model for Manufacturability Prediction in Synthesis of Standard Cell Based Designs *
Interconnect Yield Model for Manufacturability Prediction in Synthesis of Standard Cell Based Designs * Hans T. Heineken and Wojciech Maly Department of Electrical and Computer Engineering Carnegie Mellon
More informationTest Generation for Designs with Multiple Clocks
39.1 Test Generation for Designs with Multiple Clocks Xijiang Lin and Rob Thompson Mentor Graphics Corp. 8005 SW Boeckman Rd. Wilsonville, OR 97070 Abstract To improve the system performance, designs with
More informationOn the Analysis of Reversible Booth s Multiplier
2015 28th International Conference 2015 on 28th VLSI International Design and Conference 2015 14th International VLSI Design Conference on Embedded Systems On the Analysis of Reversible Booth s Multiplier
More informationFinding Optimum Clock Frequencies for Aperiodic Test. Sindhu Gunasekar
Finding Optimum Clock Frequencies for Aperiodic Test by Sindhu Gunasekar A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Master
More information