【摘要】：本文提出一種新的方向圖快速綜合算法.該方法基于交替投影算法(AP),首先對目標(biāo)方向圖幅度進(jìn)行限制,其次引入了目標(biāo)方向圖相位變量并對其進(jìn)行優(yōu)化,得到最佳目標(biāo)方向圖相位,最后結(jié)合臨近分裂方法來求解有約束的最小二乘問題(CLMS)以獲得滿足要求的激勵(lì).相比于其他AP類算法只對方向圖幅度進(jìn)行限制的處理,本文對方向圖相位的優(yōu)化處理有助于提高算法的收斂速度和性能.實(shí)驗(yàn)結(jié)果表明,無論有無激勵(lì)約束的情況下,該算法均能取得良好的優(yōu)化效果,且適用于任意陣列,具有很好的推廣能力.
[Abstract]:In this paper, a new fast pattern synthesis algorithm is proposed. Based on the alternating projection algorithm (AP), the amplitude of the target direction map is firstly restricted, and then the phase variable of the target direction map is introduced and optimized to obtain the optimal target direction map phase. Finally, the constrained least squares problem (CLMS) is solved by using the near splitting method to obtain the required excitation. Compared with other AP algorithms, the phase optimization is helpful to improve the convergence speed and performance of the algorithm. The experimental results show that the proposed algorithm can achieve good optimization results with or without excitation constraints, and is suitable for arbitrary arrays and has a good generalization ability.
【作者單位】： 南京理工大學(xué)電子工程與光電技術(shù)學(xué)院;
【基金】：國家自然科學(xué)基金(No.11273017,No.61471196) 江蘇省普通高校學(xué)術(shù)學(xué)位研究生科研新計(jì)劃項(xiàng)目(No.KYLX16-0448)
【分類號】：TN820
，

本文編號：2350520