Please use this identifier to cite or link to this item:
|Title:||Capacity theorems for the "Z" channel||Authors:||Chong, H.-F.
|Keywords:||"Z" channel (ZC)
Gaussian "Z" channel (ZC)
|Issue Date:||Apr-2007||Citation:||Chong, H.-F., Motani, M., Garg, H.K. (2007-04). Capacity theorems for the "Z" channel. IEEE Transactions on Information Theory 53 (4) : 1348-1365. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2006.890779||Abstract:||We consider the two-user "Z" channel (ZC), where there are two senders and two receivers. One of the senders transmits information to its intended receiver (without interfering with the unintended receiver), while the other sender transmits information to both receivers. The complete characterization of the discrete memoryless ZC remains unknown to date. For the Gaussian ZC, the capacity has only been established for a crossover link gain of 1. In this work, we study both the discrete memoryless ZC and the Gaussian ZC. We first establish achievable rates for the general discrete memoryless ZC. The coding strategy uses rate-splitting and superposition coding at the sender with information for both receivers. At the receivers, we use joint decoding. We then specialize the rates obtained to two different types of degraded discrete memoryless ZCs and also derive respective outer bounds to their capacity regions. We show that as long as a certain condition is satisfied, the achievable rate region is the capacity region for one type of degraded discrete memoryless ZC. The results are then extended to the two-user Gaussian ZC with different crossover link gains. We determine an outer bound to the capacity region of the Gaussian ZC with strong crossover link gain and establish the capacity region for moderately strong crossover link gain. © 2007 IEEE.||Source Title:||IEEE Transactions on Information Theory||URI:||http://scholarbank.nus.edu.sg/handle/10635/55252||ISSN:||00189448||DOI:||10.1109/TIT.2006.890779|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 7, 2020
WEB OF SCIENCETM
checked on Aug 7, 2020
checked on Aug 3, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.