{"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.