The method of claim 1, wherein if the number of signals at a node of the XOR tree is less than two, splitting a signal at the node such that it is provided both along the first path from the node and along the second path from the node.ħ. The method of claim 3, further comprising: connecting, at each leaf of the XOR tree, the respective odd term generated from the number of scan inputs to a plurality of scan chains by a local broadcast of the respective odd term.Ħ. The method of claim 3, further comprising: connecting, at each leaf of the XOR tree, the respective odd term generated from the number of scan inputs to a scan chain in a region of the 2-dimensional grid.ĥ. The method of claim 1, further comprising: providing, at each leaf of the XOR tree, a respective odd term generated from the number of scan inputs.Ĥ. The method of claim 1, wherein if the number of scan inputs in the set of scan input is less than a number of required scan inputs to generate the 2-dimensional grid, propagating the number of scan inputs as signals along the first path from the node and propagating the number of scan inputs as signals along the second path from the node.ģ. A computer-implemented method for decompressing a set of inputs to populate a 2-dimensional grid to generate output data that facilitates diagnosis and correction of circuit faults, the method comprising: determining a number of scan inputs in the set of scan inputs propagating each of the number of scan inputs as signals determining a layout of the 2-dimensional grid over the integrated circuit overlaying the determined grid with an XOR tree such that a different one of the leaves of the exclusive OR (XOR) tree is situated in each grid cell of the determined layout inputting the set of scan inputs to the XOR tree so as provide scan data that facilitates diagnosis of correction of circuit faults at each node of the XOR tree: assessing a number of signals, k, present at the node, if k=2: sending a first of the signals along a first path from the node and sending a second of the signals along a second path from the node to populate the 2-dimensional grid from the scan inputs, if k>2: splitting the number of signals into two sets of k−1 signals: the first set of signals including a first k−2 group from the number of signals, the second set of signals including: an XOR of the first k−2 group from the number of signals with an output from an XOR of a last signal from the number of signals with a second to last signal from the number of signals, and the last signal from the number of signals, sending the first set of signals along the first path from the node, and sending the second set of signals along the second path from the node and populating all of the leaves of the XOR tree in response to each of the number of signals being split to k=2.Ģ. Method and apparatus for pipelined scan compressionġ. METHOD AND APPARATUS FOR IMPLEMENTING A HIERARCHICAL DESIGN-FOR-TEST SOLUTION Pipeline of additional storage elements to shift input/output data of combinational scan compression circuit X-canceling multiple-input signature register (MISR) for compacting output responses with unknowns Method and apparatus for low-pin-count scan compression Implementing hierarchical design-for-test logic for modular circuit design Test Scheduling With Pattern-Independent Test Access Mechanism Scan compression ratio based on fault density TEST COMPRESSION IN A JTAG DAISY-CHAIN ENVIRONMENT Linear decompressor with two-step dynamic encoding
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |