TY - CHAP
T1 - Shaped power pattern synthesis with minimization of dynamic range ratio
AU - Liang, Junli
AU - Fan, Xuhui
AU - Zhang, Yuanhang
AU - So, Hing Cheung
AU - Zhao, Xiaozhe
N1 - Publisher Copyright:
© The Institution of Engineering and Technology and its licensors 2025.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - In this chapter, we address the issue of array pattern synthesis with a focus on minimizing the dynamic range ratio (DRR). Unlike common approaches that simply limit DRR to a specific threshold, our goal is to reduce the DRR of excitation vectors while creating the desired array pattern. This unique approach results in a new optimization problem characterized by a fractional objective function and nonconvex constraints. To tackle this challenge, we propose a novel algorithm that effectively solves the optimization problem. By introducing auxiliary variables, we formulate an equivalent optimization problem that converts the fractional objective function into a linear one. This allows us to decompose the original problem into subproblems that can be efficiently solved in each iteration. Through this approach, we simplify the subproblems into single-variable quadratic unconstrained optimization or least-squares problems, enabling us to achieve our goal of minimizing DRR in array pattern synthesis.
AB - In this chapter, we address the issue of array pattern synthesis with a focus on minimizing the dynamic range ratio (DRR). Unlike common approaches that simply limit DRR to a specific threshold, our goal is to reduce the DRR of excitation vectors while creating the desired array pattern. This unique approach results in a new optimization problem characterized by a fractional objective function and nonconvex constraints. To tackle this challenge, we propose a novel algorithm that effectively solves the optimization problem. By introducing auxiliary variables, we formulate an equivalent optimization problem that converts the fractional objective function into a linear one. This allows us to decompose the original problem into subproblems that can be efficiently solved in each iteration. Through this approach, we simplify the subproblems into single-variable quadratic unconstrained optimization or least-squares problems, enabling us to achieve our goal of minimizing DRR in array pattern synthesis.
UR - http://www.scopus.com/inward/record.url?scp=85213530144&partnerID=8YFLogxK
U2 - 10.1049/SBRA566E_ch4
DO - 10.1049/SBRA566E_ch4
M3 - 章节
AN - SCOPUS:85213530144
SN - 9781839539336
SP - 81
EP - 105
BT - Radar Array Design Using Optimization Theory
PB - Institution of Engineering and Technology
ER -