2015/10/26 by Nikola Zlatanov, Erik Sippel, Zlatanov, Nikola +5
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Full-Duplex Wireless Communications #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1510.07394
openalex publication_date 2015/10/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we investigate the capacity of the Gaussian two-hop\nfull-duplex (FD) relay channel with residual self-interference. This channel is\ncomprised of a source, an FD relay, and a destination, where a direct\nsource-destination link does not exist and the FD relay is impaired by residual\nself-interference. We adopt the worst-case linear self-interference model with\nrespect to the channel capacity, and model the residual self-interference as a\nGaussian random variable whose variance depends on the amplitude of the\ntransmit symbol of the relay. For this channel, we derive the capacity and\npropose an explicit capacity-achieving coding scheme. Thereby, we show that the\noptimal input distribution at the source is Gaussian and its variance depends\non the amplitude of the transmit symbol of the relay. On the other hand, the\noptimal input distribution at the relay is discrete or Gaussian, where the\nlatter case occurs only when the relay-destination link is the bottleneck link.\nThe derived capacity converges to the capacity of the two-hop ideal FD relay\nchannel without self-interference and to the capacity of the two-hop\nhalf-duplex (HD) relay channel in the limiting cases when the residual\nself-interference is zero and infinite, respectively. Our numerical results\nshow that significant performance gains are achieved with the proposed\ncapacity-achieving coding scheme compared to the achievable rates of\nconventional HD relaying and/or conventional FD relaying.\n