WO2011051784A1 - 考虑计划组的扫描链的重构方法与装置 - Google Patents
考虑计划组的扫描链的重构方法与装置 Download PDFInfo
- Publication number
- WO2011051784A1 WO2011051784A1 PCT/IB2010/002736 IB2010002736W WO2011051784A1 WO 2011051784 A1 WO2011051784 A1 WO 2011051784A1 IB 2010002736 W IB2010002736 W IB 2010002736W WO 2011051784 A1 WO2011051784 A1 WO 2011051784A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- scan
- scan chain
- chain
- elements
- scanning
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/327—Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/333—Design for testability [DFT], e.g. scan chain or built-in self-test [BIST]
Definitions
- the present invention relates to a method and apparatus for reconstructing a scan chain, and more particularly to a method and apparatus for reconstructing a scan chain of a chip module planning and design stage. Background technique
- each planning group When module planning is designed for a chip containing a test chain, the arbitrariness of the distribution of the scanning elements will result in excessive wiring between the various planning groups. At the same time, each planning group also needs to create more ports to undertake the input and output of the scanning signals. This makes the planning teams have a high demand for resources in the top-level application, which increases the difficulty of design. In order to reduce the number of ports and groups between the groups on the plan group caused by the scan chain passing through the plan group, it is necessary to reconstruct the scan chain, that is, to adjust the position of the scan elements to form a new scan chain.
- step 70 the start point of the scan chain is used as a reference component, and in step 71, the distance of the reference component to all other available scan components in the scan chain is calculated, and a scanning element closest thereto; connecting the reference element to the scanning element closest thereto in step 72; using the scanning element closest to it as a reference element in step 73; and then checking in step 74 whether the reference element is in step 74 Is the last available scanning element; if so, it is connected to the end of the scan chain in step 75; otherwise it returns to step 71.
- the reconstruction method of the scan chain only considers the distance relationship between the scanning elements, and does not consider the planning group position information of each scanning element, so the obtained scanning chain may have more lengths than the reconstruction before shortening the length.
- the planning group resulted in too many connections between the planning groups. Even after reordering, there is a reduction in the number of connections between the ports on the planning group and the planning group, but in practice there is still room to further reduce ports and connections through the reconstruction of the scan chain.
- the present invention provides a structure reconstruction method and apparatus for considering a scan chain of a plan group, which shortens the scan chain length while passing each of the reconstructed scan chains through as few plan groups as possible, thereby making the plan group The total number of connections between ports and groups is minimal.
- the present invention proposes a scan chain reconstruction method, which includes a first stage reconstruction, the first stage reconstruction comprising: a step of classifying a pair of scan chains, wherein the start and end points are in a scan chain within the same plan group Classified as the first scan chain set; the scan chain whose start point and end point are not in the same plan group is classified as the second scan chain set; both the start point and the end point are classified into the third scan chain set in a top scan chain;
- the scan chain in the first scan chain set is empty until the first scan chain set is empty;
- Step 3 reconstructs the scan chain in the second scan chain set until the second scan chain set is empty;
- Step 4 reconstructs the The scan chain within the third scan chain set until the third scan chain set is empty.
- the step 2 further comprises: extracting, from the first scan chain set, a scan chain that requires the least number of scan components; and checking whether the number of available scan components in a plan group where the endpoint of the scan chain is located satisfies The scan chain is required; if sufficient, the scan elements available in the plan group are assigned to the scan chain according to the required number of scan chains; otherwise, all available scan elements in the plan group are assigned to the scan chain, and the scan chain is Put in the third scan chain collection.
- the step 3 further includes: extracting the scan component from the second scan chain set requires a minimum number of scan chains; determining whether the scan chain has an endpoint at the top layer: if yes, determining the plan group of the other end of the scan chain Whether the number of available scanning elements in the plan meets the needs of the scan chain; if the number of scanning elements in the plan group is sufficient, the scanning elements in the plan group are allocated to the scan chain according to the required quantity; otherwise, the plan group is A scan element is assigned to the scan chain and the scan chain is added to a third scan chain set.
- the scan component is preferentially assigned to the scan chain in a smaller total number of plan groups, and the insufficient amount is selected from another plan group; otherwise, the available scan elements in both plan groups are assigned to the scan chain, and the The scan chain is placed in a third scan chain set.
- the step 4 further includes: extracting a scan chain of the scan element from the third scan chain set; checking whether a plan group contains more scan elements than the scan chain requiring the most: If so, the scan chain is selected from a plan group having the fewest number of scan elements; otherwise, the scan element is assigned to the scan chain from the plan group containing the most number of available scan elements, and finally to the top level selection.
- the method of reconstructing the scan chain can further include a second stage reconstruction in which the scan elements required to reconstruct the scan chain within the same plan group are redistributed based on the scan element position, wherein adjacent Scanning elements that are close to a scan chain will be assigned to the scan chain.
- the present invention also provides a scan chain reconstruction apparatus corresponding to the scan chain reconstruction method, which includes a first level reconstructor and a second level reconstructor.
- the first level reconstructor comprises: a classifier for classifying a plurality of scan chains, wherein the scan chain within the same plan group of the start point and the end point is classified as the first scan chain set; the start point and the end point are not in the same plan group
- the scan chain is classified into a second scan chain set; the start and end points are all classified into a third scan chain set in a top scan chain; an allocator is communicatively coupled to the classifier; and the first scan chain set is first reconstructed The scan chain within the scan chain until the first scan chain set is empty; then reconstructing the scan chain in the second scan chain set until the second scan chain set is empty; finally reconstructing the scan chain in the third scan chain set Until the third scan chain set is empty.
- the scan chain reconstruction method and apparatus of the present invention not only considers the position information of the scan chain and the scanning element, but also calculates the position information of the start point and the end point of the scan chain in the plan group or the top layer, and minimizes the number of ports on the plan group. And the number of connections between groups, in order to obtain better planning and design results; reduce the need for upper resources and the difficulty of subsequent design.
- Figure 1 is a flow chart for performing scan chain reconstruction using distance sorting
- 2 is a flow chart of the first stage reconstruction of the present invention
- 3 is a flow chart of reconstruction of a scan chain within a first scan chain set in a first stage reconstruction of the present invention
- FIG. 4 is a flow chart of reconstruction of a scan chain within a second scan chain set in a first stage reconstruction of the present invention
- FIG. 5 is a flow chart of reconstruction of a scan chain within a third scan chain set in a first stage reconstruction of the present invention
- FIG. 6 is a schematic diagram of a scan chain when no chip is optimized after designing
- FIG. 7 is a schematic diagram of sorting and optimizing the scan chain of FIG. 6;
- FIG. 8 is a schematic diagram of the first stage reconstruction of the scan chain of FIG. 6;
- FIG. 9 is a schematic diagram of the second stage reconstruction of the scan chain of FIG. 6;
- Figure 10 is a block diagram showing the structure of a reconstruction apparatus for a scan chain of the present invention.
- FIG. 11 is a block diagram showing the structure of the first stage reconstructor of the present invention. detailed description
- the present invention proposes a scan chain reconstruction method and apparatus based on a plan group in a chip module planning and design phase.
- a scan chain reconstruction method based on a plan group includes two stages: First, in the first stage of scan chain reconstruction, taking the number of scan elements in the plan group as a main basis, let a scan chain Select a scan component from as few plan groups as possible. In the process of reconstruction, the relationship between the starting point and the ending point of the scan chain and the planning group is fully considered, so that the scanning elements in the same planning group are preferentially assigned to the scanning chain associated with it, thereby reducing the possible connection between the planning groups. The number of lines.
- the scanning component allocation is performed in one planning group, and the adjacent scanning components are assigned to the same scanning chain. Thereby reducing the length of the wiring between the scanning elements in each scan chain.
- the order of reconstruction is based on the position of the start and end points of each scan chain, so that the scan chain does not wear out the plan group it is in.
- the scan chain of the start point and the end point in a same plan group is classified into the first scan chain set, and the scan component is selected first from the plan group; the scan chain whose start point and end point are not in the same plan group is classified as the second scan.
- the chain set is processed with lower priority; the scan chain with the start and end points at the top is classified as the third scan chain set and is processed last.
- step 10 it is determined whether the first scan chain set is empty. If there is a scan chain in which the start point and the end point are in the same plan group, proceed to step 11 to reconstruct the start point and the end point in the same plan. The scan chain within the group. Otherwise, in step 12, it is determined whether the second scan chain set is empty. If there is a scan chain in which the start point and the end point are not in the same plan group, or there is only one end point, that is, the start point or the end point is at the top scan chain, then step 13 is reconstructed. A scan chain within the second scan chain set. Otherwise, proceed to step 14 to determine whether the third scan chain set is empty. If not, the scan chain in the third scan chain set is reconstructed in step 15; if empty, the process proceeds to step 16 to end the first stage reconstruction.
- step 11 starting from step 110, the scan chain of the first scan chain set that requires the least number of scan components is found and taken out from the first scan chain set.
- step 111 it is checked whether the number of available scanning elements in the planning group in which the start and end points of the scan chain are located meets the scan chain requirements. If sufficient, in step 112, the scan elements available in the plan group are assigned to the scan chain according to the required quantity; otherwise, proceeding to step 113, all available scan elements in the plan group are assigned to the scan chain and placed in the third scan. The chain is set to continue selecting the scanning elements in step 14.
- step 130 when reconstructing the scan chain in the second scan chain set, in order to scan the chain as little as possible out of the plan group, in step 130, the scan element needs in the second scan chain set are also found.
- the least number of scan chains are taken from the second scan chain set.
- step 131 it is determined whether the scan chain has an end point (starting point or end point) at the top layer, and if so, proceeds to step 132 to determine the other end. Whether the number of scanning elements in the planning group where the point (end point or starting point) is satisfied meets the needs of the scanning chain. If the number of scanning elements in the planning group is sufficient, proceed to step 133 to allocate the scanning elements in the planning group to the required quantity.
- step 134 to assign the scanning elements within the planning group to the scan chain and adding the scan chain to the third scan chain set. Otherwise, the start and end of the scan chain are in two different plan groups, and then proceeds to step 135, for which the total number of scan chains for all scan chains from which the scan elements may be selected is calculated for each of the two plan groups.
- step 136 it is determined whether the available scanning elements in the two planning groups meet the needs of the scanning chain. If yes, in step 137, a scanning component is preferentially assigned to the scanning from a planning group having a smaller total number of corresponding scanning component requirements. The chain, the amount of deficiency is selected from another plan group; otherwise, proceeding to step 138, the available scan elements in both plan groups are assigned to the scan chain and the scan chain is placed in the third scan chain set.
- step 15 the reconstruction start point and the end point are both at the top scan chain and the scan chain that has not been reconstructed in the first two steps 10, 11 is completed.
- step 3 the scan chain from the desired scan element is taken from the third scan chain set.
- step 151 it is checked whether a plan group contains more scan elements than is required by the scan chain requiring the most, and if so, step 152 selects the scan chain from the plan group having the least number of scan elements; Otherwise, in step 153 the scan chain is selected from the plan group containing the largest number of scan elements available, and finally to the top level selection. In this way, the plan group is prevented from being split by more scan chains, reducing the ports on the plan group.
- the scan chain is a random selection of the scan elements within the plan group during the first phase of the scan chain, it is possible that the selected scan element is farther away from it and the components that are close to it are not selected.
- the scan elements required for the scan chain within the same plan group will be redistributed based on the scan element position. Among them, scanning elements adjacent to and close to a scan chain will be allocated to the scan chain, thereby shortening the total length of the wiring between the scan elements in the scan chain.
- the scanning elements of each scan chain can also be reordered to minimize the total number of wirings in the scan chain.
- three scan chains 50, 51, 52 located within two plan groups 40, 41 and top layer 42 will be reconstructed in accordance with an embodiment of the present invention.
- the first plan group 40 includes seven scanning elements a, f, j, h, k, m, n;
- the second plan group includes four scanning elements b, c, i, 1, and the top layer is provided with three scanning elements d ,e, g.
- the structural information of the three scan chains 50, 51, 52 are:
- the scan chain 50 includes three scan elements a, b, and c, and the start point 500 and the end point 501 are both in the first plan group 40; thus, two cross lines and four ports are formed between the two plan groups 40, 41;
- the scan chain 51 comprises five scanning elements d, e, f, g, h, the starting point 510 is in the second planning group 41, and the ending point 511 is in the top layer 42; thus forming three intersecting lines between the two planning groups 40, 41 , five ports;
- the scan chain 52 includes six scanning elements of i, j, k, 1, m, n, and the starting point 520 and the ending point 521 are both at the top layer 42; thus forming five intersecting lines and eight ports between the two planning groups 40, 41.
- the three scan chains 50, 51, 52 are reordered according to the existing method, taking the scan chain 50 as an example, in which all of the scan elements a are closest to the start point 500, then a and the scan chain 50 are first The starting point is 500. It is then calculated that the closest distance b between b and c is b, connecting a and b. Then connect b with c, c and end point 501. Thus, as shown in Figure 7, the three scan chains 50, 51, 52 are adjusted to:
- the scanning elements of the scan chain 50 are sorted as a, b, c, and are still two intersecting lines, four ports; the scanning elements of the scan chain 51 are sorted into e, d, g, f, h, with two intersecting lines, three The scan elements of scan chain 52 are sorted into j, m, n, k, 1, i, with three cross lines, four ports.
- the three scanning chains 50, 51, 52 are reconstructed in two stages according to the invention - first based on the information of the three scanning chains 50, 51, 52, ie the scanning elements and the number of scanning elements contained in each scanning chain, each scanning element
- the three scan chains 50, 51, and 52 are classified by the plan group and the start and end positions of each scan chain.
- the starting point 500 and the end point of the scan chain 50 501 is in the same plan group 40, then placed in the first scan chain set; the start point 510 and the end point 511 of the scan chain 51 are located in the second plan group 41 and the top layer 42, respectively, and then placed in the second scan chain set; The start point 520 and the end point 521 of 52 are both located on the top layer 42, and are then classified into the third scan chain set.
- the scanning elements within the random selection plan group 40 are assigned to the scan chains 50 within the first scan chain set, such as &, f, h.
- scan elements are assigned to scan chains 51 within the second scan chain set. Since the end point 511 of the scan chain 51 is at the top level 42, the components in the planning group 41 where the starting point 510 is located! ), c, i, 1 are assigned to the scan chain 51. At this time, the scan chain 51 has not yet been filled, and thus is placed in the third scan chain set.
- the scan chain 51 requires one scanning element
- the scan chain 52 requires six scanning elements, so the scanning element is first selected for the scan chain 52.
- the plan group 40 with the largest number of scan elements has only four available scan elements, so the available scan elements j, k, m, n in the plan group 40 and the top d, e are assigned to the scan chain 52.
- the remaining available scanning elements, ⁇ , g of the top layer 42 are selected.
- each scan chain 50, 51, 52 is as shown in Fig. 8. It can be seen that the number of connections between the port and the plan group is minimized, as follows:
- the scanning elements of the scan chain 50 are a, f, h, and the scan chain 50 does not leave the plan group 40; the scan elements of the scan chain 51 are b, c, i, 1, g, with a cross line, a port; The scanning elements of chain 52 are j, k, m, n, d, e, with two intersecting lines, two ports.
- the second level reconstruction may employ any single group or top level optimization method, such as a ranking method that considers penalty parameters.
- m, n, k are assigned to the scan chain 50, and h, j, a, f are assigned to the scan chain 51; , e is assigned to the scan chain 51, and d, g are assigned to the scan chain 52.
- the composition of these three scan chains becomes - Scan chain 50 contains n, m, k, only within plan group 40, and the length is shortened;
- scan chain 51 contains b, i, c, 1, e, has a cross line, one port, and the length is shortened;
- scan chain 52 Contains h, j, a, f, g, d, has two cross lines, two ports, and the length is shortened.
- the present invention provides a reconstruction apparatus 2 for a scan chain.
- the structure reconstruction apparatus package 2 of the scan chain of the present invention includes a first stage reconstructor 20 and a second stage reconstructor 21.
- All scan chains are first input to the first stage reconstructor 20, and the first stage reconstructor 20 performs a scan based on the number of scan elements in the plan group in the first stage of scan chain reconstruction.
- the chain selects the scanning elements from as few planned groups as possible.
- the first-stage reconstructor 20 will fully consider the relationship between the start and end points of the scan chain and the plan group during the reconstruction process, so that the scan elements in the same plan group will be preferentially assigned to the scan chain associated with it. It is good to reduce the number of connections that may occur between planning groups.
- the scan chain is reconstructed by the first stage reconstructor 20 and input to the second stage reconstructor 21 therefrom.
- the second stage reconstructor 21 uses the position information of the scanning component as a main basis, performs scanning component allocation in one planning group, and assigns adjacent scanning components to the same scanning chain. Thereby reducing the length of the wiring between the scanning elements in each scan chain.
- the first stage reconstructor 20 and the second stage reconstructor 21 of the reconstruction apparatus 2 of the scan chain are described in detail below as follows:
- the first stage reconstructor 20 needs to complete the first stage task of the scan chain reconstruction, and the order of reconstruction is based on the positions of the start and end points of each scan chain, so that the scan chain does not wear out the plan group in which it is located.
- the first stage reconstructor 20 includes a classifier 200 that receives all scan chains from the input port 201 and classifies them.
- the scan chain in which the start point and the end point are in the same plan group is classified into the first scan chain set, and the scan component is selected first from the plan group; the scan chain whose start point and end point are not in the same plan group is classified as the second scan chain. Collection, with lower priority; start and end
- the scan chain with points at the top is classified as the third scan chain set and is processed last.
- a distributor 202 is communicatively coupled to the classifier 200, which first checks whether the first scan chain set is empty. If there is a scan chain in which the start point and the end point are in the same plan group, the reconstruction start point and the end point are in the same plan group. Scanning chain. Otherwise, it is checked whether the second scan chain set is empty. If there is a scan chain whose start point and end point are not in the same plan group, or only one end point, that is, the scan chain of the start point or the end point is at the top level, the second scan chain set is reconstructed. The scan chain inside. Otherwise, it is checked whether the third scan chain set is empty. If it is not empty, the scan chain in the third scan chain set is reconstructed; if it is empty, the first stage reconstruction is ended.
- the allocator 202 first finds a scan chain of the first scan chain set that requires the least number of scan components, and extracts it from the first scan chain set. Check that the number of available scan elements in the plan group for the start and end of the scan chain meets the scan chain requirements. If sufficient, the scan elements available in the plan group are assigned to the scan chain by the required quantity; otherwise, all available scan elements in the plan group are assigned to the scan chain and placed in the third scan chain set.
- the first stage reconstructor 20 reconstructs the scan chain within the second scan chain set.
- the distributor 202 finds the scan chain that requires the least number of scan elements in the second scan chain set and takes it out of the second scan chain set.
- the scan chain has an endpoint (start or end point) at the top layer, and if so, determine whether the number of scan elements in the plan group where the other endpoint (end point or start point) is located meets the scan chain requirement, such as the scan element in the plan group If the number of pieces is sufficient, the scanning elements in the plan group are allocated to the scan chain according to the required quantity; otherwise, the scan elements in the plan group are assigned to the scan chain, and the scan chain is added to the third scan chain set. Otherwise, the start and end points of the scan chain are in two different plan groups for which the total number of scan chains required for the scan elements from which the scan elements may be selected is calculated. Determining whether the available scanning elements in the two planning groups meet the needs of the scanning chain.
- the scanning elements are preferentially assigned to the scanning chain from a planning group having a smaller total number of corresponding scanning component requirements, and the insufficient amount is from Another plan group selection; otherwise, the available scan elements in both plan groups are assigned to the scan chain, and the scan chain is placed Enter the third scan chain set.
- the first stage reconstructor 20 reconstructs the scan chain of the top and end points and the scan chain that has not been reconstructed before completion.
- the splitter 202 is taken from the scan chain of the third scan chain of the classifier 200 from the scan chain of the most desired scan elements. Check if a plan group contains more scan elements than is needed for the most demanding scan chain, and if so, the scan chain is selected from the plan group with the fewest number of scan elements; otherwise, the scan chain Choose from the planning group with the largest number of available scanning elements, and finally to the top selection. As such, avoid planning groups being split by more scan chains, reducing the ports on the plan group.
- the first stage reconstructor 20 is transmitted from the output port 203 to the second stage reconstructor 21 after the reconstruction is completed. Since the first stage reconstructor 20 reconstructs the scan chain, the scan elements in the random selection plan group are allocated to the scan chain, and it is possible that the selected scan elements are far from the scan chain, and components close to them are close. Not selected. Thus the second stage reconstructor 21 will redistribute the scanning elements required for the scan chain within the same plan group based on their position, wherein adjacent scan elements that are close to one scan chain will be assigned to the scan chain. Medium, thereby shortening the total length of the wiring between the scanning elements in the scan chain.
- the method and apparatus for reconstructing a scan chain of the present invention only considers a technical solution for reducing the length of a scan chain.
- the global scan chain is classified according to the position of its end point, so that the scan chain is exhausted.
- the connection between the port on the plan group and the plan group is greatly reduced, which reduces resource requirements and subsequent design difficulties.
- the present invention can also perform a second stage reconstruction after the first stage, and the scanning elements required for the scan chain within the same plan group are redistributed based on their positions, thereby further shortening the length of the scan chain.
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/504,051 US8504966B2 (en) | 2009-10-30 | 2010-10-27 | Method and device for reordering scan chains considering plan groups |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200910211374.7A CN102054075B (zh) | 2009-10-30 | 2009-10-30 | 考虑计划组的扫描链的重构方法与装置 |
CN200910211374.7 | 2009-10-30 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2011051784A1 true WO2011051784A1 (zh) | 2011-05-05 |
Family
ID=43921417
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB2010/002736 WO2011051784A1 (zh) | 2009-10-30 | 2010-10-27 | 考虑计划组的扫描链的重构方法与装置 |
Country Status (3)
Country | Link |
---|---|
US (1) | US8504966B2 (zh) |
CN (1) | CN102054075B (zh) |
WO (1) | WO2011051784A1 (zh) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104765895A (zh) * | 2014-01-06 | 2015-07-08 | 北京华大九天软件有限公司 | 一种版图编辑中的自动吸附方法 |
US9470755B1 (en) * | 2015-06-12 | 2016-10-18 | Cadence Design Systems, Inc. | Method for dividing testable logic into a two-dimensional grid for physically efficient scan |
CN106610468B (zh) * | 2015-10-21 | 2020-04-14 | 龙芯中科技术有限公司 | 扫描链、扫描链构建方法及装置 |
CN107368616B (zh) * | 2016-05-11 | 2021-03-09 | 中芯国际集成电路制造(上海)有限公司 | 实现射频识别的仿真模型电路及其仿真方法 |
CN106874601A (zh) * | 2017-02-20 | 2017-06-20 | 中国人民解放军国防科学技术大学 | 一种扫描链重定序方法 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1604093A (zh) * | 2004-11-04 | 2005-04-06 | 复旦大学 | 一种基于全局的扫描链构架方法 |
US20060265683A1 (en) * | 2005-05-19 | 2006-11-23 | Nec Electronics Corporation | Circuit layout device, circuit layout method, and program for execution thereof |
CN101216532A (zh) * | 2008-01-16 | 2008-07-09 | 闫永志 | 一种时序电路中降低扫描功耗的方法 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6928606B2 (en) * | 2001-12-20 | 2005-08-09 | Hyperchip Inc | Fault tolerant scan chain for a parallel processing system |
US7340700B2 (en) * | 2005-05-27 | 2008-03-04 | Lsi Logic Corporation | Method for abstraction of manufacturing test access and control ports to support automated RTL manufacturing test insertion flow for reusable modules |
US7757198B1 (en) * | 2007-04-10 | 2010-07-13 | Lattice Semiconductor Corporation | Scan chain systems and methods for programmable logic devices |
CN100454318C (zh) * | 2007-04-29 | 2009-01-21 | 哈尔滨工业大学 | 适用于多扫描链设计芯核的soc测试数据的压缩方法 |
CN101285871B (zh) * | 2008-05-09 | 2010-07-28 | 中国科学院计算技术研究所 | 一种扫描链诊断向量生成方法和装置及扫描链诊断方法 |
-
2009
- 2009-10-30 CN CN200910211374.7A patent/CN102054075B/zh active Active
-
2010
- 2010-10-27 WO PCT/IB2010/002736 patent/WO2011051784A1/zh active Application Filing
- 2010-10-27 US US13/504,051 patent/US8504966B2/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1604093A (zh) * | 2004-11-04 | 2005-04-06 | 复旦大学 | 一种基于全局的扫描链构架方法 |
US20060265683A1 (en) * | 2005-05-19 | 2006-11-23 | Nec Electronics Corporation | Circuit layout device, circuit layout method, and program for execution thereof |
CN101216532A (zh) * | 2008-01-16 | 2008-07-09 | 闫永志 | 一种时序电路中降低扫描功耗的方法 |
Also Published As
Publication number | Publication date |
---|---|
CN102054075A (zh) | 2011-05-11 |
CN102054075B (zh) | 2014-09-10 |
US20120240092A1 (en) | 2012-09-20 |
US8504966B2 (en) | 2013-08-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2011051784A1 (zh) | 考虑计划组的扫描链的重构方法与装置 | |
CN105742280B (zh) | 用于多核芯片的集成电路布局配线 | |
US20010018760A1 (en) | Method and apparatus for automatically generating multi-terminal nets, and program storage medium storing program for executing automatic multi-terminal net generation method | |
US6397375B1 (en) | Method for managing metal resources for over-the-block routing in integrated circuits | |
CN110705204B (zh) | 基于多阶段策略的时序感知层分配方法 | |
WO2011051788A2 (zh) | 物理设计中基于双向优先选择的扫描链重构方法与装置 | |
JP2004287681A (ja) | 配線設計支援システム、および、配線設計支援方法 | |
Fang et al. | Area-I/O flip-chip routing for chip-package co-design | |
US8601429B1 (en) | Method for connecting flip chip components | |
CN111723545B (zh) | 超大规模集成电路下基于通孔感知的并行层分配方法 | |
US8010925B2 (en) | Method and system for placement of electric circuit components in integrated circuit design | |
CN116384322B (zh) | 一种fpga中可编程逻辑模块的连接方法、装置及电子设备 | |
TWI497328B (zh) | Consider the reconstruction method and device of the scan chain of the program group | |
US8479138B1 (en) | Global constraint optimization | |
CN105183693B (zh) | 一种基于三维片上网络的多播传输方法 | |
CN106682290B (zh) | 可编程逻辑器件布线方法及装置 | |
JPH01302850A (ja) | テスト容易化半導体集積回路の製造方法 | |
CN109670268B (zh) | 一种多个ip与efpga端口连接方法 | |
CN101315547B (zh) | 一种基于多fpga的控制系统 | |
TWI476422B (zh) | Scanning Chain Reconfiguration Method and Device Based on Bidirectional Optimization Selection in Entity Design | |
CN109582986A (zh) | 一种功耗限制下三维片上网络测试端口选择优化的方法 | |
Yan et al. | Multilevel timing-constrained full-chip routing in hierarchical quad-grid model | |
CN107526894B (zh) | 一种多/众核架构TriBA-CMPs的布局布线方法 | |
CN104007383A (zh) | 三维ip核测试外壳扫描链的优化方法 | |
TWI519982B (zh) | Method and device for network distribution in wafer design |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 10826190 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13504051 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
32PN | Ep: public notification in the ep bulletin as address of the adressee cannot be established |
Free format text: COMMUNICATION NOT DELIVERED. NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112 EPC (EPO FORM 1205A DATED 06.07.2012) |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 10826190 Country of ref document: EP Kind code of ref document: A1 |