ID 原文 译文
2233 单个原则用来关注软件架构特定方面的演进效果，四个原则结合起来关注软件架构的综合演进效果。 A single principlefocuses on a specific aspect of the evolution effects of the software architecture. The combination of four principles focuseson the comprehensive evolution effects of software architecture.
2234 针对高速移动场景下信道快时变特性给多输入多输出(Multiple Input Multiple Output，MIMO)系统预编码带来的技术挑战，提出基于动态信道状态信息(Channel State Information，CSI)的 MIMO 系统改进模代数预编码(Tomlinson-Harashima Precoding，THP)算法。 Aiming at the technical challenges brought about by the fast time-varying characteristics of the channel inhigh-speed scenes to precoding in multiple input multiple output (MIMO)system, this paper proposes an improved Tomlin-son-Harashima precoding (THP)algorithm for MIMO systems based on the dynamic channel state information (CSI)mod-el.
2235 该算法利用信道统计量信息以及相关性构建动态 CSI 模型，更准确实时地体现当前信道状况; Channel statistical information and correlations are exploited to compensate instantaneous CSI, which could reflect currentreal-time channel status exactly.
2236 进一步地，提出一种基于循环遍历搜索的多用户调度算法，以最大化信干噪比为目标进行用户调度，且将多用户调度算法应用到 THP 中，提高了预编码精度。 Further, aimed at maximizing the signal to interference plus noise ratio, a multi-user schedu-ling algorithm based on loop traversal search is proposed. And the multi-user scheduling algorithm is applied to THP, which could improve the precoding accuracy of the traditional THP.
2237 仿真结果表明，所提算法相比传统预编码算法具有更优的误码率性能和信道容量，验证了所提算法能有效地适应高速移动场景。 Simulation results show that the proposed scheme can be effi-ciently applied to high-speed mobile scenario, and improve bit error ratio performance as well as channel capacity.
2238 为解决相控阵雷达事件调度问题中调度成功率、时间偏移率与算法时效性三者之间的矛盾，本文提出一种基于分支定界法的调度算法; To solve the contradiction of the scheduling success rate (SSR), the time shifting rate (TSR)and the al-gorithm timeliness in the task scheduling of phased array radar, this paper proposes a scheduling algorithm based on thebranch and bound method (BBM ).
2239 该算法首先在现有调度结果上调取所有可执行事件，即获得若干“节点”，多步递推后由多“层”节点形成若干条备选“分支”， Firstly, this algorithm acquires all executable tasks from available scheduling results, i. e. , obtaining several“nodes”on multiple“layers”, and forms several optional“branches”with these nodes through mul-tistep recursion.
2240 扩大解空间范围，提高算法性能; In this way, the range of solution space is extended, and the algorithm performance is improved.
2241 然后通过“删减”操作删减掉收益较低分支，将解空间控制在一适当范围内，减小搜索盲目性，降低算法计算量。 Then, this algorithm“discards”branches with low yield and keeps the solution space to a certain range, which improves the accuracy of the algorithm and reduces the calculation amount.
2242 仿真实验表明，与基于综合优先级算法的调度结果相比，利用本文算法调度时调度成功率提升了 52% ; The simulation experiment indicated that compared with the algorithm based on integrated priority The simulation experiment suggested that the proposed algorithm enjoyed a 52% increase inscheduling success rate(SSR)over the traditional integrated priority algorithm,