-
181
Iterative multistage adaptive Rake receiver for CDMA wireless system
Published 2005-01-01“…The proposed system gives a reduced computational complexity compared to an AV system with similar performance. …”
Get full text
Article -
182
De-noising method of pulse signal based on double-tree complex wavelet transform and morphological filtering
Published 2016-12-01“…With the advantage of simple construction, clear mathematical implications and low computational complexity, this method overcame the shift sensitive and the frequency aliasing in the discrete wavelet transform. …”
Get full text
Article -
183
Intelligent detection method on network malicious traffic based on sample enhancement
Published 2020-06-01“…To address the problem that the existing methods of network traffic anomaly detection not only need a large number of training sets,but also have poor generalization ability,an intelligent detection method on network malicious traffic based on sample enhancement was proposed.The key words were extracted from the training set and the sample of the training set was enhanced based on the strategy of key word avoidance,and the ability for the method to extract the text features from the training set was improved.The experimental results show that,the accuracy of network traffic anomaly detection model and cross dataset can be significantly improved by small training set.Compared with other methods,the proposed method can reduce the computational complexity and achieve better detection ability.…”
Get full text
Article -
184
BP neural network based Doppler frequency offset estimation method for 5G high-speed mobile system
Published 2020-04-01“…A BP neural network based Doppler frequency offset estimation method was proposed.The proposed method was mainly divided into two stages:offline training and online estimation.Firstly,the training samples were constructed by using random Doppler frequency offset and received pilot signals,and then the training samples were used to train the BP neural network offline,which could complete the mapping relationship between input and output data.Then,based on the trained network,the received pilot signal was used to estimate the Doppler frequency offset online.Simulation results show that the performance of the proposed method is far superior to the existing method,and it has low computational complexity.…”
Get full text
Article -
185
Fuzzy-Approximation-Based Novel Back-Stepping Control of Flexible Air-Breathing Hypersonic Vehicles with Nonaffine Models
Published 2019-01-01“…For the unknown functions and uncertainties in each subsystem, fuzzy approximators are used to approximate the total uncertainties, and norm estimation approach is introduced to reduce the computational complexity of the algorithm. Aiming at the saturation problem of actuator, a saturation auxiliary system is designed to transform the original control problem with input constraints into a new control problem without input constraints. …”
Get full text
Article -
186
QGA-based network service extension algorithm in NFV
Published 2022-11-01“…To meet the client’s new business requirements or add additional security protection functions, the already hosted network service extension problem in the cloud network based on network function virtualization was researched.The network service extension in the cloud network was modeled as an integer linear programming, considering the impact on initial service, extended graph deployment, resource capacity and virtual network function affinity constraints, and so on.To deal with the computational complexity and dynamism of future large-scale cloud networks, a QGA-based network service extension algorithm was proposed to improve solution efficiency and solution quality through quantum parallel computing.Simulation results prove that the efficient performance of the proposed algorithm in terms of extension successful ratio and average resource costs, and the proposed algorithm has low time complexity.…”
Get full text
Article -
187
Combining Alamouti coding with V-BLAST through dynamic antenna grouping
Published 2008-01-01“…Based on the optimal detection ordering information generated in the conventional V-BLAST systems, several bits feedback information was built without any additional computational complexity and then the transmit antennas are dynamically divided into two groups: the two weakest antennas are grouped for Alamouti coding and the rest antennas operates as V-BLAST. …”
Get full text
Article -
188
Coordinated beamforming for cognitive multi-cell networks with wiretap channels
Published 2014-11-01“…Owing to the coupling among the vectors to be optimized,the problem becomes non-convex and non-linear.Accordingly,a centralized coordinated beamforming design method was proposed by constraining the leakage interference and using the semi-definite relaxation,and on the base of it,a decentralized algorithm was also proposed by decomposing the centralized design problem into a group of sub-problems on each cell’s base by using dual decomposition.Simulation results show that the proposed schemes make effective reduction in power consumption while guarantee the legal users’ secrecy rate requirement and the cognitive interference constraint.Moreover,the proposed decentralized method not only reduces the computational complexity,but also has the same performance as the centralized algorithm.…”
Get full text
Article -
189
Optimal approximation model of autocorrelation function of digital image
Published 2011-01-01“…Non-stationary stochastic signal was divided into piecewise stationary stochastic signal,and reflecting the sig-nal’s characteristics by autocorrelation function of the piecewise stationary stochastic signal.Generally,the autocorrela-tion function was the base of selecting signal base for signal representation.For expressing non-stationary stochastic sig-nal in a precise and effective way,based on the analysis of the natural characteristics of ARMA model and Markov proc-ess,a kind of multi-parameter estimation model of autocorrelation function for piecewise stationary stochastic process was proposed.The computational complexity was reduced,and the approximation effect was improved.Furthermore,the multi-parameter estimation model could also be adapted to the complex non-stationary stochastic signal,The computer simulation demonstrates that the approximation error was decreased significantly.…”
Get full text
Article -
190
Application of Intelligent Signal Reflection in the Communication Model of an Electronic Controller
Published 2022-01-01“…It combines the GAMP algorithm with machine learning, so it can achieve similar performance with much lower computational complexity than the traditional block sparse Bayesian learning algorithm. …”
Get full text
Article -
191
Related-key impossible boomerang cryptanalysis on LBlock
Published 2017-05-01“…The related-key impossible boomerang cryptanalysis and the strength of the lightweight block cipher LBlock against this method were investigated.A new attack on 22-round LBlock was presented combining impossible boomerang attacks with related-key attacks.A 15-round related-key impossible boomerang distinguisher was constructed.Based on the new distinguisher,an attack on 22-round LBlock was mounted successfully by concatenating 3-round to the beginning and 4-round to the end.The attack on 22-round LBlock required data complexity of only 2<sup>51.3</sup>plaintexts and computational complexity of about 2 <sup>71.54</sup>22-round encryptions.Compared with published cryptanalysis results on 22-round LBlock,proposed attack has great advantages on data and computational complexities.…”
Get full text
Article -
192
Research of fast decoding for longer constraint length convolutional codes
Published 2010-01-01“…Simulation results show that the proposed both methods have advantages in reducing the computational complexity and the decoding time.…”
Get full text
Article -
193
Robust resource allocation algorithm for heterogeneous wireless networkwith SWIPT
Published 2019-07-01“…To improve energy efficiency and robustness of heterogeneous wireless networks with wireless information and power transfer,the robust joint transmit power and power splitting resource allocation problem was studied.Based on mini-max probability machine and Dinkelbach method,the original NP-hard problem was transformed into a solvable convex optimization form,meanwhile a distributed dual resource allocation algorithm was proposed.Additionally,both computational complexity and robust sensitivity were analyzed.Simulation results show that the proposed algorithm can guarantee the quality of service requirements of macro cellular users and femtocell users under channel uncertainties.…”
Get full text
Article -
194
Beamforming algorithm for cognitive satellite and terrestrial network based on UAV relay
Published 2021-08-01“…Two beamforming (BF) schemes to achieve spectrum sharing by suppressing inter-system interferences in cognitive satellite and terrestrial networks were proposed, where the satellite and UAV cooperative network was used as the secondary network, while the terrestrial network was used as the primary network.Specifically, considering that only the statistical channel state information was available, a constrained optimization problem was formulated to maximize the signal-to- interference-plus-noise ratio of the secondary user under the constraints of the maximum transmit power at the UAV and the interference power of the primary user.Then, an iteration-based BF scheme was proposed to solve the constrained optimization problem.To reduce the computational complexity of the iterative algorithm, a zero-forcing based BF scheme was further proposed.Finally, computer simulations verify the correctness and effectiveness of the proposed BF schemes.…”
Get full text
Article -
195
A New Wavelet Method for Solving a Class of Nonlinear Volterra-Fredholm Integral Equations
Published 2014-01-01“…By incorporating such a modified wavelet approximation scheme into the conventional Galerkin method, the nonsingular property of the connection coefficients significantly reduces the computational complexity and achieves high precision in a very simple way. …”
Get full text
Article -
196
Dynamic spectrum allocation based on one-band multi-winner auction
Published 2012-02-01“…In order to improve the effectiveness of traditional auction in DSA (dynamic spectrum allocation) issue in cognitive radio networks,a new dynamic spectrum allocation algorithm based on one-band multi-winner auction was proposed.Compared with the original greedy algorithm,the new algorithm can achieve better spectrum allocation solutions with lower computational complexity by introducing the multiple greedy strategy.It increases the seller's revenue by improving the VCG (vickery-clarke-groves) mechanism,while retaining the dominant strategy incentive compatible property.In addition,it suppresses the occurrence of collusion effectively.Simulation results show that the algorithm proposed can get spectrum allocation efficiency close to the optimal solution and increase the auction revenue significantly.…”
Get full text
Article -
197
Simple power analysis attack against cryptosystems based on Montgomery algorithm
Published 2013-08-01“…The Montgomery algorithm is widely used to reduce the computational complexity of large integer modular exponentiation. …”
Get full text
Article -
198
A novel deep learning based time-varying channel prediction method
Published 2021-01-01“…For high-speed mobile orthogonal frequency division multiplexing (OFDM) systems, a novel time-varying channel prediction method based on deep learning was proposed.To avoid the influence caused by random initialization of network parameters, the proposed method firstly obtains an ideal channel estimation based on data and pilot, and then pre-trains the back propagation (BP) neural network based on the channel estimation to obtain the ideal network initial parameters.Then, based on the initial network value obtained by pre-training, the proposed method uses the channel estimation based on pilot to train the BP neural network again.Finally, the proposed method realizes the single-time-and multi-time prediction of time-varying channels through on-line prediction.Simulation results show that the proposed method can significantly improve the prediction accuracy of time-varying channels and has a low computational complexity.…”
Get full text
Article -
199
Stochastic step-wise feature selection for Exponential Random Graph Models (ERGMs).
Published 2024-01-01“…Addressing critical challenges such as ERGM degeneracy and computational complexity, our method integrates a systematic step-wise feature selection process. …”
Get full text
Article -
200
Optimization method for attribute-based cryptographic access control in mobile cloud computing
Published 2018-07-01“…For the problem of secure data sharing and access control in mobile cloud,the drawback of traditional cryptographic access control schemes was deeply analyzed.Considering the truth that mobile devices were usually equipped with limited resources,an optimized attribute-based cryptographic access control scheme was proposed in this study.In the proposed scheme,a third party proxy was introduced into the system model,and the two-layer encryption method was applied.Combining traditional attribute-based encryption (ABE) algorithm with multi-secret sharing and split measurement of ABE encryption,the scheme could greatly reduce the cost of mobile users in terms of data publish and access management.Theoretical and experimental analysis shows that the contribution can well meet the requirements of mobile cloud in terms of security,computational complexity and communication cost,which means that it is promising for future applications.…”
Get full text
Article