請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/96744
標題: | 在恆定模量約束下使用動態選點方法達到低峰值旁辦位準的均勻矩形陣列波束圖型合成 Uniform Rectangular Array Beampattern Synthesis with Low Peak Sidelobe Level considering Constant Modulus Constraint using Dynamic Points Selection Method |
作者: | 馬振洋 Chen-Yang Ma |
指導教授: | 蘇柏青 Borching Su |
關鍵字: | 波束成型器,波束圖型合成,恆定模量約束,均勻矩形陣列,動態選點, Beamformer,Beampattern Synthesis,Constant Modulus Constraint (CMC),Uniform Rectangular Array (URA),Dynamic Points Selection, |
出版年 : | 2024 |
學位: | 碩士 |
摘要: | 波束成形在衛星通信中至關重要,因為它在克服長距離傳輸所造成的巨大路徑損耗方面發揮了關鍵作用。為了在廣泛區域內同時為用戶終端提供服務並提高下行鏈路容量,衛星廣播應用中需要設計具有寬波束的波束成形器。另外,對於最小化發射波束的功率洩漏,從而防止對非目標用戶的干擾,在波束圖型合成中實現低峰值旁瓣位準也是至關重要。在衛星波束成形器的設計中,必須考慮恆定模量約束,以使功率放大器在接近飽和點的同時保持在線性區域運作,從而實現最大效率。本篇論文研究了均勻矩形陣列發射波束成形器設計問題,其目的是在滿足恆定模量約束的前提下,最小化發射波束圖型的低峰值旁瓣位準。本篇論文提出了稱為動態選點的新方法,通過找到局部峰值進行壓抑,以確保在連續空間域內抑制低峰值旁瓣位準。使用此方法可以減少約束的數量,縮短計算的時間,並獲得更低的低峰值旁瓣位準。針對非凸函數約束的問題,最佳化問題被重新制定為帶有秩等於一約束的半正定規劃,並通過凸函數迭代算法求解。模擬結果顯示了對比其他已存在方法,此方法在滿足恆定模量約束之下抑制低峰值旁瓣位準方面的優勢。 Beamforming is essential in satellite communication (SatComs) since it plays a crucial role in overcoming great path loss caused by long-distance transmission. To achieve higher downlink capacity while simultaneously serving user terminals over wide areas, broadened beam beamformer design is desired in satellite (SAT) broadcast applications. Furthermore, achieving a low peak sidelobe level (PSL) in beampattern synthesis is essential to minimize power leakage from the transmitted beam, thereby preventing interference with non-target users. The constant modulus constants (CMCs) must be considered in SAT beamformer design to enable power amplifiers (PAs) to operate close to the saturation point while remaining in the linear region to achieve maximum efficiency. In this thesis, the uniform rectangular array (URA) beampattern synthesis design problem, formulated to minimize the PSL of the transmit beampattern while satisfying the CMC is studied. A new method called the dynamic points selection (DPS) method is proposed to ensure the suppression of PSL in the continuous spatial domain by finding the local peaks for suppression. The proposed method can reduce the number of constraints, decrease the computation time, and receive lower PSL. For the non-convex constraints, the optimization problem is reformulated to semidefinite programming (SDP) with a rank 1 constraint and is solved by a convex iterative algorithm. Simulation results reveal the advantages of the proposed method for suppressing the lower PSL under CMCs compared to existing methods. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/96744 |
DOI: | 10.6342/NTU202404750 |
全文授權: | 未授權 |
電子全文公開日期: | N/A |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-113-1.pdf 目前未授權公開取用 | 151.32 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。