Achievable schemes on Z-interference channels with finite conferencing link

Abstract

The development of communication technology has led to modern cellular communication systems. In all these systems, interference harms the performance of cell-edge users the most and so the understanding of the methods that can overcome interference to the cell-edge users has become important. In this regard, there has been intensive research on transmitter conferencing these days. In this context, we study an achievable scheme for Z-interference channel(Z-IC) with finite conferencing link (FCL) using well-known Gel`pand--Pinsker`s coding (GPC) scheme. Many researchers have studied ``cognitive`` channel having infinite conferencing link. However there are very few results on finite conferencing link. Thus, we study a rate region of an achievable scheme for discrete memoryless (DM) Z-IC with FCL. Our achievable scheme is primarily based on GPC and Han and Kobayashi message splitting method. First of all, we study an achievable scheme of Z-IC with FCL using single GPC. We derive the rate region for DM Z-IC with FCL. In addition, we show that this region is larger than the rate region without conferencing in Gaussian case and it coincides with the cognitive Z-IC region when the capacity of conferencing link is infinite. Finally, we suggest another achievable scheme for Z-IC with FCL, which uses double GPC. It is based on the result of dirty multiple access channel (dirty MAC). We apply this scheme to Z-IC with FCL and derive the rate region for DM Z-IC with FCL.