本文選題：干擾對齊 + MIMO-MAC�。� 參考：《電子學報》2017年03期

【摘要】：針對2小區(qū)MIMO-MAC中傳統(tǒng)有限反饋干擾對齊碼字選擇方案的不足,本文提出了一種最大化用戶速率下界的直接碼字選擇方案,并結合比特分配算法來減少和速率的損失,同時采用最大信干擾算法譯碼.不同于傳統(tǒng)的基于最小弦距離或對齊度準則來選擇碼字,本文從最大化用戶速率下界的角度來選擇的碼字;進一步地,在格拉斯曼空間中生成與期望預編碼接近的碼字集合,在該集合中只需簡單的搜索便可找到優(yōu)化的碼字組合,同時實現(xiàn)了低復雜度和次優(yōu)的全局搜索.仿真實驗表明,相對于現(xiàn)有的典型算法,本文算法在提升系統(tǒng)和速率的同時,也提高了系統(tǒng)用戶速率的下界.
[Abstract]:Aiming at the deficiency of traditional limited feedback interference alignment codeword selection scheme in 2 cell MIMO-MAC, this paper proposes a direct codeword selection scheme that maximizes the lower bound of user rate, and combines bit allocation algorithm to reduce the loss of sum rate. At the same time, the maximum signal interference algorithm is used to decode. Different from the traditional codeword selection based on the minimum chord distance or alignment criterion, this paper selects the codeword from the angle of maximizing the lower bound of the user rate, and further, generates the code word set in Glassmann space, which is close to the expected precoding. In this set, a simple search is needed to find the optimized combination of codewords, and a low complexity and sub-optimal global search is realized at the same time. The simulation results show that the proposed algorithm not only improves the system and speed, but also improves the lower bound of the system user rate.
【作者單位】： 重慶郵電大學個人通信研究所;
【基金】：國家自然科學基金(No.61271259,No.61471076) 重慶市教委科學技術研究項目(No.KJ120501,No.KJ130536) 長江學者和創(chuàng)新團隊發(fā)展計劃(No.IRT1299) 重慶市科委重點實驗室專項經(jīng)費(CSTC)資助課題
【分類號】：TN919.3
，

本文編號：1826166