ID 原文 译文
24995 ADC 量化位数为 4 时，在保证保密频谱效率的同时也能得到较高的保密能量效率。 When the number of ADC quantization bits is 4, it can also obtain a higher secrecy energy efficiency, while ensuring the secrecy spectral efficiency．
24996 随着 VLSI(Very Large Scale Integrated)芯片设计的规模越来越大，功能越来越复杂，在 FPGA(Field Pro-grammable Gate Array)上实现或进行原型验证时，往往会出现布线拥塞或无法布通的情况。 With the growing scale and complexity of VLSI (Very Large Scale Integrated) chip designs, the FPGA (Field Programmable Gate Array) detailed routing process generally meets the congestion or unroutable problems during the FPGA implementation or prototype verification.
24997 而不可满足子式能够迅速诊断 FPGA 无法布通的原因，并且精确定位关键线网。 The unsatisfiable subformulas can quickly diagnose the FPGA un-routable root cause, and accurately localize the critical nets.
24998 针对如何加速 FPGA 详细布线过程，提出了一种基于消解否证的启发式局部搜索算法，能够快速从布尔公式中提取不可满足子式。 In order to accelerate the FPGA routing process, we have proposed a heuristic local search algorithm based on resolution refutation, to derive the unsatisfiable subformulas from the Boolean formulas.
24999 基于典型的 FPGA 布线测试集，与两种求解最小不可满足子式效率最高的算法进行了比较，结果表明局部搜索算法在运行效率方面显著优于分支限界算法与贪心遗传算法，而局部搜索算法也能得到最小不可满足子式; On the typical FPGA routing benchmarks, the local search algorithm has been compared to the two optimal minimum unsatisfiable subformula extraction algorithms. The experimental results show that the local search algorithm strongly outperforms the branch-bound algorithm and the greedy generic algorithm, and it also obtains the minimum unsatisfiable subformula．
25000 并且深入分析了不可满足子式在 FPGA 详细布线中的作用，能够加速芯片的设计与验证过程。 Furthermore, the unsatisfiable subformula plays an important role in FPGA routing, and it can improve the efficiency of design and verification of the VLSI chips．
25001 具有高可用性和安全性的去中心化存储因其应用的相同参数低码率 ＲS(Ｒeed-Solomon codes)码存在修复带宽较高的问题。 Decentralized storage with high availability and security has the problem of high repair bandwidth due to the same parameter low rate Ｒeed-Solomon codes．
25002 对此，提出一种基于可信度的低修复带宽 DHitchhiker 码。 Thus, a low repair bandwidth DHitchhiker based on credibility is proposed．
25003 首先将 Hitchhiker 码的第一子条带中的数据节点和部分校验节点捎带在余下的校验节点的第二个子条带上; Data nodes and some parity nodes in the first sub-stripe of Hitchhiker are piggy backed on the second sub-stripe of the remaining parity nodes．
25004 接着将节点分类，让高可信节点存储余下的校验节点，低可信节点存储数据节点和部分校验节点，并让不同类型的节点采用不同的修复策略; We classify the nodes, and let the high-credit nodes store the remaining parity nodes, the low-credit nodes store the data nodes and some parity nodes, and different types of nodes adopt different repair strategies．