Pilot scheduling algorithm based on cell classification-cross entropy for massive MIMO by Yinhui YU, Heng ZHOU, Ying YANG, Hao PAN, Jiapeng REN

“…Pilot scheduling problem belongs to the arrangement optimization problem, and the algorithm computational complexity of greedy algorithm to search the optimal solution is greatly. …”
Get full text

Low complexity radar signal classification based on spectrum shape by Liang YIN, Rui LIN, Xiaolei WANG, Yuliang YAO, Lin ZHOU, Yuan HE

“…In order to solve the problems of high computational complexity, low recognition accuracy of low signal to noise ratio (SNR) environment and low fidelity of simulation data in radar signal modulation recognition, a low complexity radar signal classification algorithm based on spectrum shape was proposed.Signal spectrum was normalized, feature parameters were extracted by spectrum sampling method, and then machine learning classification model was trained.The test results of the data generated by the radar signal source show that the classification accuracy of Barker code, Frank code, LFM code, BPSK, QPSK modulation and conventional radar signals is more than 90% (SNR≥3 dB).The algorithm has low computational complexity, can adapt to the change of signal parameters, and has good generalization.…”
Get full text

CATPE protocol with capture effect for RFID tag anti-collision by Xi YANG, Hai-feng WU, Yu ZENG

“…The advantage of the protocol is that it does not need search an extreme, but one-step estimates the parameters.Thus it may reduce the computational complexity.Computer simulation results show that the identification efficiency of proposed protocol is almost identical to the existing ones, but has lower computational complexity.…”
Get full text

Spectrum sensing algorithm based on symmetry of cyclic spectral correlation by Yu-long GAO, Yan-ping CHEN, Xiu-zhi GUAN, Zhong-zhao ZHANG, Xue-jun SHA

“…In response to the shortcoming of conventional algorithms,modified SSCA was exploited to calculate the cyclic spectral correlation of received signal for decreasing the computational complexity.Symmetry of cyclic spectral correlation (CSC) was used to detect the idle spectrum,criteria and method of selecting and judging symmetry were proposed.Conventional binary hypothesis condition was translated to concrete value according to symmetry.In order to eliminate the effect of interference and noise,non-zero cyclic frequencies were selected.Finally,the performance of the presented algorithm was compared with the conventional algorithms by virtue of simulation.Simulation results proved the correctness and the superiority of new algorithms.Using symmetry improves the successful detection probability for low SNR and reduces the computational complexity.…”
Get full text

Efficient AM Algorithms for Stochastic ML Estimation of DOA by Haihua Chen, Shibao Li, Jianhang Liu, Yiqing Zhou, Masakiyo Suzuki

“…As a result, its computational complexity is rather high. This paper addresses the issue of reducing computational complexity of SML estimation of DOA based on the Alternating Minimization (AM) algorithm. …”
Get full text

A Lightweight Convolutional Neural Network for Real-time Detection of Aircraft Engine Blade Damage by Wenzhe Wang, Hua Su, Xinliang Liu, Jawad Munir, Jingqiu Wang

“…To address the large number of parameters and the computational complexity of deep learning models in the field of borescope detection, we propose a lightweight blade damage detection model LSSD using a knowledge distillation algorithm. …”
Get full text

A new approach of anomaly detection in wireless sensor networks using support vector data description by Zhen Feng, Jingqi Fu, Dajun Du, Fuqiang Li, Sizhou Sun

“…The main idea is to improve the computational complexity from the training stage and the decision-making stage. …”
Get full text

Gain and phase errors calibration for joint time reversal and PCA dimensionality reduction over multipath environment by Fangwei LI, Jiawen LU, Mingyue WANG

“…Aiming at the problem of inaccurate calibration of the array gain and phase errors caused by the signal source coherence in the multipath environment, a combination of time reversal (TR) and principal component analysis (PCA) calibration algorithm was proposed.The space-time synchronization focusing characteristic of TR was applied to obtain the return signal matrix of the target to suppress the multipath effect and reduce the signal source coherence.However, in view of the problem that the introduction of TR would make the dimension of the return signal matrix received by the array larger and increase the calculation complexity of the algorithm, PCA was utilized to implement dimensionality reduction reconstruction on the revised TR return signal matrix to reduce the computational complexity.The simulation results show that the proposed algorithm can effectively calibrate the gain and phase errors of the array with lower computational complexity in a multipath environment.…”
Get full text

New Stability Analysis Results for Linear System with Two Additive Time-Varying Delay Components by Haitao Liu, Fang Liu

“…Lastly, a numerical example is presented to illustrate the less conservatism and lower computational complexity of the derived results.…”
Get full text

Direction-of-Arrival Estimation of Electromagnetic Pulse Based on Energy Distribution by Weiyi Li, Jian Chen, Lin Lin

“…The method is based on energy distribution and improves the low accuracy and high computational complexity of the conventional estimation method. …”
Get full text

Real time interpolation algorithm based on Lanczos kernel by Ying GUO, Lun LI, Peng WANG

“…In order to improve the timeliness and reliability of color image scaling algorithms,a high effective real-time color image scaling algorithm was proposed,which first generated the kernel look up table that could be used for whole target image based on Lanczos kernel,and interpolation of all target image pixels had only fixed point operation which had low computational complexity.Meanwhile,an optimized method for rasterizing pixels of target image was proposed,which needed little memory space but embraced high efficiency of memory utilization.The experiment results show that the proposed algorithm achieves good image quality,and the computational complexity is far more less than classic image scaling algorithms.So the proposed algorithm can effectively implement real-time resizing of color images and color videos in any scaling factors.…”
Get full text

Low complexity hybrid precoding algorithm for massive MIMO based on modified Newton method by Bo HU, Anding WANG, Guiyi WEI

“…A phase tracking algorithm was proposed for massivemultiple-input multiple-output(MIMO) systems based on the modified Newton (MN) method, which effectively reduced the high computational complexity in traditional high-performance hybrid precoding schemes.The algorithm optimized the analog precoding matrix from the perspective ofsub-dimensional vector recovery.In each sub-dimension optimization, the phase tracking method was used to transform the recovery of the analog precoding vectors into an unconstrained nonlinear optimization problem, which was then solved using the MN method.Concurrently, this strategy led to a marked reduction in the computational intricacy pertaining to both the computation of correction factors and the inversion of the Hessian matrix within the framework of the MN method.This was achieved through the insightful incorporation of Gerschgorin’s Disk theorem and the Hermitian matrix block-inverse lemma.Simulation results show that the proposed algorithm has higher spectral efficiency and lower computational complexity than several conventional high-performance hybrid precoding schemes.…”
Get full text

Detection for physical-layer network coding in two-way relay channels by Wei YAN, Yue-ming CAI, Cheng-kang PAN

“…The detection for physical-layer network coding (PNC) in two-way relay channels was investigated.Maximum-likelihood (ML) detection not only had great performance but also had high computational complexity.Therefore,without channel state information (CSI) at source nodes,two detection schemes were proposed.The first scheme was likelihood ratio(LR)detection based on LR function,and the other was maximum a posteriori probability (MAP) detection based on MAP rule.Meanwhile,It carried out similar analysis if CSI was available at source nodes.Compared to ML detection which separately detects two source messages,numerical and simulation results show that LR detection outperforms it in terms of BER metric with the requirement for additional noise variance information.And MAP detection is equivalent to ML detection,and it has lower computational complexity.…”
Get full text

An Improved Distributed Multi-User Cooperative Spectrum Sensing Method Based on DCS by Jianwu Zhang, Xiaoyan Chen, Xiaorong Xu

“…However, it increases computational complexity in the process of signal reconstruction. …”
Get full text

Symbol timing recovery algorithm based on ordered statistic of maximum mean power timing for WBAN by HIYu C, HENLan C, VChao L

“…The symbol timing algorithm based on maximum mean power timing is independent of carrier phase offset,and has the property of capturing timing information fast,which meets the demand of wireless body area networks (WBAN).According to IEEE 802.15.6 standard,the ordered statistic of maximum mean power timing was used to reduce the computational complexity in the symbol timing process.The theoretical analysis and simulation results shows that the proposed algorithm can achieve symbol timing within 32 symbols and reduce the computational complexity by ninety percent at most compared to the original maximum mean power algorithm.The fast synchronization and car-rier-independence property of the proposed algorithm can also make room for carrier-offset recovery and frame synchro-nization.…”
Get full text

Sign Problem in Tensor-Network Contraction by Jielun Chen, Jiaqing Jiang, Dominik Hangleiter, Norbert Schuch

“…Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. …”
Get full text

Iterative rake equalization method for low-complexity OTSM in high-speed mobile environment by Guojun LI, Kun LONG, Changrong YE, Jiawen LIANG

“…Aiming at the problems of poor anti-noise performance and high computational complexity of the existing orthogonal time sequency multiplexing (OTSM) equalization methods, a low-complexity iterative rake equalizer based on maximum ratio combining (MRC) was proposed.The main idea was to use MRC to iteratively extract and coherently combine the received multipath components of the transmitted symbols in the delay-time domain to improve the signal-to-noise ratio of the combined signal.In order to speed up the convergence of the MRC iterative algorithm, a single-tap time-frequency equalizer was designed to provide an initial estimate, and then combined with an external error correction code to further improve the bit error performance.The simulation results show that the performance of the iterative rake equalizer based on MRC is significantly better than that of the LMMSE linear equalizer, and the performance and computational complexity are greatly improved compared with the currently widely used Gauss-Seidel (GS) iterative equalizer.…”
Get full text

Boost Converters’ Proximate Constrained Time-Optimal Sliding Mode Control Based on Hybrid Switching Model by Asghar Taheri, Amir Ghasemian, Hai-Peng Ren

“…Second, switching based on the converter’s natural trajectories has high computational complexity and high dependence on circuit parameters. …”
Get full text

WSN key recovery attack based on symmetric matrix decomposition by Xiangmin JI, Bo ZHAO, Jinhui LIU, Jianwei JIA, Huanguo ZHANG, Shuang XIANG

“…The key protocol is one of the crucial technologies to ensure the security for wireless sensor network（WSN）.Parakh,et al.proposed a key agreement for WSN based on matrix decomposition.However,the study revealed that the protocol had security risks.A key recovery attack scheme against this protocol was proposed by using the properties of symmetric matrix and permutation matrix.Based on intercepting the row and column vector of the node,elementary transformation was performed to construct a linear algebraic attack algorithm and the equivalent key was obtained.The computational complexity is O(N<sup>6</sup>).Experimental results show that the method can recover the equivalent key of the above protocol within the polynomial computational complexity and the memory consumption is within an acceptable range.In addition,an improved scheme for key agreement was proposed to resist the linear algebraic attack by using a random disturbance matrix,and the correctness and security analysis were also carried out.…”
Get full text

H.264 SVC Complexity Reduction Based on Likelihood Mode Decision by L. Balaji, K. K. Thyagharajan

“…Scaling consumes more encoding time and computational complexity during mode selection. In this paper, to reduce encoding time and computational complexity, a fast mode decision algorithm based on likelihood mode decision (LMD) is proposed. …”
Get full text