Type of Document Dissertation Author Kim, Han Bin URN etd-122399-220228 Title High-Level Synthesis and Implementation of Built-In Self-Testable Data Path Intensive Circuit Degree PhD Department Electrical and Computer Engineering Advisory Committee
Advisor Name Title Ha, Dong Sam Committee Chair Armstrong, James R. Committee Member Gray, Festus Gail Committee Member Henry, Sallie M. Committee Member Midkiff, Scott F. Committee Member Keywords
- Built-In Self-Test
- High-Level Synthesis
- Data Path
Date of Defense 1999-12-15 Availability unrestricted AbstractA high-level built-in self-test (BIST) synthesis is a process of transforming a behavioral description into a register-transfer level structural description while minimizing BIST overhead. Existing high-level BIST synthesis methods focus on one objective, minimizing either area overhead or test time. Hence, those methods do not render exploration of a large design space, which may result in a local optimum.
In this thesis, we present three methods, which aim to address the problem. The first method tries to find a register assignment for each k-test session in a heuristic manner, where k=1,2,…,N and N is the number of modules of the circuit. Therefore, it offers a range of designs with different figures of merit in area and test time. The second method is based on integer linear programming (ILP). The proposed ILP based method performs the three tasks, assignments of registers, interconnections, and BIST registers, concurrently to yield optimal or near-optimal designs. We describe a complete set of ILP formulations for the three tasks. The ILP based method achieves optimal solutions for most circuits in hardware overhead, but it takes long processing time. The third method, the region-wise heuristic method. It partitions a given data flow graph into smaller regions based on control steps and applies the ILP to each region successively to reduce the processing time.
To measure the performance of BIST accurately and to demonstrate the practicality of our BIST synthesis method, we implemented a DSP circuit; an 8x8 two-dimensional discrete cosine transform (DCT) processor. We implemented two versions of the algorithm, one with incorporation of our BIST method and the other without BIST, to verify the validity of our simplified cost model to estimate BIST area overhead. The two major parts of the circuit, data path and controller, were synthesized using our high-level BIST synthesis tool. All the circuits are implemented and laid out using an ASIC design flow developed at Virginia Tech.
Experimental results show that the three proposed high-level BIST synthesis methods perform better than or comparable to existing BIST synthesis systems. They indeed yield various designs that enable users to trade between area overhead and test time. The region-wise heuristic method reduces the processing time by several orders of magnitude, while the quality of the solution is slightly compromised compared with the ILP-based optimal method. The implementation of DCT circuits demonstrate that our method is applicable to industry size circuits, and the BIST area overhead measured at the layout is close to the estimated one.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access abslis~1.pdf 42.25 Kb 00:00:11 00:00:06 00:00:05 00:00:02 < 00:00:01 ch2bac~1.pdf 190.88 Kb 00:00:53 00:00:27 00:00:23 00:00:11 00:00:01 ch3pro~1.pdf 128.54 Kb 00:00:35 00:00:18 00:00:16 00:00:08 < 00:00:01 ch4dct.pdf 110.53 Kb 00:00:30 00:00:15 00:00:13 00:00:06 < 00:00:01 ch5exp~1.pdf 359.83 Kb 00:01:39 00:00:51 00:00:44 00:00:22 00:00:01
If you have questions or technical problems, please Contact DLA.