Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear comp...Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear complexity,minimal polynomial,and autocorrelation are investigated.The results show that these sequences have a large linear complexity when 2∈D1,which means they can resist the Berlekamp-Massey attack.Furthermore,the autocorrelation values are close to 0 with a probability of approximately 1?1/r.Therefore,when r is a big prime,the new sequence has a good autocorrelation.展开更多
High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms...High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms, the approximation formula under the least mean square error criterion is derived. For the iterative algorithms, a modified CORDIC (coordinate rotation digital computer) algorithm is developed. This modified CORDIC algorithm is proved to be with a maximum relative error about one half that of the original CORDIC algorithm. Finally, the effects of the finite register length on these algorithms are also concerned, which shows that 9 to 12-bit coefficients are sufficient for practical applications.展开更多
It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity problems.This paper presents an extension of t...It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity problems.This paper presents an extension of the recent variant of Mehrotra＇s second order algorithm for linear optimijation.It is shown that the iteration-complexity bound of the algorithm is O（4κ ＋ 3）√14κ ＋ 5 nlog（x0）Ts0/ε,which is similar to that of the corresponding algorithm for linear optimization.展开更多
基金supported by the National Key Research and Development Program of China(2016YFB0800601)the Natural Science Foundation of China(61303217+3 种基金61502372)the Fundamental Research Funds for the Central Universities(JB140115)the Natural Science Foundation of Shaanxi Province(2013JQ80022014JQ8313)
文摘Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear complexity,minimal polynomial,and autocorrelation are investigated.The results show that these sequences have a large linear complexity when 2∈D1,which means they can resist the Berlekamp-Massey attack.Furthermore,the autocorrelation values are close to 0 with a probability of approximately 1?1/r.Therefore,when r is a big prime,the new sequence has a good autocorrelation.
基金Supported by National Natural Science Foundation of China（60474029 60774045 60634020 61075065） the Graduate Degree Thesis Innovation Foundation of Central South University
基金This project was supported by the Natural Science Foundation of Shaanxi Province.
文摘High-speed magnitude approximation algorithms for complex vectors are discussed intensively. The performance and the convergence speed of these approximation algorithms are analyzed. For the polygon fitting algorithms, the approximation formula under the least mean square error criterion is derived. For the iterative algorithms, a modified CORDIC (coordinate rotation digital computer) algorithm is developed. This modified CORDIC algorithm is proved to be with a maximum relative error about one half that of the original CORDIC algorithm. Finally, the effects of the finite register length on these algorithms are also concerned, which shows that 9 to 12-bit coefficients are sufficient for practical applications.
基金supported by the Natural Science Foundation of Hubei Province of China(2008CDZ047)
文摘It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_＊（κ） linear complementarity problems.This paper presents an extension of the recent variant of Mehrotra＇s second order algorithm for linear optimijation.It is shown that the iteration-complexity bound of the algorithm is O（4κ ＋ 3）√14κ ＋ 5 nlog（x0）Ts0/ε,which is similar to that of the corresponding algorithm for linear optimization.
