Research on greedy reconstruction algorithms of compressed sensing based on variable metric method by Pan-pan LIU, Lei LI, Hao-yu WNAG

Subjects: Get full text

MSF-GhostNet: Computationally Efficient YOLO for Detecting Drones in Low-Light Conditions by Maham Misbah, Misha Urooj Khan, Zeeshan Kaleem, Ali Muqaibel, Muhamad Zeshan Alam, Ran Liu, Chau Yuen

Subjects: “…Computational complexity…”
Get full text

Combined coding of bit planes of images by B. J.S. Sadiq, V. Yu. Tsviatkou, M. N. Bobov

Subjects: Get full text

Advantages of Logarithmic Signatures in the Implementation of Crypto Primitives by Yevhen Kotukh, Hennadii Khalimov

Subjects: “…computationally complex tasks…”
Get full text

Fast recursive algorithm for implementation of MIMO ZF-SIC detection by Zuo-liang YIN, Xing-peng MAO, Qin-yu ZHANG, Nai-tong ZHANG

Subjects: Get full text

Wearable Sensor-Based Exercise Monitoring System for Higher Education Students Using a Multi-Attribute Fuzzy Evaluation Model by Shiping Yu, Xiaowei Peng

Subjects: Get full text

Advanced Fractional Mathematics, Fractional Calculus, Algorithms and Artificial Intelligence with Applications in Complex Chaotic Systems by Dumitru Baleanu, Yeliz Karaca

Subjects: Get full text

Nonlinear error modified equalization algorithm in high-order modulation of satellite communication by Cheng-kai TANG, Ling-ling ZHANG, Bao-wang LIAN

“…Aiming at the larger computation and the slower speed of nonlinear error compensation of traditional equalization algorithms,the fast nonlinear error equalization algorithm with amplitude and phase separation was constructed.It combined the feedback equalization to reduce the computational complexity respectively.In order to eliminate nonlinear interference and memory interference,the algorithm utilized the Volterra model to modify the error and it was adapted to update the feedback equalization parameters.The theoretical analysis and simulation compared proposed algorithm and existing conventional equalization algorithms from the bit error rate,convergence speed and computational complexity.The results show that the computational complexity is only equivalent to 14.1%～24.9% of other algorithms and proposed method can cancel the nonlinear interference quickly.…”
Get full text

Optimizing low complexity encoding method for systematic polar code by Linhua MA, Shiping LIU, Xing HU, Tianyu HUANG, Bin XU

“…In order to solve the delay caused by step-by-step calculation and the computational complexity caused by iterative “exclusive-or” computation during the encoding process,a dimensionality reduction strategy was proposed and defined.Based on this,system polarization code parallel coding algorithm for cracking strategy was proposed.Simulation and computational complexity analysis were carried out on AWGN channel.The results show that the coding gain of the above algorithm is slightly better than the traditional one or almost the same,but the computational complexity is up to 80.92%,which is more suitable for hardware implementation and engineering application.It is more suitable for hardware implementation and has a certain practical value.…”
Get full text

Reducing the dynamic range of infrared images based on block-priority equalization and compression of histograms by S. I. Rudikov, V. Yu. Tsviatkou, A. P. Shkadarevich

“…This in-creases the local contrast of the image, but leads to high computational complexity, which is increasing while block size decreases. …”
Get full text

Segment search for local extremums of images based on the analysis of brightness of adjacent homogeneous areas by V. Yu. Tsviatkou, Anh Tuan Nguyen

“…Morphological search algorithms provide the selection of non-strict extremes, but have a high computational complexity. A mathematical model and an algorithm based on the brightness analysis of adjacent homogeneous regions are proposed to isolate strict and non-strict local extremes of images with low computational complexity. …”
Get full text

A genetic algorithm based method of optimizing dispersion matrix for RDSM system by Peng ZHANG, Xiaoping JIN, Dongxiao CHEN

“…Rectangular differential spatial modulation (RDSM) is a multi-antenna incoherent modulation technology with high spectral efficiency, low power consumption, and zero-overhead for channel estimation.RDSM is especially suitable for 6G communication systems, such as fast-moving Internet of vehicles, Internet of things, cellular networks, etc.However, the construction of the sparse rectangular unitary space-time dispersion matrix (DM) at transmitter is a problem.The proposed Genetic algorithm (GA) will result in less computational complexity than the currently used random research.The fitness of GA was calculated by the rank and determinant criterion (RDC) method to avoid discussions in differential system.Due to characteristics of constellation symbols of RDSM, the proposed method reduced the computational complexity during each single iteration in GA.The simulation results show that the optimized DMS can significantly improve the bit error rate (BER) performance of the RDSM system.Compared with random search, the low-complexity GA effectively improves the DMS optimization efficiency of RDSM.The computational complexity required for optimizing DMS is about 0.1% of random search optimization method.…”
Get full text

A Low-Complexity GA-WSF Algorithm for Narrow-Band DOA Estimation by Haihua Chen, Jialiang Hu, Hui Tian, Shibao Li, Jianhang Liu, Masakiyo Suzuki

“…As a result, the computational complexity of WSF is very high, which prevents its application to real systems. …”
Get full text

Urban Traffic Flow Forecast Based on FastGCRNN by Ya Zhang, Mingming Lu, Haifeng Li

“…Experiments on large-scale traffic data sets illustrate that the proposed method can greatly reduce computational complexity and memory consumption while maintaining relatively high accuracy.…”
Get full text

General Improvements of Heuristic Algorithms for Low Complexity DOA Estimation by Haihua Chen, Haoran Li, Mingyang Yang, Changbo Xiang, Masakiyo Suzuki

“…Simulation results show that the computational complexity can be greatly reduced while these improvements are used.…”
Get full text

Robust Schnorr-based subgroup multi-signature scheme by ZHANG Zhenqi, ZHU Qiuchi, WANG Zhiwei

“…This scheme retained the advantage of low computational complexity inherent in the Schnorr digital signature cryptosystem while incorporating the benefits of subgroup multi-signature. …”
Get full text

Low-complexity variable step-size sign algorithm based on Weibull distribution function by Rui ZHANG, Guchen SHI, Banteng LIU, Yourong CHEN

“…The performance of the traditional second-order statistics based channel estimation methods degrade seriously in the presence of impulsive noises.In order to deal with this problem,a Weibull distribution function based variable step-size sign algorithm for channel estimation under impulsive noises was proposed.The proposed method was robust against impulsive noises and it could improve the convergence speed of the sign algorithm with the Weibull distribution function based variable step-size method.Computational complexity analysis and simulation results demonstrate that the proposed algorithm can achieve the same steady-state estimation error with faster convergence speed and lower computational complexity.…”
Get full text

Low complexity signal detection algorithm based on Newton iterative algorithm by Gang LIU, Zengjin LOU, Qinhua LIN, Yi GUO

“…In order to solve the problems of high computational complexity and slow convergence rate of ultra-massive MIMO detection in terahertz communication system, the low complexity signal detection algorithm based on Newton iterative algorithm was proposed.By improving the initial matrix and adding step factor in Newton iteration algorithm, the complexity of the algorithm was reduced, and the convergence speed was increased.By adding adjusting factors, the stability and reliability of the algorithm were guaranteed, and the applicability of the algorithm was also increased.Simulation results show that the proposed algorithm have lower computational complexity and faster convergence speed compared with traditional schemes.When the number of iterations is three, the detection performance is close to MMSE algorithm.…”
Get full text

Analysis of statistical resolution limit based on Rao test by Minhong SUN, Yanfang LIU, Hua ZHONG, Jianrong BAO

“…Since the approach of analyzing statistical resolution limit (SRL) based on generalized likelihood ratio test (GLRT) has the problems of high computational complexity and isn’t easy to get the analytical formula of the detection statistics,a method for the analysis of the SRL based on Rao test was proposed.The unidimensional SRL of azimuth under the cases of known and unknown noise variance,two-dimensional SRL of azimuth and elevation under the case of known noise variance were analyzed.The Rao test detection statistic and the minimum SNR required for the corresponding SRL were derived,the detection performance and the computational complexity of the Rao test were analyzed and compared with the GLRT method.Simulation results verify the validity of the Rao test.…”
Get full text

Turbo iterative acquisition algorithm for satellite high-mobility DSSS signal by Chunxiao JIANG, Jiawei WANG

“…To solve the problems of the low acquisition probability and high computational complexity in satellite high-mobility communications, a new factor graph was designed for acquisition of the high-mobility direct sequence spread spectrum (DSSS) signal, where time-varying Doppler rates were modeled by the random walk model.Based on the proposed factor graph, the turbo iterative DSSS signal acquisition algorithm was proposed.In the Doppler-estimation loop, the negative influence of Doppler frequency offsets and Doppler rates could be eliminated effectively.Then in the code-detection loop, constraints of each chip was used to recover the received signal, to achieve DSSS signal acquisition.Simulation results show that the proposed algorithm is capable of improving the acquisition performance at less 1.3 dB with low computational complexity.…”
Get full text