On the achievable rates and degrees of freedom of causally cognitive MISO broadcast channels

Jun Sun, Yingzhuang Liu, Guangxi Zhu
{"title":"On the achievable rates and degrees of freedom of causally cognitive MISO broadcast channels","authors":"Jun Sun, Yingzhuang Liu, Guangxi Zhu","doi":"10.1109/WCSP.2013.6677283","DOIUrl":null,"url":null,"abstract":"This paper explores the problem of how a secondary transmitter could serve several users simultaneously by utilizing the spectrum of a primary system while imposing no impact on it (i.e. satisfying the coexistence constraint), even if the primary system keeps active all the time. The difficulty of this problem lies in that how the secondary system should tackle the interference encountered at multiple secondary receivers. In the cognitive transmission framework, the core of the above problem include two aspects: 1) How to learn quickly the message(s) of the primary system? 2) How to efficiently address the interference at multiple secondary receivers with the knowledge of the primary message? To solve these two problems, our main idea is to fully exploit the advantages of multiple antennas and the potential of transmitter cognition of the interfered message, in order to achieve the goal of fast exploration and full exploitation. In information theoretic terms, the above problem is equivalent to studying the achievable rate of the causally cognitive MISO broadcast channel under the so-called coexistence constraint. For this problem, we propose an efficient achievable scheme which is essentially based on the dirty paper coding and the zero-forcing beamforming and proves to be capable of realizing rather considerable sum rate and degrees of freedom for the secondary system. Our scheme exploits an interesting result regarding the capacity region of the MIMO Gaussian broadcast channel with states known only to the encoders.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Wireless Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2013.6677283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper explores the problem of how a secondary transmitter could serve several users simultaneously by utilizing the spectrum of a primary system while imposing no impact on it (i.e. satisfying the coexistence constraint), even if the primary system keeps active all the time. The difficulty of this problem lies in that how the secondary system should tackle the interference encountered at multiple secondary receivers. In the cognitive transmission framework, the core of the above problem include two aspects: 1) How to learn quickly the message(s) of the primary system? 2) How to efficiently address the interference at multiple secondary receivers with the knowledge of the primary message? To solve these two problems, our main idea is to fully exploit the advantages of multiple antennas and the potential of transmitter cognition of the interfered message, in order to achieve the goal of fast exploration and full exploitation. In information theoretic terms, the above problem is equivalent to studying the achievable rate of the causally cognitive MISO broadcast channel under the so-called coexistence constraint. For this problem, we propose an efficient achievable scheme which is essentially based on the dirty paper coding and the zero-forcing beamforming and proves to be capable of realizing rather considerable sum rate and degrees of freedom for the secondary system. Our scheme exploits an interesting result regarding the capacity region of the MIMO Gaussian broadcast channel with states known only to the encoders.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
因果认知MISO广播频道的可实现速率和自由度
本文探讨了一个辅助发射机如何在不影响主系统的情况下,利用主系统的频谱同时为多个用户服务(即满足共存约束),即使主系统一直保持活跃状态。该问题的难点在于辅助系统如何处理在多个辅助接收机处遇到的干扰。在认知传递框架中,上述问题的核心包括两个方面:1)如何快速学习主系统的信息?2)如何在了解主消息的情况下有效地解决多个辅助接收机的干扰?为了解决这两个问题,我们的主要思路是充分利用多天线的优势和发射机对受干扰报文的认知潜力,以达到快速探索和充分开发的目的。用信息论的术语来说,上述问题相当于研究在所谓共存约束下因果认知MISO广播信道的可达速率。针对这一问题,我们提出了一种有效的可实现方案,该方案主要基于脏纸编码和零强迫波束形成,并证明能够实现相当大的二次系统和速率和自由度。我们的方案利用了一个有趣的结果,关于MIMO高斯广播信道的容量区域,其状态仅为编码器所知。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Queueing analysis for block fading Rayleigh channels in the low SNR regime Doppler rate estimation for OFDM based communication systems in high mobility A new multi-channel loudness compensation method based on high frequency compression and shift for digital hearing aids Robust blind channel equalization based on input decision information Time-domain-cascade-correlation Timing Advance estimation method in LTE-A super coverage
×
引用
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