An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes
复制标题
DOI：
10.1109/tit.2016.2518171
复制
发表时间：
2016-03-01
影响因子：
2.5
通讯作者：
Pradhan, S. Sandeep
中科院分区：
文献类型：
--
作者：
Padakandla, Arun;Sahebi, Aria G.;Pradhan, S. Sandeep
我们考虑了三用户离散无内存干扰通道（3-IC）的通信问题。通过任意3-IC进行通信的当前已知编码技术基于消息分裂，叠加编码和使用独立和相同分布式（I.I.D.）随机代码簿的框架。在本文中，我们提出了一个新的代码分区固定代码（PCC）的集合 - 具有适当的经验和代数闭合特性的混合。我们开发了利用PCC代数闭合特性的编码技术，以使对一般3-IC的干扰一致性。我们分析了提出的编码技术的性能，以得出一般离散3-IC的可实现速率区域。确定了添加剂和非添加示例，其可实现的速率区域是能力，而且严格比基于I.I.D的当前已知最大可实现的速率区域大。随机代码手册。
We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes-partitioned coset codes (PCCs)-that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks.