ID 原文 译文
543 仿真结果和数值分析表明该算法运算复杂度低，且能在保证系统频谱效率的同时大幅度提升系统能效。 Simulation results andnumerical analysis show that this algorithm can improve the system energy efficiency with no reduction inspectrum efficiency performance.
544 针对射频识别技术(RFID)系统中现有标签数量估计算法存在的估计误差大、识别时延长、时间复杂度高的问题，该文提出一种基于高斯拟合与切比雪夫不等式的标签数量2次估计算法(TLNEGC)。 In order to solve the problems of large estimation error, prolonged identification and high timecomplexity, which exist in tag quantity estimation algorithm in Radio Frequency IDentification (RFID) system,The Twice Labels Number Estimation algorithm based on Gaussian fitting and Chebyshev inequality(TLNEGC) is proposed.
545 首先根据碰撞因子与碰撞时隙比例的关系建立碰撞模型，采用高斯函数对碰撞模型中的离散数据点进行拟合逼近获得高斯估计模型；然后利用高斯估计模型初次估计标签的数量，根据初次估计的结果判断是否需要进行2次估计，2次估计是利用切比雪夫不等式对估计区间进行2次搜索以获得最佳估计值。 Firstly, a collision model is established based on the relationship between the collisionfactor and the collision time slot ratio, and a Gaussian estimation model is obtained by fitting the Gaussianfunction to the discrete data points. Afterward, the Gaussian estimation model is used to initially estimate thenumber of labels, and then according to the results of the initial estimation, judge whether a second estimationis required. The second estimation is performed by using Chebyshev's inequality to search the estimationinterval twice to obtain the best estimate.
546 MATLAB仿真分析表明，该文所提TLNEGC算法的平均估计误差和总时间消耗明显低于现有的高精度标签估计算法，同时具有较低的时间复杂度和较高的稳定性。 The MATLAB simulation analysis indicates that the averageestimation error and total time consumption of the TLNEGC algorithm are significantly lower than those ofexisting high-precision label estimation algorithms, and it also has lower time complexity and higher stability.
547 针对中短码长下串行抵消(SC)算法性能较差，且串行抵消列表(SCL)算法复杂度较高等问题，根据译码纠错空间理论，该文提出了一种基于卷积神经网络(CNN)扰动的极化码译码算法。 According to the space theory for error correction, a Polar decoding algorithm for medium and shortcode lengths, based on the perturbation with a Convolution Neural Network (CNN), is presented to overcomethe poor performance of the Successive Cancellation (SC) decoding algorithm and the high complexity of theSuccessive Cancellation List (SCL) decoding algorithm.
548 对SC译码失败的接收序列，通过CNN产生相应的扰动噪声，并将该扰动噪声添加到接收信号中，然后根据重新计算的似然信息进行译码。 For any receiving signals that failing to decode, aperturbation noise, generated through the CNN, is added to the receiving signal, and the likelihood informationis then recalculated for further decoding.
549 仿真结果表明：与SC译码算法相比，所提出的算法约有0.6 dB的增益，与SCL(L=16)译码算法相比，该算法约有0.1 dB的提升，且平均复杂度更低。 The simulation results show that the proposed algorithm has a gain ofabout 0.6 dB compared with the SC decoding algorithm, and an improvement of about 0.1 dB and a loweraverage complexity than that of SCL decoding algorithm when L=16.
550 正交频分复用系统(OFDM)的高峰均比(PAPR)问题降低了系统传输效率，增加了解调难度，使高功率放大器(HPA)满负载工作。 The Peak to Average Power Ratio (PAPR) problem of OFDM system reduces the transmissionefficiency of the system, increases the difficulty of demodulation, and makes the High Power Amplifier (HPA)to saturation.
551 该文针对削波与HPA引入的非线性失真问题，提出在接收端采取基于泰勒级数的预处理方式对非线性干扰进行处理，最小化信号畸变影响。 In order to solving the problem of nonlinear distortion caused by clipping and HPA, the proposedscheme uses preprocessing method based on Taylor series to deal with nonlinear interference so that tominimize the influence of signal distortion.
552 在发送端通过削波降低信号的PAPR，并利用削波噪声在时域上的稀疏性特性，将传输过程作为整体考虑，最后利用正交匹配追踪算法(OMP)恢复总的非线性失真信号。 At the transmitter, the PAPR of the signal is reduced by clipping,and the transmission process is considered as a whole based on the sparsity of clipping noise in the timedomain. Finally, the total nonlinear distortion signal is recovered by using the Orthogonal Matching Pursuit(OMP) algorithm.