本文選題：干擾對(duì)齊　切入點(diǎn)：大規(guī)模MIMO　出處：《南京郵電大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著頻譜資源的日漸緊缺,同時(shí)設(shè)備與設(shè)備之間的數(shù)據(jù)交換呈爆發(fā)式增長(zhǎng),對(duì)無(wú)線通信的傳輸速率提出了更高的要求。大規(guī)模多輸入多輸出(Massive Multiple-Input Multiple-Output,Massive MIMO)作為下一代無(wú)線通信的關(guān)鍵技術(shù)之一,存在著嚴(yán)重的同頻干擾,因此作為干擾管理方式之一的干擾對(duì)齊技術(shù)成為研究熱點(diǎn)。本文對(duì)多小區(qū)Massive MIMO的干擾對(duì)齊技術(shù)進(jìn)行了研究,分別從降低算法復(fù)雜度、提高算法通用性、減少信道狀態(tài)信息(Channel State Information,CSI)交換等方面優(yōu)化算法。本文主要的研究?jī)?nèi)容及創(chuàng)新點(diǎn)如下:(1)針對(duì)3小區(qū)2用戶MIMO干擾網(wǎng)絡(luò),提出一種線性干擾對(duì)齊算法。該算法對(duì)聯(lián)合信道矩陣進(jìn)行QR分解,再依據(jù)各小區(qū)等效信道模型的特征,利用最小化干擾泄露以及迫零算法對(duì)齊小區(qū)間以及小區(qū)內(nèi)干擾,每用戶能夠?qū)崿F(xiàn)其信道空間維度1/3的自由度。仿真結(jié)果表明,該算法能夠在保證系統(tǒng)容量的同時(shí)大大降低算法復(fù)雜度。(2)針對(duì)多小區(qū)多用戶Massive MIMO干擾網(wǎng)絡(luò),基于下行干擾對(duì)齊提出一種迭代干擾對(duì)齊算法(SLRINR IA)。該算法首先將干擾劃分為主干擾和次干擾,然后依據(jù)次主干擾比以及干擾信道CSI設(shè)計(jì)接收干擾抑制矩陣,以最大化SLRINR為準(zhǔn)則設(shè)計(jì)發(fā)送預(yù)編碼矩陣,且將聯(lián)合預(yù)編碼所需的CSI交換限制在單個(gè)小區(qū)內(nèi),有效提高用戶SINR并降低系統(tǒng)的實(shí)現(xiàn)復(fù)雜度。仿真結(jié)果表明,該算法能有效抑制小區(qū)內(nèi)和小區(qū)間干擾,并能快速收斂。(3)將多小區(qū)分簇的思想引入到SLRINR IA上,提出分簇式干擾對(duì)齊算法。該算法首先依據(jù)小區(qū)相互間的干擾強(qiáng)度,以最大化簇內(nèi)干擾為準(zhǔn)則對(duì)小區(qū)進(jìn)行分簇。然后采取多層干擾管理措施,即簇內(nèi)采用考慮多個(gè)主干擾源的SLRINR IA,而簇間采用不迭代的交替最小化干擾對(duì)齊算法。仿真結(jié)果表明,該算法在保證系統(tǒng)容量的同時(shí)進(jìn)一步減少CSI的交換量,大大降低系統(tǒng)的實(shí)現(xiàn)復(fù)雜度。
[Abstract]:With the increasing shortage of spectrum resources, the data exchange between equipment and equipment has increased explosively. As one of the key technologies of the next generation wireless communication, there is serious co-frequency interference. Therefore, as one of the interference management methods, interference alignment technology has become a hot topic. In this paper, the interference alignment technology of multi-cell Massive MIMO is studied, which can reduce the complexity of the algorithm and improve the generality of the algorithm. The main contents and innovations of this paper are as follows: (1) for 3 cell 2 user MIMO interference networks, the main research contents and innovations are as follows: 1. In this paper, a linear interference alignment algorithm is proposed, in which the joint channel matrix is decomposed by QR. According to the characteristics of the equivalent channel model of each cell, the minimum interference leakage and zero-forcing algorithm are used to align the inter-cell and intra-cell interference. The simulation results show that the algorithm can greatly reduce the complexity of the algorithm while ensuring the capacity of the system. (2) for multi-cell and multi-user Massive MIMO jamming networks, the simulation results show that the proposed algorithm can achieve the degree of freedom of its channel space dimension 1/3. An iterative interference alignment algorithm based on downlink interference alignment is proposed. The algorithm divides the interference into primary interference and secondary interference, and then designs the received interference suppression matrix according to the secondary principal interference ratio and the interference channel CSI. The precoding matrix is designed with maximization SLRINR as the criterion, and the CSI exchange required by joint precoding is limited to a single cell, which effectively increases the user SINR and reduces the complexity of the system. The simulation results show that, The algorithm can effectively suppress intra-cell and inter-cell interference, and can quickly converge. 3) the idea of multi-cell clustering is introduced into SLRINR IA, and a clustering interference alignment algorithm is proposed. Firstly, the algorithm is based on the intensity of interference between cells. Taking the maximization of intra-cluster interference as the criterion, the cell is divided into clusters, and then multi-layer interference management measures are adopted, that is, the SLRINR IAs with multiple main interference sources are adopted in the cluster, and the non-iterative alternating minimization interference alignment algorithm is used among the clusters. The simulation results show that, The algorithm can reduce the exchange capacity of CSI and reduce the complexity of the system.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN919.3

【參考文獻(xiàn)】

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

1 謝顯中;徐冰;雷維嘉;馬彬;;三小區(qū)環(huán)境中基于三角分解的低復(fù)雜度干擾對(duì)齊算法[J];電子與信息學(xué)報(bào);2013年05期

2 盧華兵;謝顯中;馬彬;雷維嘉;;多天線兩小區(qū)蜂窩系統(tǒng)的低開銷線性干擾對(duì)齊算法[J];信號(hào)處理;2012年08期

3 王敞;陳增強(qiáng);袁著祉;;基于遺傳算法的K均值聚類分析[J];計(jì)算機(jī)科學(xué);2003年02期

，

本文編號(hào)：1629606