This paper presents a modified Root-MUSIC algorithm by which the signal DOA estimation performance can be improved when the snapshot number is limited. The operation principlesof this algorithm are described in detail...This paper presents a modified Root-MUSIC algorithm by which the signal DOA estimation performance can be improved when the snapshot number is limited. The operation principlesof this algorithm are described in detail. It is also pointed out theoretically that this is equivalentto have increased the snapshot number and can make the DOA estimation better. Finally, somesimulating results to verify the theoretical analyses are presented.展开更多
For the unforced dynamical non-linear state–space model,a new Q1 and efficient square root extended kernel recursive least square estimation algorithm is developed in this article.The proposed algorithm lends itself ...For the unforced dynamical non-linear state–space model,a new Q1 and efficient square root extended kernel recursive least square estimation algorithm is developed in this article.The proposed algorithm lends itself towards the parallel implementation as in the FPGA systems.With the help of an ortho-normal triangularization method,which relies on numerically stable givens rotation,matrix inversion causes a computational burden,is reduced.Matrix computation possesses many excellent numerical properties such as singularity,symmetry,skew symmetry,and triangularity is achieved by using this algorithm.The proposed method is validated for the prediction of stationary and non-stationary Mackey–Glass Time Series,along with that a component in the x-direction of the Lorenz Times Series is also predicted to illustrate its usefulness.By the learning curves regarding mean square error(MSE)are witnessed for demonstration with prediction performance of the proposed algorithm from where it’s concluded that the proposed algorithm performs better than EKRLS.This new SREKRLS based design positively offers an innovative era towards non-linear systolic arrays,which is efficient in developing very-large-scale integration(VLSI)applications with non-linear input data.Multiple experiments are carried out to validate the reliability,effectiveness,and applicability of the proposed algorithm and with different noise levels compared to the Extended kernel recursive least-squares(EKRLS)algorithm.展开更多
An explicit unconditionally stable algorithm for hybrid tests,which is developed from the traditional HHT-α algorithm,is proposed.The unconditional stability is first proven by the spectral radius method for a linear...An explicit unconditionally stable algorithm for hybrid tests,which is developed from the traditional HHT-α algorithm,is proposed.The unconditional stability is first proven by the spectral radius method for a linear system.If the value of α is selected within [-0.5,0],then the algorithm is shown to be unconditionally stable.Next,the root locus method for a discrete dynamic system is applied to analyze the stability of a nonlinear system.The results show that the proposed method is conditionally stable for dynamic systems with stiffness hardening.To improve the stability of the proposed method,the structure stiffness is then identified and updated.Both numerical and pseudo-dynamic tests on a structure with the collision effect prove that the stiffness updating method can effectively improve stability.展开更多
FastSLAM is a popular framework which uses a Rao-Blackwellized particle filter to solve the simultaneous localization and mapping problem（SLAM）. However, in this framework there are two important potential limitatio...FastSLAM is a popular framework which uses a Rao-Blackwellized particle filter to solve the simultaneous localization and mapping problem（SLAM）. However, in this framework there are two important potential limitations, the particle depletion problem and the linear approximations of the nonlinear functions. To overcome these two drawbacks, this paper proposes a new FastSLAM algorithm based on revised genetic resampling and square root unscented particle filter（SR-UPF）. Double roulette wheels as the selection operator, and fast Metropolis-Hastings（MH） as the mutation operator and traditional crossover are combined to form a new resampling method. Amending the particle degeneracy and keeping the particle diversity are both taken into considerations in this method. As SR-UPF propagates the sigma points through the true nonlinearity, it decreases the linearization errors. By directly transferring the square root of the state covariance matrix, SR-UPF has better numerical stability. Both simulation and experimental results demonstrate that the proposed algorithm can improve the diversity of particles, and perform well on estimation accuracy and consistency.展开更多
A cryptosystem based on computation of square roots of complex integers modulo composite n is described in this paper. This paper provides an algorithm extracting a square root of Gaussian integer. Various properties ...A cryptosystem based on computation of square roots of complex integers modulo composite n is described in this paper. This paper provides an algorithm extracting a square root of Gaussian integer. Various properties of square roots and a method for finding Gaussian generators are demonstrated. The generators can be instrumental in constructing other cryptosystems. It is shown how to significantly reduce average complexity of decryption per each block of ciphertext.展开更多
This paper considers three algorithms for the extraction of square roots of complex integers {called Gaussians} using arithmetic based on complex modulus p + iq. These algorithms are almost twice as fast as the analog...This paper considers three algorithms for the extraction of square roots of complex integers {called Gaussians} using arithmetic based on complex modulus p + iq. These algorithms are almost twice as fast as the analogous algorithms extracting square roots of either real or complex integers in arithmetic based on modulus p, where is a real prime. A cryptographic system based on these algorithms is provided in this paper. A procedure reducing the computational complexity is described as well. Main results are explained in several numeric illustrations.展开更多
Based on the standard definition of the product (concatenation), the natural non-negative degree of the language is introduced. Root extraction is the reverse operation to it, and it can be defined in several differen...Based on the standard definition of the product (concatenation), the natural non-negative degree of the language is introduced. Root extraction is the reverse operation to it, and it can be defined in several different ways. Despite the simplicity of the formulation of the problem of extracting the root, the authors could not find any description of it in the literature (as well as on the Internet), including even its formulation. Most of the material in this article is devoted to the simplest version of the formulation: the root of the 2<sup>nd</sup> degree for the 1-letter alphabet, but many of the provisions of the article are generalized to more complex cases. Apparently, for a possible future description of a polynomial algorithm for solving at least one of the described statements of root extraction problems, it is first necessary to really analyze in detail such a special case, that is: either describe the necessary polynomial algorithm, or, conversely, show that the problem belongs to the class of NP-complete problems. Thus, in this article, we do not propose a polynomial algorithm for the problems under consideration;however, the models described here should help in constructing appropriate heuristic algorithms for their solution. A detailed description of the possible further application of such heuristic algorithms is beyond the scope of this article. .展开更多
Network planning is essential for the construction and the development of wireless networks. The network planning cannot be possible without an appropriate propagation model which in fact is its foundation. Initially ...Network planning is essential for the construction and the development of wireless networks. The network planning cannot be possible without an appropriate propagation model which in fact is its foundation. Initially used mainly for mobile radio networks, the optimization of propagation model is becoming essential for efficient deployment of the network in different types of environment, namely rural, suburban and urban especially with the emergence of concepts such as digital terrestrial television, smart cities, Internet of Things (IoT) with wide deployment for different use cases such as smart grid, smart metering of electricity, gas and water. In this paper we use an optimization algorithm that is inspired by the principles of magnetic field theory namely Magnetic Optimization Algorithm (MOA) to tune COST231-Hata propagation model. The dataset used is the result of drive tests carry out on field in the town of Limbe in Cameroon. We take into account the standard K-factor model and then use the MOA algorithm in order to set up a propagation model adapted to the physical environment of a town. The town of Limbe is used as an implementation case, but the proposed method can be used everywhere. The calculation of the root mean square error (RMSE) between the real data from the radio measurements and the prediction data obtained after the implementation of MOA allows the validation of the results. A comparative study between the value of the RMSE obtained by the new model and those obtained by the optimization using linear regression, by the standard COST231-Hata models, and the free space model is also done, this allows us to conclude that the new model obtained using MOA for the city of Limbe is better and more representative of this local environment than the standard COST231-Hata model. The new model obtained can be used for radio planning in the city of Limbé in Cameroon.展开更多
Propagation models are the foundation for radio planning in mobile networks. They are widely used during feasibility studies and initial network deployment, or during network extensions, particularly in new cities. Th...Propagation models are the foundation for radio planning in mobile networks. They are widely used during feasibility studies and initial network deployment, or during network extensions, particularly in new cities. They can be used to calculate the power of the signal received by a mobile terminal, evaluate the coverage radius, and calculate the number of cells required to cover a given area. This paper takes into account the standard k factors model and then uses the differential evolution algorithm to set up a propagation model adapted to the physical environment of the Cameroonian cities of Bertoua. Drive tests were made on the LTE TDD network in the city of Bertoua. Differential evolution algorithm is used as the optimization algorithm to deduct a propagation model which fits the environment of the considered town. The calculation of the root mean square error between the actual data from the drive tests and the prediction data from the implemented model allows the validation of the obtained results. A comparative study made between the RMSE value obtained by the new model and those obtained by the Okumura Hata and free space models, allowed us to conclude that the new model obtained is better and more representative of our local environment than the Okumura Hata currently used. The implementation shows that Differential evolution can perform well and solve this kind of optimization problem;the newly obtained models can be used for radio planning in the city of Bertoua in Cameroon.展开更多
文摘This paper presents a modified Root-MUSIC algorithm by which the signal DOA estimation performance can be improved when the snapshot number is limited. The operation principlesof this algorithm are described in detail. It is also pointed out theoretically that this is equivalentto have increased the snapshot number and can make the DOA estimation better. Finally, somesimulating results to verify the theoretical analyses are presented.
基金funded by Prince Sultan University,Riyadh,Saudi Arabia。
文摘For the unforced dynamical non-linear state–space model,a new Q1 and efficient square root extended kernel recursive least square estimation algorithm is developed in this article.The proposed algorithm lends itself towards the parallel implementation as in the FPGA systems.With the help of an ortho-normal triangularization method,which relies on numerically stable givens rotation,matrix inversion causes a computational burden,is reduced.Matrix computation possesses many excellent numerical properties such as singularity,symmetry,skew symmetry,and triangularity is achieved by using this algorithm.The proposed method is validated for the prediction of stationary and non-stationary Mackey–Glass Time Series,along with that a component in the x-direction of the Lorenz Times Series is also predicted to illustrate its usefulness.By the learning curves regarding mean square error(MSE)are witnessed for demonstration with prediction performance of the proposed algorithm from where it’s concluded that the proposed algorithm performs better than EKRLS.This new SREKRLS based design positively offers an innovative era towards non-linear systolic arrays,which is efficient in developing very-large-scale integration(VLSI)applications with non-linear input data.Multiple experiments are carried out to validate the reliability,effectiveness,and applicability of the proposed algorithm and with different noise levels compared to the Extended kernel recursive least-squares(EKRLS)algorithm.
基金Scientific Research Fund of the Institute of Engineering Mechanics,CEA under Grant Nos.2017A02,2016B09 and 2016A06the National Science-technology Support Plan Projects under Grant No.2015BAK17B02the National Natural Science Foundation of China under Grant Nos.51378478,51408565,51678538 and 51161120360
文摘An explicit unconditionally stable algorithm for hybrid tests,which is developed from the traditional HHT-α algorithm,is proposed.The unconditional stability is first proven by the spectral radius method for a linear system.If the value of α is selected within [-0.5,0],then the algorithm is shown to be unconditionally stable.Next,the root locus method for a discrete dynamic system is applied to analyze the stability of a nonlinear system.The results show that the proposed method is conditionally stable for dynamic systems with stiffness hardening.To improve the stability of the proposed method,the structure stiffness is then identified and updated.Both numerical and pseudo-dynamic tests on a structure with the collision effect prove that the stiffness updating method can effectively improve stability.
基金supported by National Natural Science Foundation of China(No.61101197)Research Fund for the Doctoral Program of Higher Education of China(No.20093219120025)
文摘FastSLAM is a popular framework which uses a Rao-Blackwellized particle filter to solve the simultaneous localization and mapping problem（SLAM）. However, in this framework there are two important potential limitations, the particle depletion problem and the linear approximations of the nonlinear functions. To overcome these two drawbacks, this paper proposes a new FastSLAM algorithm based on revised genetic resampling and square root unscented particle filter（SR-UPF）. Double roulette wheels as the selection operator, and fast Metropolis-Hastings（MH） as the mutation operator and traditional crossover are combined to form a new resampling method. Amending the particle degeneracy and keeping the particle diversity are both taken into considerations in this method. As SR-UPF propagates the sigma points through the true nonlinearity, it decreases the linearization errors. By directly transferring the square root of the state covariance matrix, SR-UPF has better numerical stability. Both simulation and experimental results demonstrate that the proposed algorithm can improve the diversity of particles, and perform well on estimation accuracy and consistency.
文摘A cryptosystem based on computation of square roots of complex integers modulo composite n is described in this paper. This paper provides an algorithm extracting a square root of Gaussian integer. Various properties of square roots and a method for finding Gaussian generators are demonstrated. The generators can be instrumental in constructing other cryptosystems. It is shown how to significantly reduce average complexity of decryption per each block of ciphertext.
文摘This paper considers three algorithms for the extraction of square roots of complex integers {called Gaussians} using arithmetic based on complex modulus p + iq. These algorithms are almost twice as fast as the analogous algorithms extracting square roots of either real or complex integers in arithmetic based on modulus p, where is a real prime. A cryptographic system based on these algorithms is provided in this paper. A procedure reducing the computational complexity is described as well. Main results are explained in several numeric illustrations.
文摘Based on the standard definition of the product (concatenation), the natural non-negative degree of the language is introduced. Root extraction is the reverse operation to it, and it can be defined in several different ways. Despite the simplicity of the formulation of the problem of extracting the root, the authors could not find any description of it in the literature (as well as on the Internet), including even its formulation. Most of the material in this article is devoted to the simplest version of the formulation: the root of the 2<sup>nd</sup> degree for the 1-letter alphabet, but many of the provisions of the article are generalized to more complex cases. Apparently, for a possible future description of a polynomial algorithm for solving at least one of the described statements of root extraction problems, it is first necessary to really analyze in detail such a special case, that is: either describe the necessary polynomial algorithm, or, conversely, show that the problem belongs to the class of NP-complete problems. Thus, in this article, we do not propose a polynomial algorithm for the problems under consideration;however, the models described here should help in constructing appropriate heuristic algorithms for their solution. A detailed description of the possible further application of such heuristic algorithms is beyond the scope of this article. .
文摘Network planning is essential for the construction and the development of wireless networks. The network planning cannot be possible without an appropriate propagation model which in fact is its foundation. Initially used mainly for mobile radio networks, the optimization of propagation model is becoming essential for efficient deployment of the network in different types of environment, namely rural, suburban and urban especially with the emergence of concepts such as digital terrestrial television, smart cities, Internet of Things (IoT) with wide deployment for different use cases such as smart grid, smart metering of electricity, gas and water. In this paper we use an optimization algorithm that is inspired by the principles of magnetic field theory namely Magnetic Optimization Algorithm (MOA) to tune COST231-Hata propagation model. The dataset used is the result of drive tests carry out on field in the town of Limbe in Cameroon. We take into account the standard K-factor model and then use the MOA algorithm in order to set up a propagation model adapted to the physical environment of a town. The town of Limbe is used as an implementation case, but the proposed method can be used everywhere. The calculation of the root mean square error (RMSE) between the real data from the radio measurements and the prediction data obtained after the implementation of MOA allows the validation of the results. A comparative study between the value of the RMSE obtained by the new model and those obtained by the optimization using linear regression, by the standard COST231-Hata models, and the free space model is also done, this allows us to conclude that the new model obtained using MOA for the city of Limbe is better and more representative of this local environment than the standard COST231-Hata model. The new model obtained can be used for radio planning in the city of Limbé in Cameroon.
文摘Propagation models are the foundation for radio planning in mobile networks. They are widely used during feasibility studies and initial network deployment, or during network extensions, particularly in new cities. They can be used to calculate the power of the signal received by a mobile terminal, evaluate the coverage radius, and calculate the number of cells required to cover a given area. This paper takes into account the standard k factors model and then uses the differential evolution algorithm to set up a propagation model adapted to the physical environment of the Cameroonian cities of Bertoua. Drive tests were made on the LTE TDD network in the city of Bertoua. Differential evolution algorithm is used as the optimization algorithm to deduct a propagation model which fits the environment of the considered town. The calculation of the root mean square error between the actual data from the drive tests and the prediction data from the implemented model allows the validation of the obtained results. A comparative study made between the RMSE value obtained by the new model and those obtained by the Okumura Hata and free space models, allowed us to conclude that the new model obtained is better and more representative of our local environment than the Okumura Hata currently used. The implementation shows that Differential evolution can perform well and solve this kind of optimization problem;the newly obtained models can be used for radio planning in the city of Bertoua in Cameroon.
