Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant ...Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltage...Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.展开更多
A proximal iterative algorithm for the mulitivalue operator equation 0 ∈ T(x) is presented, where T is a maximal monotone operator. It is an improvement of the proximal point algorithm as well know. The convergence o...A proximal iterative algorithm for the mulitivalue operator equation 0 ∈ T(x) is presented, where T is a maximal monotone operator. It is an improvement of the proximal point algorithm as well know. The convergence of the algorithm is discussed and all example is given.展开更多
The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterat...The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model（DDM） is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU（graphic processing unit） platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction.展开更多
Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubit...Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O（n） messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm.展开更多
The problem of potential field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regula...The problem of potential field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regularized method is one of the best algorithms. But there is a shortcoming in application with the regularized method, viz. the optimum regularized parameter must be determined by experience, so it is difficulty to obtain an optimum solution. In this paper, an iterative algorithm for solving any system of linear equations is discussed, and a sufficient and necessary condition of the algorithm convergence is presented and proved. The algorithm is convergent for any starting point, and the optimum solution can be obtained, in particular, there is no need to calculate the inverse matrix in the algorithm. The typical practical example shows the iterative algorithm is simple and practicable, and the inversion effect is better than that of regularized method.展开更多
Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N）...Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.展开更多
Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check （LDPC） decoding over an additive white Gaussian noise （AWGN） channel, where th...Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check （LDPC） decoding over an additive white Gaussian noise （AWGN） channel, where the newly updated extrinsic information is immediately used in the current decoding round. Theoretical analysis and simulation results demonstrate that both the modified approaches provide significant performance improvements over the traditional BP algorithm with almost no additional decoding complexity. The proposed algorithm with modified horizontal process offers even better performance than another algorithm with the modified horizontal process. The two modified BP algorithms are very promising in practical communications since both can achieve an excellent trade-off between the performance and decoding complexity.展开更多
In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach space.Moreover,we show that the sequence defined...In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach space.Moreover,we show that the sequence defined by the iterative method converges strongly to a common element of the set of fixed points,which is the unique solution of the variational inequality<(λφ−νF)z,jq(z−z)>≤0,for z∈⋂_(i=1)^(∞)Γ(S_(i)).The results introduced in our work extend to some corresponding theorems.展开更多
为设计高效稳定的演化算法,将方程求根的不动点迭代思想引入到优化领域,通过将演化算法的寻优过程看作为在迭代框架下方程不动点的逐步显示化过程,设计出一种基于数学模型的演化新算法,即不动点演化算法(fixed point evolution algorith...为设计高效稳定的演化算法,将方程求根的不动点迭代思想引入到优化领域,通过将演化算法的寻优过程看作为在迭代框架下方程不动点的逐步显示化过程,设计出一种基于数学模型的演化新算法,即不动点演化算法(fixed point evolution algorithm,FPEA).该算法的繁殖算子是由Aitken加速的不动点迭代模型导出的二次多项式,其整体框架继承传统演化算法(如差分演化算法)基于种群的迭代模式.试验结果表明:在基准函数集CEC2014、CEC2019上,本文算法的最优值平均排名在所有比较算法中排名第1;在4个工程约束设计问题上,FPEA与CSA、GPE等多个算法相比,能以较少的计算开销获得最高的求解精度.展开更多
Aim To discuss the basic CORDIC algorithm that can be applied to digital signal processing and its applying condition called convergence range.Methods In addition to the original basic equation, another group iterativ...Aim To discuss the basic CORDIC algorithm that can be applied to digital signal processing and its applying condition called convergence range.Methods In addition to the original basic equation, another group iterative equation was used to evaluate the correspondent values of input data that did not lie within the convergence range. Results and Conclusion The improved CORDIC algorithm removes the limits of the range of convergence and can adapt itself to the variations of input values. The correctness of improved CORDIC algorithms has been proved by calculating examples.展开更多
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62025110 and 62101308).
文摘Satellite Internet(SI)provides broadband access as a critical information infrastructure in 6G.However,with the integration of the terrestrial Internet,the influx of massive terrestrial traffic will bring significant threats to SI,among which DDoS attack will intensify the erosion of limited bandwidth resources.Therefore,this paper proposes a DDoS attack tracking scheme using a multi-round iterative Viterbi algorithm to achieve high-accuracy attack path reconstruction and fast internal source locking,protecting SI from the source.Firstly,to reduce communication overhead,the logarithmic representation of the traffic volume is added to the digests after modeling SI,generating the lightweight deviation degree to construct the observation probability matrix for the Viterbi algorithm.Secondly,the path node matrix is expanded to multi-index matrices in the Viterbi algorithm to store index information for all probability values,deriving the path with non-repeatability and maximum probability.Finally,multiple rounds of iterative Viterbi tracking are performed locally to track DDoS attack based on trimming tracking results.Simulation and experimental results show that the scheme can achieve 96.8%tracking accuracy of external and internal DDoS attack at 2.5 seconds,with the communication overhead at 268KB/s,effectively protecting the limited bandwidth resources of SI.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
基金supported by the National Key Scientific and Research Equipment Development Project of China(Grant No.ZDYZ2013-2)the National Natural Science Foundation of China(Grant No.11173008)the Sichuan Provincial Outstanding Youth Academic Technology Leaders Program,China(Grant No.2012JQ0012)
文摘Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ～ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ～(O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits.
基金Supported by the National Natural Science Foundation of China
文摘A proximal iterative algorithm for the mulitivalue operator equation 0 ∈ T(x) is presented, where T is a maximal monotone operator. It is an improvement of the proximal point algorithm as well know. The convergence of the algorithm is discussed and all example is given.
基金supported by the National High Technology Research and Development Program of China(Grant No.2012AA011603)the National Natural Science Foundation of China(Grant No.61372172)
文摘The projection matrix model is used to describe the physical relationship between reconstructed object and projection.Such a model has a strong influence on projection and backprojection,two vital operations in iterative computed tomographic reconstruction.The distance-driven model（DDM） is a state-of-the-art technology that simulates forward and back projections.This model has a low computational complexity and a relatively high spatial resolution;however,it includes only a few methods in a parallel operation with a matched model scheme.This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations.Our proposed model has been implemented on a GPU（graphic processing unit） platform and has achieved satisfactory computational efficiency with no approximation.The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop,respectively,with an image size of 256×256×256 and 360 projections with a size of 512×512.We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation.The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 11147174 and 61068001)the Talent Program of Yanbian University,China (Grant No. 950010001)
文摘Clock synchronization is a well-studied problem with many practical and scientific applications.We propose an arbitrary accuracy iterative quantum algorithm for distributed clock synchronization using only three qubits.The n bits of the time difference between two spatially separated clocks can be deterministically extracted by communicating only O（n） messages and executing the quantum iteration process n times based on the classical feedback and measurement operations.Finally,we also give the algorithm using only two qubits and discuss the success probability of the algorithm.
基金the work is supported by scientific and technological fund of CNPC
文摘The problem of potential field inversion can be become that of solving system of linear equations by using of linear processing. There are a lot of algorithms for solving any system of linear equations, and the regularized method is one of the best algorithms. But there is a shortcoming in application with the regularized method, viz. the optimum regularized parameter must be determined by experience, so it is difficulty to obtain an optimum solution. In this paper, an iterative algorithm for solving any system of linear equations is discussed, and a sufficient and necessary condition of the algorithm convergence is presented and proved. The algorithm is convergent for any starting point, and the optimum solution can be obtained, in particular, there is no need to calculate the inverse matrix in the algorithm. The typical practical example shows the iterative algorithm is simple and practicable, and the inversion effect is better than that of regularized method.
文摘Vector quantization （VQ） is an important data compression method. The key of the encoding of VQ is to find the closest vector among N vectors for a feature vector. Many classical linear search algorithms take O（N） steps of distance computing between two vectors. The quantum VQ iteration and corresponding quantum VQ encoding algorithm that takes O（√N） steps are presented in this paper. The unitary operation of distance computing can be performed on a number of vectors simultaneously because the quantum state exists in a superposition of states. The quantum VQ iteration comprises three oracles, by contrast many quantum algorithms have only one oracle, such as Shor＇s factorization algorithm and Grover＇s algorithm. Entanglement state is generated and used, by contrast the state in Grover＇s algorithm is not an entanglement state. The quantum VQ iteration is a rotation over subspace, by contrast the Grover iteration is a rotation over global space. The quantum VQ iteration extends the Grover iteration to the more complex search that requires more oracles. The method of the quantum VQ iteration is universal.
基金National Mobile Communication Research Laboratory,Southeast University(No.W200704),ChinaNatural Science foundation of Jiangsu Province (No.BK2006188),ChinaQuebec-China Joint Research Foundation by McGill University,Montreal,Quebec,Canada
文摘Two modified BP algorithms related to vertical and horizontal processes are proposed to accelerate iterative low-density parity- check （LDPC） decoding over an additive white Gaussian noise （AWGN） channel, where the newly updated extrinsic information is immediately used in the current decoding round. Theoretical analysis and simulation results demonstrate that both the modified approaches provide significant performance improvements over the traditional BP algorithm with almost no additional decoding complexity. The proposed algorithm with modified horizontal process offers even better performance than another algorithm with the modified horizontal process. The two modified BP algorithms are very promising in practical communications since both can achieve an excellent trade-off between the performance and decoding complexity.
基金supported by the National Natural Science Foundation of China(12001416,11771347 and 12031003)the Natural Science Foundations of Shaanxi Province(2021JQ-678).
文摘In this paper,we introduce a general hybrid iterative method to find an infinite family of strict pseudo-contractions in a q-uniformly smooth and strictly convex Banach space.Moreover,we show that the sequence defined by the iterative method converges strongly to a common element of the set of fixed points,which is the unique solution of the variational inequality<(λφ−νF)z,jq(z−z)>≤0,for z∈⋂_(i=1)^(∞)Γ(S_(i)).The results introduced in our work extend to some corresponding theorems.
文摘为设计高效稳定的演化算法,将方程求根的不动点迭代思想引入到优化领域,通过将演化算法的寻优过程看作为在迭代框架下方程不动点的逐步显示化过程,设计出一种基于数学模型的演化新算法,即不动点演化算法(fixed point evolution algorithm,FPEA).该算法的繁殖算子是由Aitken加速的不动点迭代模型导出的二次多项式,其整体框架继承传统演化算法(如差分演化算法)基于种群的迭代模式.试验结果表明:在基准函数集CEC2014、CEC2019上,本文算法的最优值平均排名在所有比较算法中排名第1;在4个工程约束设计问题上,FPEA与CSA、GPE等多个算法相比,能以较少的计算开销获得最高的求解精度.
文摘Aim To discuss the basic CORDIC algorithm that can be applied to digital signal processing and its applying condition called convergence range.Methods In addition to the original basic equation, another group iterative equation was used to evaluate the correspondent values of input data that did not lie within the convergence range. Results and Conclusion The improved CORDIC algorithm removes the limits of the range of convergence and can adapt itself to the variations of input values. The correctness of improved CORDIC algorithms has been proved by calculating examples.
