【摘要】：隨著科技的不斷發(fā)展和進(jìn)步,人們對高速率通信服務(wù)的需求日益增長,而有限的頻譜資源和惡劣的無線通信環(huán)境都會影響用戶的通信體驗(yàn)。因此,為了滿足蜂窩用戶對更快更可靠的數(shù)據(jù)服務(wù)的需求,迫切需要一種合適的資源分配方式來合理的利用資源,獲得更好的系統(tǒng)性能。正交頻分復(fù)用多址接入技術(shù)已經(jīng)越來越多地被應(yīng)用在各種新興和演進(jìn)的蜂窩系統(tǒng)中,應(yīng)用該技術(shù)能夠有效減少符號間干擾,動態(tài)分配資源,從而提高系統(tǒng)整體性能。目前正交頻分復(fù)用多址接入系統(tǒng)下行鏈路中資源分配方式主要包括基于子載波的資源分配和基于子載波塊的資源分配兩種方式。在子載波數(shù)量較大時(shí),若對每個(gè)子載波進(jìn)行分配算法復(fù)雜度會很大,因此本文針對子載波數(shù)量較大的情況,分別提出基于子載波塊的自適應(yīng)功率優(yōu)化分配方案和基于人工魚群算法的速率優(yōu)化分配方案來進(jìn)行最優(yōu)分配。在功率優(yōu)化中,根據(jù)相鄰子載波之間的相關(guān)性進(jìn)行載波聚合,形成子載波塊,提出一種聯(lián)合子載波塊,功率和比特分配的方案,在總發(fā)射功率的約束下最大化系統(tǒng)吞吐量,并考慮到實(shí)際中比特的整數(shù)性質(zhì)提出比特的數(shù)字化過程。仿真比較了本節(jié)算法與固定功率分配算法的吞吐量性能,結(jié)果顯示在用戶數(shù)量不斷增大時(shí),理論結(jié)果上兩種算法性能幾乎相同,但加入數(shù)字化過程后本文所提動態(tài)功率分配算法的吞吐量遠(yuǎn)大于固定功率分配。同時(shí),基于子載波塊的分配方式大大減小了分配過程的復(fù)雜度,節(jié)省了運(yùn)行時(shí)間。在速率優(yōu)化中,將用戶的速率公平性加入到目標(biāo)函數(shù)中,首先為各用戶設(shè)置初始速率比例值,然后提出適應(yīng)度函數(shù)衡量用戶公平性和系統(tǒng)吞吐量之間的關(guān)系。在功率分配中利用人工魚群算法的并行處理能力和全局快速尋優(yōu)能力來實(shí)現(xiàn)最優(yōu)功率分配。仿真實(shí)驗(yàn)中與Shen算法和Max-Min算法進(jìn)行比較,結(jié)果表明該方案在系統(tǒng)總功率一定的條件下,獲得的用戶公平性約為0.98-0.99,接近于最大值1,系統(tǒng)容量相對于Shen算法和Max-Min算法約有0.17～0.49bit/s/Hz的提升。能夠在獲得最大系統(tǒng)傳輸速率的同時(shí)保證用戶間的速率較好的公平性。
[Abstract]:With the continuous development and progress of science and technology, the demand for high-speed communication services is increasing, and limited spectrum resources and poor wireless communication environment will affect the user's communication experience. Therefore, in order to meet the needs of cellular users for faster and more reliable data services, an appropriate resource allocation method is urgently needed to make rational use of resources and obtain better system performance. Orthogonal Frequency Division Multiplexing (OFDMA) has been widely used in various new and evolving cellular systems. It can effectively reduce inter-symbol interference and dynamically allocate resources, thus improving the overall performance of the system. At present, in the downlink of orthogonal frequency division multiplexing (OFDMA) multiple access system, resource allocation mainly includes subcarrier based resource allocation and subcarrier block based resource allocation. When the number of subcarriers is large, the complexity of each subcarrier allocation algorithm will be very large, so this paper aims at the large number of subcarriers. An adaptive power allocation scheme based on subcarrier block and a rate optimal allocation scheme based on artificial fish swarm algorithm are proposed respectively. In power optimization, carrier aggregation is carried out according to the correlation between adjacent subcarriers to form sub-carrier blocks. A joint sub-carrier block, power and bit allocation scheme is proposed to maximize system throughput under the constraints of total transmission power. Considering the integer nature of bits in practice, the digitization process of bits is proposed. The throughput performance of this algorithm is compared with that of the fixed power allocation algorithm. The results show that when the number of users increases, the performance of the two algorithms is almost the same. However, the throughput of the proposed dynamic power allocation algorithm is much larger than that of the fixed power allocation algorithm. At the same time, the allocation method based on sub-carrier block greatly reduces the complexity of the allocation process and saves the running time. In rate optimization, the user's rate fairness is added to the objective function. First, the initial rate ratio is set for each user, and then the fitness function is proposed to measure the relationship between user fairness and system throughput. In power allocation, the parallel processing ability of artificial fish swarm algorithm and the global fast optimization ability are used to realize the optimal power allocation. Compared with Shen algorithm and Max-Min algorithm, the simulation results show that the fairness of the proposed scheme is 0.98-0.99 when the total power of the system is fixed, which is close to the maximum value of 1. Compared with the Shen algorithm and the Max-Min algorithm, the system capacity is about the increase of 0.17~0.49bit/s/Hz. It can obtain the maximum system transmission rate and ensure the fairness of the rate between users at the same time.
【學(xué)位授予單位】：寧夏大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN929.5

【參考文獻(xiàn)】

相關(guān)期刊論文 前9條

1 侯華;張江梅;張偉;;CR-OFDM系統(tǒng)中基于人工魚群算法的多業(yè)務(wù)資源分配[J];電子技術(shù)應(yīng)用;2015年01期

2 田金鳳;鄭小盈;胡宏林;尤肖虎;;中國下一代移動通信研究[J];科學(xué)通報(bào);2012年05期

3 王麗萍;孫國防;程永明;;魚群算法在多用戶OFDM跨層資源分配中的應(yīng)用[J];電路與系統(tǒng)學(xué)報(bào);2011年03期

4 王聯(lián)國;施秋紅;;人工魚群算法的參數(shù)分析[J];計(jì)算機(jī)工程;2010年24期

5 王聯(lián)國;洪毅;趙付青;余冬梅;;一種簡化的人工魚群算法[J];小型微型計(jì)算機(jī)系統(tǒng);2009年08期

6 程永明;江銘炎;;基于改進(jìn)人工魚群算法的多用戶OFDM系統(tǒng)自適應(yīng)資源分配[J];計(jì)算機(jī)應(yīng)用研究;2009年06期

7 王聯(lián)國;洪毅;趙付青;余冬梅;;一種改進(jìn)的人工魚群算法[J];計(jì)算機(jī)工程;2008年19期

8 李曉磊,路飛,田國會,錢積新;組合優(yōu)化問題的人工魚群算法應(yīng)用[J];山東大學(xué)學(xué)報(bào)(工學(xué)版);2004年05期

9 趙新勝 ,尤肖虎;未來移動通信系統(tǒng)中的無線資源管理[J];中興通訊技術(shù);2002年06期

相關(guān)博士學(xué)位論文 前2條

1 張昕;基于OFDMA的寬帶無線通信系統(tǒng)資源分配研究[D];華南理工大學(xué);2010年

2 李曉磊;一種新型的智能優(yōu)化方法-人工魚群算法[D];浙江大學(xué);2003年

相關(guān)碩士學(xué)位論文 前3條

1 汪照;智能優(yōu)化算法及其在無線通信資源分配中的應(yīng)用[D];寧波大學(xué);2014年

2 丁騰波;OFDMA系統(tǒng)的關(guān)鍵技術(shù)研究[D];浙江大學(xué);2007年

3 劉霞;第三代移動通信系統(tǒng)無線資源管理關(guān)鍵算法的研究[D];蘭州理工大學(xué);2007年

，

本文編號：2383848