ID 原文 译文
17895 针对此问题，该文以自卫式干扰条件下线性调频(LFM)相参体制雷达抗SMSP干扰为背景，提出快慢时间域联合处理抑制SMSP干扰算法。 For this problem, a jamming suppression algorithm based on fast and slow time domain joint processing is proposed under the background of Linear Frequency Modulation (LFM) coherentradar countering SMSP jamming.
17896 分析了SMSP干扰时频特征和对相参雷达的干扰特性， The time and frequency domain characteristics of SMSP are studied and the effect on coherent radar is analyzed on the condition of self screening jamming.
17897 在此基础上，设计了慢时间微分熵估计干扰位置，相关系数最大准则估计干扰参数，双正交傅里叶变换快时间分段重构干扰信号和干扰对消的抑制流程。 On this basis, four processing steps are designed to suppress the SMSP jamming. Firstly, the jamming fast time location is estimated by calculating the differential entropy of slow time signal. Secondly, the real jamming parameter is found based on the maximum correlation coefficient criterion. Then the jamming signals are reconstructed using Biorthogonal Fourier Transform. Finally, the SMSP jamming is suppressed by cancellation.
17898 仿真结果表明，所提算法模型与雷达处理流程切合度高，对比分析进一步验证算法效能。 The simulation results show thatthe proposed algorithm model is highly consistent with the actual radar processing flow, and the efficiency isfurther verified through algorithms comparison.
17899 针对5G网络高可靠性、低时延的服务需求，该文提出一种面向时延与可靠性优化的服务功能链(SFC)部署(DROSD)方法。 For the high reliability and low delay service requirements of 5G network, a Delay and ReliabilityOptimization of Service Function Chain (SFC) Deployment (DROSD) method is proposed.
17900 在不预留冗余资源的情况下，首先通过功能互斥约束来确定SFC中相邻虚拟网络功能(VNF)是否可聚合； Without reservationof redundant resources, firstly, the function mutually exclusive constraints are used to determine whether theadjacent Virtual Network Function (VNF) in SFC can be combined;
17901 其次通过功能性约束、资源约束选择可聚合物理节点集合，实现负载均衡，提高SFC可靠性； Secondly, functional constraints andresource constraints are used to select combinatorial physical node set to achieve load balancing and improvethe reliability of SFC;
17902 然后通过跳数约束进行优化，进一步筛选可聚合物理节点集合以降低SFC的端到端时延；最后通过节点可用资源、节点度以及与原节点跳数指标进行降序排列，取最大值物理节点部署VNF。 Thirdly, the end-to-end delay of SFC is reduced by hop number constraints, and finallythe VNF is deployed by the physical node with the maximum value, which is arranged in descending orderthrough the available resources, node degree and hops from the original node.
17903 SFC的路由选择，采用K-最短路径算法。 The routing of SFC adopts K-shortest path algorithm.
17904 仿真实验表明，该文所提算法提高了请求接受率、长期平均收益开销比，增强了SFC可靠性，降低了端到端时延，减小了平均带宽开销。 The simulation results show that the proposed algorithm improves the requestacceptance rate and the long-term average ratio of revenue to cost, enhances the reliability of SFC, reduces theend-to-end delay, and reduces the average bandwidth cost.