頁籤選單縮合
題 名 | 利用爬山演算法將非均勻天線陣列位置與權重最佳化=Climbing Algorithm Using Non-uniform Antenna Array Optimized Position and the Weight |
---|---|
作 者 | 楊士杰; 李坤洲; | 書刊名 | 資訊科學應用期刊 |
卷 期 | 7:1 2011.06[民100.06] |
頁 次 | 頁59-71 |
分類號 | 448.813 |
關鍵詞 | 爬山演算法; 天線陣列; 通訊; 頻寬; Climbing algorithm; Antenna array; Communication; Bandwidth; |
語 文 | 中文(Chinese) |
中文摘要 | 本論文主要是用爬山演算法使陣列元素、權重,調整到最佳化位置,最大化 主波瓣和旁波瓣間之峰值差,且對頻寬作出限制,讓天線陣列在發射端與接收端 得到良好的通訊品質,也能顧及解析度與指向性。本研究首先,解析主波瓣、旁 波瓣、半功率頻寬與通訊的關係,且限制頻寬,再用爬山演算法最佳化陣列元素 的位置與權重,結果爬山演算法適用於解決天線陣列問題,並平衡研究目標與執 行效率,成功的運用演算法最佳化天線陣列位置與權重的問題。 |
英文摘要 | This paper research Climbing algorithm to optimize non-uniform antenna array , Mainly through Climbing algorithm to adjust the location of array elements and the weight, at the same time to restrict the bandwidth, makes a good communication quality at the receiver, also take into account the resolution and directivity.。This search first of all, analysis main lobe, sidelobe, half-power bandwidth and the relationship between communication, and restrict the bandwidth, using Climbing algorithm and then optimized the location of the array elements and weight,actual results also show that Climbing algorithm adjust to solve the problem for antenna array, and balance And balance Research objectives and efficiency, successful use of algorithms optimized antenna array position and weight problems。 |
本系統中英文摘要資訊取自各篇刊載內容。