TY - JOUR
T1 - Numerical algorithm for POCET optimal phase search
AU - Zhang, Meijun
AU - Kou, Yanhong
N1 - Publisher Copyright:
© 2017, Editorial Board of JBUAA. All right reserved.
PY - 2017/9
Y1 - 2017/9
N2 - Usually a modern navigation satellite needs to combine multiple signal components at the same carrier frequency or even two/three adjacent frequencies into a constant-envelope signal before its high power amplifier. The phase-optimized constant-envelope transmission (POCET) technique can deal with any number of signal components and achieve the highest power efficiency. The existing numerical algorithms for POCET phase searching, however, have some problems such as large amount of computation, slow convergence rate, and possible failure of convergence when the initial point is far from the optimal solution or when higher accuracy is required. Aimed at the argumentation of optimized multiplexing for satellite navigation signals, this paper firstly introduces the augmented Lagrange multiplier method to ensure convergence with smaller termination error. Next, the inexact line search algorithm based on Armijo criterion is adopted instead of the exact line search for determination of search steps. Then, the characteristics and applicability of several search direction optimization algorithms are comparatively analyzed, such as the steepest descent method, the conjugate gradient method, and the quasi-Newton method (including the BFGS method and the symmetric rank 1 method). Finally, the high accuracy, low computational complexity, and strong convergence of the improved algorithm are validated by its application in the search of optimal phase-table and evaluation of combining loss of BDS B1 signals under different power allocation and phase constraints. The study provides a reference for the design and optimization of the navigation signal modulation.
AB - Usually a modern navigation satellite needs to combine multiple signal components at the same carrier frequency or even two/three adjacent frequencies into a constant-envelope signal before its high power amplifier. The phase-optimized constant-envelope transmission (POCET) technique can deal with any number of signal components and achieve the highest power efficiency. The existing numerical algorithms for POCET phase searching, however, have some problems such as large amount of computation, slow convergence rate, and possible failure of convergence when the initial point is far from the optimal solution or when higher accuracy is required. Aimed at the argumentation of optimized multiplexing for satellite navigation signals, this paper firstly introduces the augmented Lagrange multiplier method to ensure convergence with smaller termination error. Next, the inexact line search algorithm based on Armijo criterion is adopted instead of the exact line search for determination of search steps. Then, the characteristics and applicability of several search direction optimization algorithms are comparatively analyzed, such as the steepest descent method, the conjugate gradient method, and the quasi-Newton method (including the BFGS method and the symmetric rank 1 method). Finally, the high accuracy, low computational complexity, and strong convergence of the improved algorithm are validated by its application in the search of optimal phase-table and evaluation of combining loss of BDS B1 signals under different power allocation and phase constraints. The study provides a reference for the design and optimization of the navigation signal modulation.
KW - Combining loss
KW - Multiplexing
KW - Numerical algorithm
KW - Optimization algorithm
KW - POCET technique
UR - https://www.scopus.com/pages/publications/85032645495
U2 - 10.13700/j.bh.1001-5965.2016.0701
DO - 10.13700/j.bh.1001-5965.2016.0701
M3 - 文章
AN - SCOPUS:85032645495
SN - 1001-5965
VL - 43
SP - 1917
EP - 1923
JO - Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics
JF - Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics
IS - 9
ER -