ID 原文 译文
19665 针对基于LTE信号的外辐射源雷达接收信号包含多个同频发射基站的直达波和多径杂波干扰的问题，该文对传统的外辐射源雷达信号处理流程进行了改进，增加了对同频基站干扰的处理步骤，提出了一种基于卷积混合模型的盲源分离算法来抑制同频基站的杂波干扰。 For the passive radar based on LTE signal, the received signal contains direct-path and multipathclutters interference of multiple co-channel base station, and the traditional passive radar signal processing flowis improved, and the processing steps of co-channel base station interference are added. A blind source separation algorithm based on convolutive mixtures is proposed. The algorithm can suppress the clutters interference of co-channel base station.
19666 假设混合矩阵是一个矢量线性时不变滤波器矩阵，以互信息为代价函数，通过求取互信息的梯度，用最速下降法进行迭代，分离准则是使分离后的信号之间互信息最小化。 It is assumed that the mixing matrix is a vector linear time-invariantfilter matrix. The mutual information is used as a cost function. By finding the gradient of mutual information,it is iterated by the steepest descent method. The separation criterion is to minimize the mutual information between the separated signals.
19667 仿真表明，该文算法能够有效地抑制LTE信号同频发射基站的杂波干扰，为后续的主基站杂波对消处理提供了基础。 The simulation results show that the proposed algorithm can effectively suppress the clutters interference of the LTE signal co-channel base station, and provide a basis for the subsequent clutters cancellation processing of the main base station.
19668 为了满足网络切片多样化需求，实现无线虚拟资源的动态分配，该文提出在C-RAN架构中基于非正交多址接入的联合用户关联和功率资源分配算法。 To satisfy the diversity of requirements for different network slices and realize dynamic allocation ofwireless virtual resource, an algorithm for network slice joint user association and power allocation is proposedin Non-Orthogonal Multiple Access(NOMA) C-RAN.
19669 首先，该算法考虑在不完美信道条件下，以切片和用户最小速率需求及时延QoS要求、系统中断概率、前传容量为约束，建立在C-RAN场景中最大化长时平均网络切片总吞吐量的联合用户关联和功率分配模型。 Firstly, by considering imperfect Channel State Information(CSI), a joint user association and power allocation algorithm is designed to maximize the average total throughput in C-RAN with the constraints of slice and user minimum required rate, outage probability and fronthaul capacity limits.
19670 其次，将概率混合优化问题转换为非概率优化问题，并利用Lyapunov优化理论设计一种基于当前时隙的联合用户调度和功率分配的算法。 Secondly, a joint user association and power allocation algorithm is designed according to the current slot by transforming the probabilistic mixed optimalization problem into a non-probabilistic optimalization problem and using Lyapunov optimization.
19671 最后采用贪婪算法求得用户关联问题次优解；基于用户关联的策略，将功率分配的问题利用连续凸逼近方法将其转换为凸优化问题并采用拉格朗日对偶分解方法获得功率分配策略。 Finally, for user association problem, agreedy algorithm is proposed to find a feasible suboptimal solution; The power allocation problem is transformed into a convex optimization problem by using successive convex approximation; Then a dual decomposition approach is exploited to obtain a power allocation strategy.
19672 仿真结果表明，该算法能满足各网络切片和用户需求的同时有效提升系统时间平均切片总吞吐量。 Simulation results demonstrate that the proposed algorithm can effectively improve the average total throughput of system while guaranteeing the network slice and user requirement.
19673 利用Walsh-Hadamard变换可实现2元域含错方程组的求解，该方法可用于卷积码的盲识别，但当方程组未知数较多时，其对计算机内存的要求使得该方法在实际中难以应用，为此该文提出一种基于分段Walsh-Hadamard变换的卷积码识别方法。 The Walsh-Hadamard transform can be used to solve binary domain error-containing equations, andthe method can be used for blind identification of convolutional codes. However, when the number of system unknowns is large, the requirement of computer memory makes it difficult to apply this method to practice.Therefore, a convolutional code recognition method based on partitioned Walsh-Hadamard transform is proposed.
19674 该方法通过对方程组高维系数向量进行分段，使其转化为两个低维的系数向量，将Walsh-Hadamard变换求解高维方程组的问题分解为求解两个较低维数方程组的问题，同时证明了两个低维方程组解向量的组合就是高维方程组的解。 By segmenting the high-dimensional coefficient vectors of the equations into two low-dimensional coefficient vectors, the problem of solving the high-dimensional equations by Walsh-Hadamard transformation is decomposed into the problem of solving the two low-dimensional equations, and it is proved that the combination of the solution vectors of the two low-dimensional equations is the solution of the high-dimensional equations.