Multi scale power spectral density subband gradient-based spectrum sensing algorithm and performance analysis by Yang ZHANG, Hua PENG, Ke-xian GONG

“…The theoretical analysis and simulation results prove that the novel algorithm overcomes effectively the color noise with low computational complexity and strong real-time in Gaussian noise and fading channel, which can accomplish occupying band range localization of prime users. …”
Get full text

Anonymous whistleblowers reply scheme based on secret sharing by HE Kun, HUANG Yajing, DU Ruiying, SHI Min, LI Siqin, CHEN Jing

“…The experimental results show that compared to the Express scheme, the proposed scheme reduces the computational complexity during a reply to <italic>O</italic>(1) from <italic>O</italic>(log<italic>N</italic>), resulting in a 60% reduction in computational overhead for the receiving organization and a 50% reduction for the server.…”
Get full text

Marker and source-marker reprogramming of Most Permissive Boolean networks and ensembles with BoNesis by Paulevé, Loïc

“…In each case, we give an upper bound on their theoretical computational complexity, and give an implementation of the resolution using the BoNesis Python framework. …”
Get full text

Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression by Kai Lu, Shuyan Jiang, Yiming Zhao, Yongjie Lin, Yinhai Wang

“…The graphical progression method can obtain grand coordinated schemes with minimal computational complexity. However, there is no standardized solution for this method, and only a few related studies have been found thus far. …”
Get full text

Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem by Ho-Yoeng Yun, Suk-Jae Jeong, Kyung-Sup Kim

“…The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. …”
Get full text

Suboptimal Greedy Power Allocation Schemes for Discrete Bit Loading by Waleed Al-Hanafy, Stephan Weiss

“…We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. …”
Get full text

A Transformer-Based Model for Abnormal Activity Recognition by Amir Mohammad Ahmadi, Kourosh Kiani, Razieh Rastgoo

“…Considering recent advances in artificial intelligence, particularly deep learning, this paper introduces a model based on the Transformer network. To reduce computational complexity, keypoints of the human body are utilized in this approach. …”
Get full text

Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding by Maitane Barrenechea, Mikel Mendicute, Egoitz Arruti

“…Nevertheless, the optimality of these algorithms has been assessed mainly in terms of error-rate performance and computational complexity, leaving the hardware cost of their implementation an open issue. …”
Get full text

A New Collision Avoidance Approach for Automated Guided Vehicle Systems Based on Finite State Machines by Mustafa COBAN, Gokhan GELEN

“…The presented approach uses the decentralized node-based approach to reduce computational complexity. The proposed method has been validated through simulation performed with vehicle applications that can move both unidirectional and bidirectional. …”
Get full text

Design of hybrid precoding with successive interference cancellation and alternating direction method of multipliers by Xiongwen ZHAO, Yao LIU, Yu ZHANG, Suiyan GENG, Peng QIN, Zhenyu ZHOU

“…To solve the problem of large power consumption caused by a large number of phase shifter (PS) in millimeter wave multi-antenna systems, a new type of dynamic connection structure was designed.With the goal of maximizing spectrum efficiency, two hybrid precoding schemes, successive interference cancellation (SIC) and successive interference cancellation-alternating direction multiplier (SIC-ADMM), were proposed.In SIC scheme, the sum-rate problem was decomposed into multiple sub-rate problems of different radio frequency links, the analog part was solved by iteration, and the digital part was solved by a low-dimensional equivalent matrix.Based on SIC scheme, an improved SIC-ADMM scheme was further proposed by studying the multi-variable sub-rate problem to achieve rapid convergence and reduce computational complexity effectively.The simulation results show that the proposed schemes have good spectrum and energy efficiencies by comparison with the existing schemes, and are more suitable for large-scale antenna systems.In addition, when a certain percentage of PS is turned off, the proposed scheme can greatly improve energy efficiency by sacrificing a small amount of spectrum efficiency.…”
Get full text

Augmented Lagrange Based on Modified Covariance Matching Criterion Method for DOA Estimation in Compressed Sensing by Weijian Si, Xinggen Qu, Lutao Liu

“…This minimization problem is shown to be a semidefinite program (SDP) and transformed into a constrained quadratic programming problem for reducing computational complexity which can be solved by the augmented Lagrange method. …”
Get full text

Low-complexity signal detection algorithm for the power splitting receiver scheme by WANG Yanyan, LI Qidi, TANG Xiaohu

“…Theoretical analysis demonstrates that the proposed signal detection algorithm has lower computational complexity compared to the traditional signal detection schemes based on three-dimensional received signals. …”
Get full text

Fast Visual Tracking with Enhanced and Gradient-Guide Network by Dun Cao, Renhua Dai

“…Firstly, we adopt the lightweight ResNet-34 as the backbone to improve the proposed tracker’s speed by reducing the computational complexity, and then, to compensate for the performance loss caused by the lightweight backbone, we embed the SKNet from the attention mechanism to filter out the valueless features, and finally, we utilize the gradient-guide strategy to update the template timely. …”
Get full text

Optimal Error Estimate of Chebyshev-Legendre Spectral Method for the Generalised Benjamin-Bona-Mahony-Burgers Equations by Tinggang Zhao, Xiaoxian Zhang, Jinxia Huo, Wanghui Su, Yongli Liu, Yujiang Wu

“…By using the proposed method, the computational complexity is reduced and both accuracy and efficiency are achieved. …”
Get full text

Pansharpening Techniques: Optimizing the Loss Function for Convolutional Neural Networks by Rocco Restaino

“…This study focuses on the latter approach, where performance depends not only on the accuracy of the quality measure but also on the mathematical properties of these measures, which may introduce challenges related to computational complexity and optimization. The evaluation of the most recognized no-reference image quality measures led to the proposal of a novel criterion, the Regression-based QNR (RQNR), which has not been previously used. …”
Get full text

DOA Estimation for Sources with Large Power Differences by Qingyuan Fang, Mengzhe Jin, Weidong Liu, Yong Han

“…Numerical results indicate that the improved algorithm increases the probability of resolution while maintaining the estimation accuracy and computational complexity.…”
Get full text

A multiscale approach to a linear programming problem for calculating a refractive optical element forming a given far-field illumination distribution by D.V. Soshnikov, A.A. Mingazov, L.L. Doskolovich

“…The direct solution of this type of problem presents a huge computational complexity. To overcome this difficulty we use the so-called multiscale approach based on constructing a chain of approximations that are solutions on refining grids.…”
Get full text

Differential fault attack on LiCi cipher by Weijian CHEN, Haoxiang LUO

“…LiCi lightweight block cipher is a new algorithm proposed in 2017.With advantages of small structure and low energy consumption, LiCi is more suitable for resource-constrained environments such as the internet of things (IoT).In the design document of LiCi, the ability of LiCi algorithm to resist differential attack and linear attack is analyzed, but the resistance of LiCi algorithm to differential fault attack has not been discussed.According to the permutation law of each round iteration of LiCi algorithm, 32-bit key can be recovered by injecting a single bit fault into the left half of the 31st round iteration combined with its differential property.According to the key choreography scheme of the LiCi algorithm, the same differential fault attack was performed on iterations 30th, 29th, 28th, 27th and 26th round to recover all the original keys.The attack requires a total of 48-bit faults, and the computational complexity is 2³², which indicates the LiCi algorithm is difficult to resist differential fault attacks.…”
Get full text

On Modelling and Comparative Study of LMS and RLS Algorithms for Synthesis of MSA by Ahmad Kamal Hassan, Adnan Affandi

“…Our findings point to higher accuracies in approximation for synthesis of MSA using RLS algorithm as compared with that of LMS approach; however the computational complexity increases in the former case.…”
Get full text

An Improved Extended Information Filter SLAM Algorithm Based on Omnidirectional Vision by Jingchuan Wang, Weidong Chen

“…Traditional algorithms bring enormous computational complexity to omnidirectional vision SLAM. An improved extended information filter SLAM algorithm based on omnidirectional vision is presented in this paper. …”
Get full text