Scanning chain balancing method for carrying out secondary allocation by utilizing difference value
A secondary allocation and scanning chain technology, applied in the direction of measuring devices, instruments, measuring electronics, etc., can solve the problems that the BFD algorithm does not have global optimization, and the guiding principle of global optimization is not close to the actual situation, so as to achieve simple implementation and high algorithm complexity low effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0012] Embodiment 1: Combining figure 1 To illustrate this embodiment, the process of the scan chain balancing method using the difference for secondary allocation in this embodiment is as follows:
[0013] First, arrange the scan chains inside the IP core in descending order, find the largest scan chain S(max), divide the largest scan chain S(max) by the length of the adjustment coefficient adj as the reference length, and the one closest to the reference length The scan chain is set as the reference scan chain S(adj);
[0014] Then, compare the length of each scan chain inside the IP core with the length of the reference scan chain S(adj). If the scan chain S(adj) is larger than the reference, it is set as long scan chain S>, and the scan chain is less than or equal to the reference. S(adj) is set as the short scan chain S≤, and all long scan chains S> are allocated for the first time according to the length of the reference scan chain S(adj); and then each long scan chain ...
specific Embodiment approach 2
[0031] Embodiment 2: This embodiment is a special case of Embodiment 1, a special case of the adjustment coefficient adj>S(max) / S(min):
[0032] First, arrange the scan chains inside the IP core in descending order, find the largest scan chain S(max), divide the largest scan chain S(max) by the length of the adjustment coefficient adj less than the smallest scan chain S(min), The length less than the minimum scan chain S(min) is used as the reference length;
[0033] Then, all the scan chains are allocated for the first time according to the length of the reference scan chain S(adj); then calculate the difference di between all scan chains and the smallest scan chain S(min), and change the difference di' from large to large After the small sort, the second allocation is performed.
[0034] The following provides pseudo-codes for implementing the method described in this embodiment (denoted as TAD(MIN)):
[0035] Suppose: the number of internal scan chains of the IP core is n...
PUM

Abstract
Description
Claims
Application Information

- R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com