Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmitters

A. Haghi, Neda Mohammadizadeh, A. Khandani
{"title":"Delay in cooperative communications: Higher multiplexing gain in Gaussian interference channels with full-duplex transmitters","authors":"A. Haghi, Neda Mohammadizadeh, A. Khandani","doi":"10.1109/ALLERTON.2015.7447185","DOIUrl":null,"url":null,"abstract":"Delay, guaranteeing causality, is inevitable in cooperative communication systems. Traditionally, delay granularity has been limited to one symbol; however, channel delay is in fact governed by channel memory and can be shorter. For example, the delay requirement in orthogonal frequency-division multiplexing (OFDM), captured in the cyclic prefix, is typically much shorter than the OFDM symbol itself. This perspective is used to study the two-user Gaussian interference channel with full-duplex transmitters. By superimposing the signal from the other node on its own signal, each transmitter cancels the interference at its receiver. Among other results, it is shown that under a mild condition, the maximum multiplexing gain of this channel is in fact two, rather than the limit of one, previously proved under the traditional constraint of causal delay [1]. Further, the optimal power allocation among orthogonal sub-carriers, which maximizes the achievable sum-rate, is shown to be a generalization of the well-known water filling.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447185","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Delay, guaranteeing causality, is inevitable in cooperative communication systems. Traditionally, delay granularity has been limited to one symbol; however, channel delay is in fact governed by channel memory and can be shorter. For example, the delay requirement in orthogonal frequency-division multiplexing (OFDM), captured in the cyclic prefix, is typically much shorter than the OFDM symbol itself. This perspective is used to study the two-user Gaussian interference channel with full-duplex transmitters. By superimposing the signal from the other node on its own signal, each transmitter cancels the interference at its receiver. Among other results, it is shown that under a mild condition, the maximum multiplexing gain of this channel is in fact two, rather than the limit of one, previously proved under the traditional constraint of causal delay [1]. Further, the optimal power allocation among orthogonal sub-carriers, which maximizes the achievable sum-rate, is shown to be a generalization of the well-known water filling.
协作通信中的延迟:全双工发射机高斯干扰信道中更高的多路复用增益
在协作通信系统中,延迟是不可避免的,它保证了因果关系。传统上,延迟粒度仅限于一个符号;然而,信道延迟实际上是由信道内存控制的,可以更短。例如,在正交频分复用(OFDM)中,在循环前缀中捕获的延迟要求通常比OFDM符号本身短得多。用这一视角研究了全双工发射机的双用户高斯干扰信道。通过将来自另一个节点的信号叠加到自己的信号上,每个发射机都抵消了来自其接收器的干扰。结果表明,在温和条件下,该信道的最大复用增益实际上是2,而不是之前在传统因果延迟约束下证明的1的极限[1]。此外,正交子载波之间的最优功率分配,使可实现的和速率最大化,被证明是众所周知的水填充的推广。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信