Robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels with imperfect CSI

Huang Huang, V. Lau, Yinggang Du, Sheng Liu
{"title":"Robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels with imperfect CSI","authors":"Huang Huang, V. Lau, Yinggang Du, Sheng Liu","doi":"10.1109/ISIT.2010.5513781","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels. The traditional interference alignment on the signal space is infeasible for K > 3 and perfect channel state information (CSI) is required for all the alignment schemes in the literature, which is impractical in practice. Furthermore, the structured lattice, widely used in the practical communications, can create a structured interference space compared with random Gaussian symbols. However, the existing alignment schemes on the lattice codes either require infinite SNR or require symmetric interference channel coefficients. Furthermore, they all assume perfect CSI knowledge. In this paper, we propose an approximate lattice alignment scheme for general complex interference channels in the general SNR regimes as well as a two-stage decoding algorithm to decode the desired signal from the approximated structured interference space. We derive the achievable data rate based on the approximate lattice alignment scheme and formulated the precoder, equalizer as well as the interference quantization design as a mixed integer and continuous optimization problem. By exploiting specific problem structures and incorporating CSI errors in the design, we derive low complexity robust solutions. We show that the proposed scheme has significant gain compared with the existing baselines.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2010.5513781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we consider a robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels. The traditional interference alignment on the signal space is infeasible for K > 3 and perfect channel state information (CSI) is required for all the alignment schemes in the literature, which is impractical in practice. Furthermore, the structured lattice, widely used in the practical communications, can create a structured interference space compared with random Gaussian symbols. However, the existing alignment schemes on the lattice codes either require infinite SNR or require symmetric interference channel coefficients. Furthermore, they all assume perfect CSI knowledge. In this paper, we propose an approximate lattice alignment scheme for general complex interference channels in the general SNR regimes as well as a two-stage decoding algorithm to decode the desired signal from the approximated structured interference space. We derive the achievable data rate based on the approximate lattice alignment scheme and formulated the precoder, equalizer as well as the interference quantization design as a mixed integer and continuous optimization problem. By exploiting specific problem structures and incorporating CSI errors in the design, we derive low complexity robust solutions. We show that the proposed scheme has significant gain compared with the existing baselines.
具有不完全CSI的k对准静态MIMO干涉信道鲁棒近似点阵对准设计
本文研究了k对准静态MIMO干涉信道的鲁棒近似点阵对准设计。传统的信号空间干扰对准方法对于kbbbb3是不可行的,文献中的所有对准方案都需要完美的信道状态信息(CSI),这在实际应用中是不现实的。此外,与随机高斯符号相比,在实际通信中广泛应用的结构化晶格可以产生结构化的干扰空间。然而,现有的点阵码对准方案要么要求无限信噪比,要么要求对称干涉信道系数。此外,他们都假定有完善的CSI知识。在本文中,我们提出了在一般信噪比条件下的一般复杂干扰信道的近似点阵对准方案,以及从近似结构化干扰空间中解码所需信号的两阶段解码算法。我们推导了基于近似点阵对齐方案的可实现数据率,并将预编码器、均衡器和干扰量化设计作为一个混合整数和连续优化问题来制定。通过利用特定的问题结构并将CSI误差纳入设计中,我们得出了低复杂性的鲁棒解决方案。我们表明,与现有基线相比,所提出的方案具有显着的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信