Full-duplex communications for wireless links with asymmetric capacity requirements

Orion Afisiadis, A. Austin, Alexios Balatsoukas-Stimming, A. Burg
{"title":"Full-duplex communications for wireless links with asymmetric capacity requirements","authors":"Orion Afisiadis, A. Austin, Alexios Balatsoukas-Stimming, A. Burg","doi":"10.1109/ACSSC.2017.8335646","DOIUrl":null,"url":null,"abstract":"Asymmetric capacity requirements between the uplink and down-link channels are common in many communication standards and are usually satisfied by using time-division or frequency-division duplexing with asymmetric resource allocation. In-band full-duplex communication can reduce the overhead associated with the aforementioned duplexing methods, but, unfortunately, practical full-duplex systems suffer from residual self-interference. However, in asymmetric links the impact of residual self-interference can be partially mitigated by reducing the transmit powers with the goal of maximising the down-link capacity. Compared to time-division half-duplex systems, it is found that power-adjusted full-duplex operation can improve the down-link capacity of an asymmetric IEEE 802.11 system by 20% at a link distance of 10 m, even with pessimistic assumptions on the achievable amount of self-interference suppression. For highly asymmetric traffic, the operation range where a full-duplex system outperforms a corresponding time-division half-duplex system can extend up to 2 km, covering a typical urban LTE macro-cell.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Asymmetric capacity requirements between the uplink and down-link channels are common in many communication standards and are usually satisfied by using time-division or frequency-division duplexing with asymmetric resource allocation. In-band full-duplex communication can reduce the overhead associated with the aforementioned duplexing methods, but, unfortunately, practical full-duplex systems suffer from residual self-interference. However, in asymmetric links the impact of residual self-interference can be partially mitigated by reducing the transmit powers with the goal of maximising the down-link capacity. Compared to time-division half-duplex systems, it is found that power-adjusted full-duplex operation can improve the down-link capacity of an asymmetric IEEE 802.11 system by 20% at a link distance of 10 m, even with pessimistic assumptions on the achievable amount of self-interference suppression. For highly asymmetric traffic, the operation range where a full-duplex system outperforms a corresponding time-division half-duplex system can extend up to 2 km, covering a typical urban LTE macro-cell.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有非对称容量要求的无线链路的全双工通信
在许多通信标准中,上下行信道的容量要求都是不对称的,通常采用不对称资源分配的时分或频分双工来满足这种要求。带内全双工通信可以减少与上述双工方法相关的开销,但不幸的是,实际的全双工系统受到残余自干扰的影响。然而,在非对称链路中,残余自干扰的影响可以通过降低发射功率以最大化下行链路容量来部分减轻。与时分半双工系统相比,即使对可实现的自干扰抑制量进行悲观假设,功率调整全双工操作也可以使非对称IEEE 802.11系统在链路距离为10 m时的下行链路容量提高20%。对于高度不对称的业务,全双工系统优于相应的时分半双工系统的操作范围可以扩展到2公里,覆盖典型的城市LTE宏小区。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
milliProxy: A TCP proxy architecture for 5G mmWave cellular systems Joint user scheduling and power optimization in full-duplex cells with successive interference cancellation Deep neural network architectures for modulation classification Towards provably invisible network flow fingerprints Seeded graph matching: Efficient algorithms and theoretical guarantees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1