On the sum capacity of Poisson Z-interference channels

Lifeng Lai, Yingbin Liang, Shlomo Shamai Shitz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

In this paper, the sum capacity of the Poisson Z-interference channel that models optical communication systems with multiple transceivers is investigated. First, the capacity region of the Poisson Z-interference channel is shown to remain the same if we approximate the Poisson Z-interference channel with a discrete time memoryless binary input binary output Z-interference channel. Second, building on this result, the sum capacity of the Poisson Z-interference channel when the cross link coefficient is either sufficiently small or sufficiently large is characterized. When the cross link coefficient is sufficiently small, the sum capacity is achieved by treating interfering signal (if any) as noise. However, unlike the Gaussian Z-interference channel, the user not experiencing the interference does not necessarily transmit at its largest possible rate to achieve the sum capacity. When the cross link coefficient is sufficiently large, the sum capacity is achieved by letting the user experiencing the interference decode both messages.

Original languageEnglish (US)
Title of host publication2013 IEEE/CIC International Conference on Communications in China, ICCC 2013
Pages600-604
Number of pages5
DOIs
StatePublished - Dec 1 2013
Event2013 IEEE/CIC International Conference on Communications in China, ICCC 2013 - Xi'an, China
Duration: Aug 12 2013Aug 14 2013

Publication series

Name2013 IEEE/CIC International Conference on Communications in China, ICCC 2013

Other

Other2013 IEEE/CIC International Conference on Communications in China, ICCC 2013
CountryChina
CityXi'an
Period8/12/138/14/13

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'On the sum capacity of Poisson Z-interference channels'. Together they form a unique fingerprint.

Cite this