Optimization of jamming formation of USV offboard active decoy clusters based on an improved PSO algorithm

Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources.

Research on Defect Detection of Wind Turbine Blades Based on Morphology and Improved Otsu Algorithm Using Infrared Images

To address the issues of low accuracy and high false positive rate in traditional Otsu algorithm for defect detection on infrared images of wind turbine blades(WTB),this paper proposes a technique that combines morphological image enhancement with an improved Otsu algorithm.First,mathematical morphology’s differential multi-scale white and black top-hat operations are applied to enhance the image.The algorithm employs entropy as the objective function to guide the iteration process of image enhancement,selecting appropriate structural element scales to execute differential multi-scale white and black top-hat transformations,effectively enhancing the detail features of defect regions and improving the contrast between defects and background.Afterwards,grayscale inversion is performed on the enhanced infrared defect image to better adapt to the improved Otsu algorithm.Finally,by introducing a parameter K to adjust the calculation of inter-class variance in the Otsu method,the weight of the target pixels is increased.Combined with the adaptive iterative threshold algorithm,the threshold selection process is further fine-tuned.Experimental results show that compared to traditional Otsu algorithms and other improvements,the proposed method has significant advantages in terms of defect detection accuracy and reducing false positive rates.The average defect detection rate approaches 1,and the average Hausdorff distance decreases to 0.825,indicating strong robustness and accuracy of the method.

Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm

Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.

An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time

Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario.In this study,we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem(TSP)with life-strength constraints.To address this problem,we proposed an improved iterated greedy(IIG)algorithm.First,a push-forward insertion heuristic(PFIH)strategy was employed to generate a high-quality initial solution.Second,a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ability.Furthermore,three problem-specific swap operators were developed to improve the algorithm’s exploitation ability.Additionally,an improved simulated annealing(SA)strategy was used as an acceptance criterion to effectively prevent the algorithm from falling into local optima.To verify the effectiveness of the proposed algorithm,the Solomon dataset was extended to generate 27 instances for simulation.Finally,the proposed IIG was compared with five state-of-the-art algorithms.The parameter analysiswas conducted using the design of experiments(DOE)Taguchi method,and the effectiveness analysis of each component has been verified one by one.Simulation results indicate that IIGoutperforms the compared algorithms in terms of the number of rescue survivors and convergence speed,proving the effectiveness of the proposed algorithm.

Image encryption algorithm based on multiple chaotic systems and improved Joseph block scrambling

With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and protect intellectual property rights,this study proposes an innovative color image encryption algorithm.Initially,the Mersenne Twister algorithm is utilized to generate high-quality pseudo-random numbers,establishing a robust basis for subsequent operations.Subsequently,two distinct chaotic systems,the autonomous non-Hamiltonian chaotic system and the tentlogistic-cosine chaotic mapping,are employed to produce chaotic random sequences.These chaotic sequences are used to control the encoding and decoding process of the DNA,effectively scrambling the image pixels.Furthermore,the complexity of the encryption process is enhanced through improved Joseph block scrambling.Thorough experimental verification,research,and analysis,the average value of the information entropy test data reaches as high as 7.999.Additionally,the average value of the number of pixels change rate(NPCR)test data is 99.6101%,which closely approaches the ideal value of 99.6094%.This algorithm not only guarantees image quality but also substantially raises the difficulty of decryption.

Hybrid Gene Selection Methods for High-Dimensional Lung Cancer Data Using Improved Arithmetic Optimization Algorithm

Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression microarrays have made it possible to find genetic biomarkers for cancer diagnosis and prediction in a high-throughput manner.Machine Learning(ML)has been widely used to diagnose and classify lung cancer where the performance of ML methods is evaluated to identify the appropriate technique.Identifying and selecting the gene expression patterns can help in lung cancer diagnoses and classification.Normally,microarrays include several genes and may cause confusion or false prediction.Therefore,the Arithmetic Optimization Algorithm(AOA)is used to identify the optimal gene subset to reduce the number of selected genes.Which can allow the classifiers to yield the best performance for lung cancer classification.In addition,we proposed a modified version of AOA which can work effectively on the high dimensional dataset.In the modified AOA,the features are ranked by their weights and are used to initialize the AOA population.The exploitation process of AOA is then enhanced by developing a local search algorithm based on two neighborhood strategies.Finally,the efficiency of the proposed methods was evaluated on gene expression datasets related to Lung cancer using stratified 4-fold cross-validation.The method’s efficacy in selecting the optimal gene subset is underscored by its ability to maintain feature proportions between 10%to 25%.Moreover,the approach significantly enhances lung cancer prediction accuracy.For instance,Lung_Harvard1 achieved an accuracy of 97.5%,Lung_Harvard2 and Lung_Michigan datasets both achieved 100%,Lung_Adenocarcinoma obtained an accuracy of 88.2%,and Lung_Ontario achieved an accuracy of 87.5%.In conclusion,the results indicate the potential promise of the proposed modified AOA approach in classifying microarray cancer data.

Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm

The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.

An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

Prediction Model of Wax Deposition Rate in Waxy Crude Oil Pipelines by Elman Neural Network Based on Improved Reptile Search Algorithm

A hard problem that hinders the movement of waxy crude oil is wax deposition in oil pipelines.To ensure the safe operation of crude oil pipelines,an accurate model must be developed to predict the rate of wax deposition in crude oil pipelines.Aiming at the shortcomings of the ENN prediction model,which easily falls into the local minimum value and weak generalization ability in the implementation process,an optimized ENN prediction model based on the IRSA is proposed.The validity of the new model was confirmed by the accurate prediction of two sets of experimental data on wax deposition in crude oil pipelines.The two groups of crude oil wax deposition rate case prediction results showed that the average absolute percentage errors of IRSA-ENN prediction models is 0.5476% and 0.7831%,respectively.Additionally,it shows a higher prediction accuracy compared to the ENN prediction model.In fact,the new model established by using the IRSA to optimize ENN can optimize the initial weights and thresholds in the prediction process,which can overcome the shortcomings of the ENN prediction model,such as weak generalization ability and tendency to fall into the local minimum value,so that it has the advantages of strong implementation and high prediction accuracy.

Improved IChOA-Based Reinforcement Learning for Secrecy Rate Optimization in Smart Grid Communications

In the evolving landscape of the smart grid(SG),the integration of non-organic multiple access(NOMA)technology has emerged as a pivotal strategy for enhancing spectral efficiency and energy management.However,the open nature of wireless channels in SG raises significant concerns regarding the confidentiality of critical control messages,especially when broadcasted from a neighborhood gateway(NG)to smart meters(SMs).This paper introduces a novel approach based on reinforcement learning(RL)to fortify the performance of secrecy.Motivated by the need for efficient and effective training of the fully connected layers in the RL network,we employ an improved chimp optimization algorithm(IChOA)to update the parameters of the RL.By integrating the IChOA into the training process,the RL agent is expected to learn more robust policies faster and with better convergence properties compared to standard optimization algorithms.This can lead to improved performance in complex SG environments,where the agent must make decisions that enhance the security and efficiency of the network.We compared the performance of our proposed method(IChOA-RL)with several state-of-the-art machine learning(ML)algorithms,including recurrent neural network(RNN),long short-term memory(LSTM),K-nearest neighbors(KNN),support vector machine(SVM),improved crow search algorithm(I-CSA),and grey wolf optimizer(GWO).Extensive simulations demonstrate the efficacy of our approach compared to the related works,showcasing significant improvements in secrecy capacity rates under various network conditions.The proposed IChOA-RL exhibits superior performance compared to other algorithms in various aspects,including the scalability of the NOMA communication system,accuracy,coefficient of determination(R2),root mean square error(RMSE),and convergence trend.For our dataset,the IChOA-RL architecture achieved coefficient of determination of 95.77%and accuracy of 97.41%in validation dataset.This was accompanied by the lowest RMSE(0.95),indicating very precise predictions with minimal error.

Path Planning of Multi-Axis Robotic Arm Based on Improved RRT*

An improved RRT∗algorithm,referred to as the AGP-RRT∗algorithm,is proposed to address the problems of poor directionality,long generated paths,and slow convergence speed in multi-axis robotic arm path planning.First,an adaptive biased probabilistic sampling strategy is adopted to dynamically adjust the target deviation threshold and optimize the selection of random sampling points and the direction of generating new nodes in order to reduce the search space and improve the search efficiency.Second,a gravitationally adjustable step size strategy is used to guide the search process and dynamically adjust the step-size to accelerate the search speed of the algorithm.Finally,the planning path is processed by pruning,removing redundant points and path smoothing fitting using cubic B-spline curves to improve the flexibility of the robotic arm.Through the six-axis robotic arm path planning simulation experiments on the MATLAB platform,the results show that the AGP-RRT∗algorithm reduces 87.34%in terms of the average running time and 40.39%in terms of the average path cost;Meanwhile,under two sets of complex environments A and B,the average running time of the AGP-RRT∗algorithm is shortened by 94.56%vs.95.37%,and the average path cost is reduced by 55.28%vs.47.82%,which proves the effectiveness of the AGP-RRT∗algorithm in improving the efficiency of multi-axis robotic arm path planning.

Improved Ant Colony Algorithm for Vehicle Scheduling Problem in Airport Ground Service Support

Support vehicles are part of the main body of airport ground operations,and their scheduling efficiency directly impacts flight delays.A mathematical model is constructed and the responsiveness of support vehicles for current operational demands is proposed to study optimization algorithms for vehicle scheduling.The model is based on the constraint relationship of the initial operation time,time window,and gate position distribution,which gives an improvement to the ant colony algorithm(ACO).The impacts of the improved ACO as used for support vehicle optimization are compared and analyzed.The results show that the scheduling scheme of refueling trucks based on the improved ACO can reduce flight delays caused by refueling operations by 56.87%,indicating the improved ACO can improve support vehicle scheduling.Besides,the improved ACO can jump out of local optima,which can balance the working time of refueling trucks.This research optimizes the scheduling scheme of support vehicles under the existing conditions of airports,which has practical significance to fully utilize ground service resources,improve the efficiency of airport ground operations,and effectively reduce flight delays caused by ground service support.

Estimation of state of health based on charging characteristics and back-propagation neural networks with improved atom search optimization algorithm

With the rapid development of new energy technologies, lithium batteries are widely used in the field of energy storage systems and electric vehicles. The accurate prediction for the state of health(SOH) has an important role in maintaining a safe and stable operation of lithium-ion batteries. To address the problems of uncertain battery discharge conditions and low SOH estimation accuracy in practical applications, this paper proposes a SOH estimation method based on constant-current battery charging section characteristics with a back-propagation neural network with an improved atom search optimization algorithm. A temperature characteristic, equal-time temperature variation(Dt_DT), is proposed by analyzing the temperature data of the battery charging section with the incremental capacity(IC) characteristics obtained from an IC analysis as an input to the data-driven prediction model. Testing and analysis of the proposed prediction model are carried out using publicly available datasets. Experimental results show that the maximum error of SOH estimation results for the proposed method in this paper is below 1.5%.

Structural plane recognition from three-dimensional laser scanning points using an improved region-growing algorithm based on the robust randomized Hough transform

The staggered distribution of joints and fissures in space constitutes the weak part of any rock mass.The identification of rock mass structural planes and the extraction of characteristic parameters are the basis of rock-mass integrity evaluation,which is very important for analysis of slope stability.The laser scanning technique can be used to acquire the coordinate information pertaining to each point of the structural plane,but large amount of point cloud data,uneven density distribution,and noise point interference make the identification efficiency and accuracy of different types of structural planes limited by point cloud data analysis technology.A new point cloud identification and segmentation algorithm for rock mass structural surfaces is proposed.Based on the distribution states of the original point cloud in different neighborhoods in space,the point clouds are characterized by multi-dimensional eigenvalues and calculated by the robust randomized Hough transform(RRHT).The normal vector difference and the final eigenvalue are proposed for characteristic distinction,and the identification of rock mass structural surfaces is completed through regional growth,which strengthens the difference expression of point clouds.In addition,nearest Voxel downsampling is also introduced in the RRHT calculation,which further reduces the number of sources of neighborhood noises,thereby improving the accuracy and stability of the calculation.The advantages of the method have been verified by laboratory models.The results showed that the proposed method can better achieve the segmentation and statistics of structural planes with interfaces and sharp boundaries.The method works well in the identification of joints,fissures,and other structural planes on Mangshezhai slope in the Three Gorges Reservoir area,China.It can provide a stable and effective technique for the identification and segmentation of rock mass structural planes,which is beneficial in engineering practice.

Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map

Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.

Research on AGV task path planning based on improved A^(*) algorithm

Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.

Improved Bat Algorithm with Deep Learning-Based Biomedical ECG Signal Classification Model

With new developments experienced in Internet of Things(IoT),wearable,and sensing technology,the value of healthcare services has enhanced.This evolution has brought significant changes from conventional medicine-based healthcare to real-time observation-based healthcare.Biomedical Electrocardiogram(ECG)signals are generally utilized in examination and diagnosis of Cardiovascular Diseases(CVDs)since it is quick and non-invasive in nature.Due to increasing number of patients in recent years,the classifier efficiency gets reduced due to high variances observed in ECG signal patterns obtained from patients.In such scenario computer-assisted automated diagnostic tools are important for classification of ECG signals.The current study devises an Improved Bat Algorithm with Deep Learning Based Biomedical ECGSignal Classification(IBADL-BECGC)approach.To accomplish this,the proposed IBADL-BECGC model initially pre-processes the input signals.Besides,IBADL-BECGC model applies NasNet model to derive the features from test ECG signals.In addition,Improved Bat Algorithm(IBA)is employed to optimally fine-tune the hyperparameters related to NasNet approach.Finally,Extreme Learning Machine(ELM)classification algorithm is executed to perform ECG classification method.The presented IBADL-BECGC model was experimentally validated utilizing benchmark dataset.The comparison study outcomes established the improved performance of IBADL-BECGC model over other existing methodologies since the former achieved a maximum accuracy of 97.49%.

Angular insensitive nonreciprocal ultrawide band absorption in plasma-embedded photonic crystals designed with improved particle swarm optimization algorithm

Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded photonic crystals arranged in a structure composed of periodic and quasi-periodic sequences on a normalized scale.The effective dielectric function,which determines the absorption of the plasma,is subject to the basic parameters of the plasma,causing the absorption of the proposed absorber to be easily modulated by these parameters.Compared with other quasi-periodic sequences,the Octonacci sequence is superior both in relative bandwidth and absolute bandwidth.Under further optimization using IPSO with 14 parameters set to be optimized,the absorption characteristics of the proposed structure with different numbers of layers of the smallest structure unit N are shown and discussed.IPSO is also used to address angular insensitive nonreciprocal ultrawide bandwidth absorption,and the optimized result shows excellent unidirectional absorbability and angular insensitivity of the proposed structure.The impacts of the sequence number of quasi-periodic sequence M and collision frequency of plasma1ν1 to absorption in the angle domain and frequency domain are investigated.Additionally,the impedance match theory and the interference field theory are introduced to express the findings of the algorithm.

A dynamic fusion path planning algorithm for mobile robots incorporating improved IB-RRT∗and deep reinforcement learning

Dynamic path planning is crucial for mobile robots to navigate successfully in unstructured envi-ronments.To achieve globally optimal path and real-time dynamic obstacle avoidance during the movement,a dynamic path planning algorithm incorporating improved IB-RRT∗and deep reinforce-ment learning(DRL)is proposed.Firstly,an improved IB-RRT∗algorithm is proposed for global path planning by combining double elliptic subset sampling and probabilistic central circle target bi-as.Then,to tackle the slow response to dynamic obstacles and inadequate obstacle avoidance of tra-ditional local path planning algorithms,deep reinforcement learning is utilized to predict the move-ment trend of dynamic obstacles,leading to a dynamic fusion path planning.Finally,the simulation and experiment results demonstrate that the proposed improved IB-RRT∗algorithm has higher con-vergence speed and search efficiency compared with traditional Bi-RRT∗,Informed-RRT∗,and IB-RRT∗algorithms.Furthermore,the proposed fusion algorithm can effectively perform real-time obsta-cle avoidance and navigation tasks for mobile robots in unstructured environments.

Improved parallel weighted bit-flipping algorithm

An improved parallel weighted bit-flipping（PWBF） algorithm is presented. To accelerate the information exchanges between check nodes and variable nodes, the bit-flipping step and the check node updating step of the original algorithm are parallelized. The simulation experiments demonstrate that the improved PWBF algorithm provides about 0. 1 to 0. 3 dB coding gain over the original PWBF algorithm. And the improved algorithm achieves a higher convergence rate. The choice of the threshold is also discussed, which is used to determine whether a bit should be flipped during each iteration. The appropriate threshold can ensure that most error bits be flipped, and keep the right ones untouched at the same time. The improvement is particularly effective for decoding quasi-cyclic low-density paritycheck（QC-LDPC） codes.