Predictive channel scheduling algorithm between macro base station and micro base station group by Yinghai XIE, Ruohe YAO, Bin WU

“…A novel predictive channel scheduling algorithm was proposed for non-real-time traffic transmission between macro-base stations and micro-base stations in 5G ultra-cellular networks.First,based on the stochastic stationary process characteristics of wireless channels between stationary communication agents,a discrete channel state probability space was established for the scheduling process from the perspective of classical probability theory,and the event domain was segmented.Then,the efficient scheduling of multi-user,multi-non-real-time services was realized by probability numerical calculation of each event domain.The theoretical analysis and simulation results show that the algorithm has low computational complexity.Compared with other classical scheduling algorithms,the new algorithm can optimize traffic transmission in a longer time dimension,approximate the maximum signal-to-noise ratio algorithm in throughput performance,and increase system throughput by about 14% under heavy load.At the same time,the new algorithm is accurate.Quantitative computation achieves a self-adaption match between the expected traffic rate and the actual scheduling rate.…”
Get full text

Parallel Calculation of Random Vibration for Reentry Vehicles in Fluctuating Pressure Environment by Xuanhua Fan, Jun Liang, Keying Wang, Huan Zhou

“…The novel algorithm based on the modal superposition method reduces the computational complexity, realizes the parallel calculation, and achieves the maximum numerical simulation calculation capacity of 1.045 billion degrees of freedom (DOFs) while improving the calculation efficiency and the accuracy of the results. …”
Get full text

Joint optimization of dispersion matrix and 3D constellation for STSK system based on improved genetic algorithm by Xiaoping JIN, Jiayu LIU, Chen JIANG, Qiang GUO

“…Space-time shift keying (STSK) is a modulation scheme used in multi-input multi-output (MIMO) communication systems.It uses a pre-designed dispersion matrix set (DMS) to realize the flexible design of the system between multiplexing and diversity.An improved genetic algorithm (GA) was proposed to assist the joint optimization of DMS and 3D constellations, that is, the DMS and 3D constellations were jointly coded as the chromosome of GA , and the coding gain corresponding to the rank and determinant criterion was adopted as the overall fitness value.Through efficient selection and improved mutation and crossover strategies, DMS and 3D constellations with low bit error rate (BER) can be obtained.At the same time, the symmetry of the 3D constellation was used to greatly reduce the computational complexity of according to the fitness value the coding gain.The theoretical average paired error probability (ABEP) of the 3D STSK scheme was deducted.The simulation results show that, compared with the traditional GA and random search schemes, the improved GA proposed can significantly reduce the complexity of system implementation while ensuring BER performance.…”
Get full text

Computationally efficient direction-of-arrival estimation of non-circular signal based on subspace rotation technique by Wei WANG, Ming ZHANG, Bobin YAO, Qinye YIN, Pengcheng MU

“…In order to solve the problem that the high computational burden of the multiple signal classification algorithm of non-circular signal (NC-MUSIC) in direction-of-arrival (DOA) estimation,a novel computationally efficient DOA estimation algorithm based on subspace rotation technique was proposed.Firstly,the partitioning of noise subspace matrix and the subspace rotation technique (SRT) were used to construct a new reduced-dimension noise subspace.Then,the two-dimensional peak searching was converted to the one-dimensional peak searching on the basis of the separation of variables and the orthogonality between the new reduced-dimension noise subspace and the space spanned by the columns of the extended manifold matrix.The proposed algorithm can enhance the computational efficiency by means of the conversion of the two-dimensional peak searching into the one-dimensional peak searching and the removal of redundant computations.Theoretical analysis and simulation results show that the proposed algorithm can reduce the computational complexity to less than 5% as compared to NC-MUSIC algorithm on the premise of ensuring the accuracy of DOA estimation.Especially,the efficiency advantage of the proposed algorithm is more obvious in scenarios where the large numbers of sensors are required.…”
Get full text

Improved ESPRIT Method for Joint Direction-of-Arrival and Frequency Estimation Using Multiple-Delay Output by Wang Xudong, Xiaofei Zhang, Jianfeng Li, Jinchao Bai

“…Furthermore, the proposed algorithm can obtain automatic pairing DOA and frequency parameters, and it has a comparative computational complexity in contrast to Wang’s ESPRIT algorithm. …”
Get full text

Optimization of fuzzy linear fractional programming problem with fuzzy numbers by Sapan Das

“…This paper outfits another idea for diminishing the computational complexity, in any case without losing its viability crisp LFP problem. …”
Get full text

Reduced-Complexity Direction of Arrival Estimation Using Real-Valued Computation with Arbitrary Array Configurations by Feng-Gang Yan, Jun Wang, Shuai Liu, Yi Shen, Ming Jin

“…Numerical simulations over a wide range of scenarios are conducted to show the performance of the new technique, which demonstrates that with a significantly reduced computational complexity, the new approach is able to provide a close accuracy to the standard MUSIC.…”
Get full text

Parametric Nonlinear Model Reduction Using K-Means Clustering for Miscible Flow Simulation by Norapon Sukuntee, Saifon Chaturantabut

“…The resulting POD basis is then used with Galerkin projection to construct reduced-order systems for various parameter vectors in the given domain together with applying the discrete empirical interpolation method (DEIM) to further reduce the computational complexity in nonlinear terms of the miscible flow model. …”
Get full text

l0 Sparsity for Image Denoising with Local and Global Priors by Xiaoni Gao, Mei Yu, Jianrong Wang, Jianguo Wei

“…In addition, to make the correlations between pixels more meaningful, we adopt Principle Component Analysis to measure the similarities, which can be both propitious to reduce the computational complexity and improve the accuracies. Experiments on the benchmark image set show that the proposed approach can achieve superior performance to the state-of-the-art approaches both in accuracy and perception in removing the zero-mean additive white Gaussian noise.…”
Get full text

SAMPLING OF THE PLAN OF REPAIRS OF THE MAIN EQUIPMENT IN THE ELECTRICAL POWER SYSTEM by O. I. Alexandrov

“…The main problems that hinder mathematical modeling of decision-making concerning operational applications for the repair of the main power equipment of power system are: the need for a coherent account of a large number of limiting factors and indicators of effectiveness of the solutions; the need of information and algorithmic trade-offs with the objectives of adjacent levels of spatial, temporal and functional hierarchy; the lack of developments in the standardization of information structures that adequately reflect the process of finding solutions; the computational complexity of several restrictions of the optimization problem subject to mandatory registration.…”
Get full text

Channel Estimation Optimization Model in Internet of Things Based on MIMO/OFDM with Deep Extended Kalman Filter by Van Tinh Shi, Dong Ren Nhg

“…However, due to high computational complexity as well as inaccurate channel estimation and remaining weaknesses such as latency and other quality of service criteria, especially Bit Error Rate (BER), Signal Noise Ratio (SNR), and Maximum to Average Power Ratio (PAPR), this research improves these two methods based on the Deep Extended Kalman filter.…”
Get full text

An Automated Profile-Likelihood-Based Algorithm for Fast Computation of the Maximum Likelihood Estimate in a Statistical Model for Crash Data by Issa Cherif Geraldo

“…Even if there exist many algorithms considered as performing, they can suffer in some cases for one or many of the following criteria: global convergence (capacity of an algorithm to converge to the true unknown solution from all starting guesses), numerical stability (ascent property), implementation feasibility (for example, algorithms requiring matrix inversion cannot be implemented when the involved matrices are not invertible), low computation time, low computational complexity, and capacity to handle high dimensional problems. …”
Get full text

Off-grid DOA estimation algorithm based on unitary transform and sparse Bayesian learning by Yang GAO, Jun-li CHEN, Guang-li YANG

“…A rapid off-grid DOA estimating method of RV-OGSBL was raised based on unitary transformation,against the problem of traditional sparse Bayesian learning (SBL) algorithm in solving effectiveness of signal’s DOA estimation under condition of lower signal noise ratio (SNR).Actual received signal of uniform linear array was generated through constructing augment matrix as the processing signal used by DOA estimation.Then,estimation model was transformed from complex value to real value by using unitary transformation.In the next step,off-grid model and sparse Bayesian learning algorithm were combined together to process the realization of DOA estimation iteratively.The accuracy of estimation could made relatively high.The simulation result demonstrates that the RV-OGSBL method not only maintains the performance of traditional SBL algorithm,but also reduces the computational complexity significantly.Under the situation of lower signal noise ratio (SNR) and low number of snapshots,the running time of algorithm is reduced about 50%.This shows the RV-OGSBL method is a rapid DOA estimation algorithm.…”
Get full text

Research on throughput maximization for intelligent reflecting surface assisted dual-hop relay wireless powered communication network by Zhen YANG, Xuan FENG, Bin LYU

“…To improve the energy and information transmission efficiency of relay-based wireless powered communication network (WPCN), a two intelligent reflecting surface (IRS) assisted dual-hop relay wireless transmission scheme was proposed.In particular, IRS₁ and IRS₂ were deployed between the base station (BS) and hybrid relay node (HRN), and between the HRN and users, respectively, which could improve the efficiency of energy transfer from the HRN to users, data transmission from users to the HRN and data forwarding from HRN to BS.To maximize the system throughput, an optimization problem was formulated, where the time scheduling of energy, information transmission and forwarding, the phase shifts of IRS, and the delivered power of users were jointly optimized.To address non-convexity of the formulated problem, an efficient alternating optimization algorithm was proposed and the sub-optimal solution was obtained.In addition, the convergence and computational complexity of the proposed algorithm were analyzed.Numerical results verify that IRS can effectively improve the throughput of WPCN based on relay.In addition, compared to the benchmark schemes, the proposed optimal transmission scheme can significantly improve the system performance in terms of throughput.…”
Get full text

Improved transmit beamforming design based on ADMM for low probability of intercept of FDA-MIMO radar by Pengcheng GONG, Yuntao WU

“…Considering the low probability of intercept problem that the signal-dependent interference and the target were located in the same angle, an improved transmit beamforming design based on the alternating direction method of multipliers (ADMM) was proposed for multiple-input multiple-output with frequency diverse array radar.The transmit energy was minimized at the target under constraints of the energy at each transmitter and signal clutter-plus-noise ratio requirement.Subsequently, a cyclic algorithm was developed to tackle the non-convex design problem.Firstly, the optimal receive filter was obtained by generalized Rayleigh quotient.And then the transmit beamforming was optimized by employing auxiliary variables and ADMM to solve quadratic programming problem with fractional inequality constraint.Moreover, both the convergence and computational complexity of the proposed algorithm were discussed.Simulation results show that, compared with the semi-denite programming method, the proposed method not only attains the given antenna power, but also achieves the better mainlobe focusing performance at the target.Furthermore, the null levels at the clutter locations and the jamming directions obtained by the proposed method are -50 dB above.…”
Get full text

Intuitionistic Fuzzy Possibilistic C Means Clustering Algorithms by Arindam Chaudhuri

“…Some advantages of algorithms are simplicity, flexibility, and low computational complexity. The algorithm is evaluated through cluster validity measures. …”
Get full text

Positioning accuracy improvement in high‐speed GPS receivers using sequential extended Kalman filter by Narges Rahemi, Mohammad Reza Mosavi

“…Here, a comprehensive method is proposed to solve the accuracy issue of the single‐frequency GPS receiver at high‐speed motions without increasing the computational complexity. Suitable modelling of the GPS receivers at high‐speed motion, using the sequential extended Kalman filter, correct determination of the process noise covariance matrix and accurately estimating the variance of the observations are the basics of the proposed approach. …”
Get full text

Adaptive Differentiator-Based Predefined-Time Control for Nonlinear Systems Subject to Pure-Feedback Form and Unknown Disturbance by Man Yang, Qiang Zhang, Ke Xu, Ming Chen

“…An adaptive predefined-time controller is designed by introducing the finite-time differentiator which is used to decrease the computational complexity problem appeared in the traditional backstepping control. …”
Get full text

Recognition algorithm of non punctured polarization codes based on structural characteristics of coding matrix by Yao WANG, Xiang WANG, Guodong YANG, Zhitao HUANG

“…In order to solve the problems of complexity and poor error adaptability in the blind recognition of standard non-punctured polarization codes, the theorems and propositions that could characterize the relationship between the code length and code rate, and distinguish information subchannel and frozen subchannel were proved.Based on the theorem and proposition, an efficient blind recognition algorithm was proposed.The proposed algorithm only needed to set the possible maximum code length, and the corresponding soft decision codewords matrixes and Kronecker matrixes were constructed.Based on the theorem and proposition proved, the check relationship between the two matrices was judged and the code rate and frozen bit position were estimated.The average likelihood difference was introduced as the test quantity, and the decision threshold was determined based on its theoretical probability distribution and minimax criterion.The simulation results show that the deduced theorem and propositions are consistent with the simulation results.Under the signal-to-noise ratio of 6 dB and code length of 1 024, the parameter recognition rate is still close to 100%.The recognition performance and computational complexity are better than the existing soft decision algorithms.…”
Get full text

Performance Analysis of MIMO-STBC Systems with Higher Coding Rate Using Adaptive Semiblind Channel Estimation Scheme by Ravi Kumar, Rajiv Saxena

“…Semiblind channel estimation method provides the best trade-off in terms of bandwidth overhead, computational complexity and latency. The result after using multiple input multiple output (MIMO) systems shows higher data rate and longer transmit range without any requirement for additional bandwidth or transmit power. …”
Get full text