Partially Connected Multi-cell Interference Broadcast Channels Based Iterative Interference Alignment with Imperfect Channel Knowledge

Y. Wang, Zhong-pei Zhang
{"title":"Partially Connected Multi-cell Interference Broadcast Channels Based Iterative Interference Alignment with Imperfect Channel Knowledge","authors":"Y. Wang, Zhong-pei Zhang","doi":"10.1109/DASC.2013.144","DOIUrl":null,"url":null,"abstract":"Interference alignment (IA) has been proved in theory that it can be achievable in a partially connected multi-cell MIMO interfering broadcast channels (IBC) network of arbitrary size, while the signaling dimension of each transmit and receive antennas pair between base station (BS) and user remains bound. For this applicable significance, based on the L-interfering MIMO IBC model, two iterative IA algorithms are presented to solve the alignment problem for this type of network in this paper. Then the feasibility conditions and the impact of channel knowledge imperfection for the proposed algorithms are analyzed. Simulations show that, with a finite antenna number per transmitter and receiver pair, the proposed algorithms can achieve the optimal degrees of freedom (DoF) and can be applied to a partially connected multi-cell MIMO IBC network with arbitrary number of cells and users per cell. Meanwhile, the proposed algorithms are sensitive to imperfect channel knowledge, especially in high SNR region.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"42 1-2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Interference alignment (IA) has been proved in theory that it can be achievable in a partially connected multi-cell MIMO interfering broadcast channels (IBC) network of arbitrary size, while the signaling dimension of each transmit and receive antennas pair between base station (BS) and user remains bound. For this applicable significance, based on the L-interfering MIMO IBC model, two iterative IA algorithms are presented to solve the alignment problem for this type of network in this paper. Then the feasibility conditions and the impact of channel knowledge imperfection for the proposed algorithms are analyzed. Simulations show that, with a finite antenna number per transmitter and receiver pair, the proposed algorithms can achieve the optimal degrees of freedom (DoF) and can be applied to a partially connected multi-cell MIMO IBC network with arbitrary number of cells and users per cell. Meanwhile, the proposed algorithms are sensitive to imperfect channel knowledge, especially in high SNR region.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于不完全信道知识的部分连接多小区干扰广播信道迭代干扰对准
理论上证明,在任意大小的部分连接多小区MIMO干扰广播信道(IBC)网络中,在基站与用户之间的每个发射和接收天线对的信令维数不变的情况下,干扰对准(IA)是可以实现的。鉴于这一适用意义,本文基于l - interference MIMO IBC模型,提出了两种迭代IA算法来解决这类网络的对准问题。然后分析了算法的可行性条件和信道知识不完全性对算法的影响。仿真结果表明,在发射器和接收器对天线数量有限的情况下,所提出的算法可以实现最优自由度(DoF),并且可以应用于具有任意小区数量和用户数量的部分连接多小区MIMO IBC网络。同时,该算法对信道知识不完全敏感,特别是在高信噪比区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Improved Algorithm for Dynamic Cognitive Extraction Based on Fuzzy Rough Set An Improved Search Algorithm Based on Path Compression for Complex Network Dynamic Spectrum Sensing for Energy Harvesting Wireless Sensor Study and Application of Dynamic Collocation of Variable Weights Combination Forecasting Model A Multicast Routing Algorithm for GEO/LEO Satellite IP Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1