A New Algorithm for System of Integral Equations by Abdujabar Rasulov, Adem Kilicman, Zainidin Eshkuvatov, Gulnora Raimova

“…Beacause of it, we reduce computational complexity considerable. Using the new algorithm it is also possible to solve an initial boundary value problem for system of parabolic equations. …”
Get full text

Discretization of a mathematical model for image analysis based on the optics of spiral beams by S.A. Kishkin, S.P. Kotova

“…Explicit mathematical procedures suitable for writing application software codes are given, an estimate of computational complexity is obtained, and the possibility of achieving real-time performance is confirmed. …”
Get full text

Spectrum Access Algoritbm Based on POMDP Model in CVANET by Xuefei Zhang, Guoan Zhang, Yancheng Ji

“…Because there is a huge computational complexity, the greedy algorithm was sought. …”
Get full text

Simplified MD-LSD demapping algorithm for BICM-ID systems with multi-dimensional mappings by GONG Feng-kui, GE Jian-hua, WANG Yong

“…Compared with the MD-MAX-LOG-MAP algo- rithm, the computational complexity of MD-LSD was decreased significantly. …”
Get full text

Chosen-key extracting attack to random LSB steganography by CHEN Jia-yong1, ZHU Yue-fei1, ZHANG Wei-ming2, LIU Jiu-fen2

“…A chosen-key extracting attack based on random LSB steganography was proposed.By constructing an orient ring model for a sort of pseudo-random steganography algorithms,it proved that there are many equivalent keys and neighboring keys in the model,and then proposed a method to calculate the number of equivalent keys.With the charac-ter of equivalent keys,neighboring keys and outlier detection method,the proposed scheme achieved lower computational complexity than the method proposed by Fridrich.Both academic results and experimental results indicated that the algorithm was reliable even with rather big error in estimating the embedding rate.…”
Get full text

Distributed locating algorithm for wireless sensor networks-MDS-MAP（D） by MA Zhen, LIU Yun, SHEN Bo

“…A new distributed locating algorithm MDS-MAP（D） was proposed,which attempted to improve the perform-ance of node localization in wireless sensor networks.The process of the computation about node relative coordinates and the aggregation from local network to global network are introduced explicitly.Further,the analyses to computational complexity and the simulations of the algorithm are also present.MDS-MAP（D）,which is based on node clustering mechanism and uses connectivity of nodes to estimate the coordinates of nodes,reduces the complexity and energy con-sumption of node localization on the absence of distance measurement with high precision.The simulation and analysis results indicate that the complexity of node localization algorithm falls to O（Nm 2）,m < N from O（N 3） and the accu-racy is improved 1%～3%.…”
Get full text

A Numerical Convolution Representation of Potential for a Disk Surface Density in 3D by Chien-Chang Yen

“…With the help of fast Fourier transform, the computational complexity is only O(M2(log2⁡M)), where M is the number of zones in one dimension. …”
Get full text

Fair Resource Allocation Algorithm for OFDMA System with Imperfect CSI by Yaohui Wu, Youming Li, Liping Jin, Pengfei Shao

“…Simulation results show that the proposed algorithm can effectively maximize the system ergodic capacity and guarantee the fairness, while the computational complexity was reduced significantly.…”
Get full text

Resource allocation algorithm based on the multi-relay decoding-and-forwarding in OFDM system by Tao GUO, Youming LI, Ting LI, Yuzhi YAN

“…To reduce the computational complexity，the information transmission mode and the optimal relay set that assisting the transmission under relay mode were determined first，then the original problem was transformed into a dual problem to achieve the joint optimization solution of subcarrier-pairing and power allocation. …”
Get full text

Rate-Distortion Optimized Frame Dropping for Multiuser Streaming and Conversational Videos by Wei Tu, Jacob Chakareski, Eckehard Steinbach

“…The additional transmission overhead and the computational complexity of the proposed frame dropping schemes are analyzed. …”
Get full text

APPLICATIONS OF MONTE CARLO SIMULATION TO STRUCTURAL ENGINEERING PROBLEMS by Abdullah Azbah

“…The study concludes that despite its limitations, the simplicity and ease of implementation render Monte Carlo simulations an attractive option for structural design optimization scenarios where computational complexity may pose challenges. …”
Get full text

Conjugate propagator method for direction finding by LIU Jian1, WANG Yan-wei1, HUANG Zhi-tao2, ZHOU Yi-yu2

“…The mean square error （MSE） performance of COP was analyzed and the ana-lytical expression of MSE was given. The computational complexity of COP was analyzed also. Simulation results show the better performance of COP than OPM and MUSIC algorithms and the accordance between the theoretical results and the simulation results.…”
Get full text

Fast inter prediction algorithm applied in quality SVC by WANG Da-yong1, SHU Jian2

“…Based on the characteristics of quality scalable video coding,a fast inter encoding algorithm was proposed on the enhancement layer for the medium-grain quality scalability（MGS）.Firstly,based on the base layer macroblock mode and rate-distortion,the order of the coding mode for the current macro block was proposed.Then based on the encode structure,the correlation between layers,and the spatial correlation,desicions for the Direct coding mode,layer mode,and adjacent mode were proposed,respectively.Finally,the macroblocks were encoded in the order predicted,with the proposed three decisions to improve on the coding speed by early termination.The experimental results show that the computational complexity of the algorithm is reduced by 68% on the average compared to that of the standard method,with only negligible coding loss and bit-rate increase.…”
Get full text

Communication-efficient distributed precoding design for Massive MIMO by Mian LI, Yang LI, Zonghui ZHANG, Qingjiang SHI

“…A communication-efficient distributed precoding scheme was proposed for multi-baseband processing unit (BBU) baseband processing architecture, aiming to reduce fronthaul data exchange and computational complexity between BBUs.Firstly, a distributed framework based on R-WMMSE algorithm was proposed, which utilized the subspace property of the optimal solution to compress the interactive data losslessly, thereby reducing data exchange.Furthermore, two learnable compression modules based on matrix multiplication were designed, using optimized computing structures and matrix parameters to reduce the parameters and computations while maintaining function expressiveness.Finally, the learnable modules and the distributed precoding framework were jointly optimized with achievable rate as the optimization objective to obtain the final model.The proposed scheme can achieve guaranteed precoding performance under lower requirements on data interaction and computational complexity…”
Get full text

Modified SLM algorithm based on cyclic shift and signal combination in MIMO-OFDM system by Wu-jun HU, Lin YANG

“…In order to reduce the computational complexity of conventional selective mapping (SLM) algorithm in multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) system，more candidate sequence sets will be produced.With different peak to average power ratio (PAPR) by time domain cyclic shift and signal combination between the antennas.The receiving part can restore the rotation signals by using the sequence selection order of the transmitting part and also the original signals by comparing the inversed rotation sequence with its nearest constellation points.The simulation results show that the proposed method can effectively reduce the PAPR of OFDM signals.In addition，compared with the conventional SLM algorithm，the proposed method can reduce the algorithm computation complexity significantly and obtain similar bit error rate (BER) performance.…”
Get full text

Fast TDOA and FDOA Estimation for Coherent Pulse Signals by Yan Liu, Fucheng Guo

“…Temporal sparsity of pulse signals makes their TDOA and FDOA estimation processes much different, and computational complexity is a major concern in this area. This paper addresses the problem of fast TDOA and FDOA estimation of pulse signals and focuses mainly on narrowband coherent pulses. …”
Get full text

Robust power and subcarrier allocation algorithm for cognitive network based on interference efficiency maximization by Yongjun XU, Yang YANG, Qilie LIU, Qianbin CHEN, Jinzhao LIN

“…For the cognitive OFDMA uplink communication system,a robust power and subcarrier allocation algorithm based on maximum interference efficiency was proposed.Firstly,considering primary user interference constraint,secondary user transmit power constraint,subcarrier allocation constraint and secondary user minimum rate constraint,a robust resource optimization model based on outage probability was established.Then,by using Bernstein approximation and Dinkelbach’s method,the original non-convex problem based on outage probability was transformed into an equivalent convex optimization one,and the analytical solution was obtained by Lagrangian dual function method.Meanwhile,the computational complexity and robust sensitivity of the algorithm were analyzed.The simulation results show that the proposed algorithm has better interference efficiency and robustness.…”
Get full text

Intrusion Detection Model for Wireless Sensor Networks Based on FedAvg and XGBoost Algorithm by Hongjiao Wu

“…It is also compared with other algorithms to demonstrate the high detection rate and low computational complexity of this algorithm.…”
Get full text

Study of a new fast adaptive filtering algorithm by WANG Zhen-li, ZHANG Xiong-wei, YANG Ji-bin, CHEN Gong

“…However, its computational complexity was comparable to that of NLMS algorithm. …”
Get full text

Cooperative transmission design combining network coding and superposition coding by Hai-rong WANG, Yong-ming HUANG, Lv-xi YANG

“…A joint network coding (NC) and superposition coding scheme was proposed to realize a cooperative transmission.The use of NC was able to improve spectral efficiency over classical decode and forward relaying strategy by relaxing the orthogonality constraint between different data streams and mitigating the resultant interference through precoding.In contrast to using the CSI based beamforming scheme which could achieve near optimal performance but involves huge computational complexity,designing the beamforming vector using the form of superposition coding was proposed,such that CSI at the transmitters were not required and the involved computation was greatly reduced.The theoretical analysis and simulation results reveal that the proposed scheme shows performances close to the near-optimal CSIT based scheme.…”
Get full text