1. On the Capacity of Symmetric $M$-user Gaussian Interference Channels with Feedback
- Author
-
Lan V. Truong, Hirosuke Yamamoto, Truong, LV [0000-0002-7756-3464], Yamamoto, H [0000-0001-6297-8838], and Apollo - University of Cambridge Repository
- Subjects
Imagination ,FOS: Computer and information sciences ,media_common.quotation_subject ,Computer Science - Information Theory ,02 engineering and technology ,Library and Information Sciences ,Topology ,Channel capacity ,Search engine ,4613 Theory Of Computation ,46 Information and Computing Sciences ,Lattice (order) ,0202 electrical engineering, electronic engineering, information engineering ,Mathematics ,media_common ,40 Engineering ,Computer Science::Information Theory ,Channel code ,Information Theory (cs.IT) ,020206 networking & telecommunications ,Gaussian interference ,Computer Science Applications ,Decoding methods ,4006 Communications Engineering ,Information Systems ,Coding (social sciences) - Abstract
A general time-varying feedback coding scheme is proposed for $M$-user fully connected symmetric Gaussian interference channels. Based on the analysis of the general coding scheme, we prove a theorem which gives a criterion for designing good time-varying feedback codes for Gaussian interference channels. The proposed scheme improves the Suh-Tse and Kramer inner bounds of the channel capacity for the cases of weak and not very strong interference when $M=2$. This capacity improvement is more significant when the signal-to-noise ratio (SNR) is not very high. In addition, our coding scheme can be proved mathematically and numerically to outperform the Kramer code for $M\geq 2$ when Signal to Noise Ratio (SNR) is equal to Interference to Noise Ratio (INR). Besides, the generalized degrees-of-freedom (GDoF) of our proposed coding scheme can be proved to be optimal in the all network situations (very weak, weak, strong, very strong) for any $M$. The numerical results show that our coding scheme can attain better performance than the Suh-Tse coding scheme for $M=2$ or the Mohajer-Tandon-Poor lattice coding scheme for $M>2$. Furthermore, the simplicity of the encoding/decoding algorithms is another strong point of our proposed coding scheme compared with the Suh-Tse coding scheme when $M=2$ and the Mohajer-Tandon-Poor lattice coding scheme when $M>2$. More importantly, our results show that an optimal coding scheme for the symmetric Gaussian interference channels with feedback can be achieved by only using marginal posterior distributions under a better cooperation strategy between transmitters., Accepted to IEEE Transactions on Information Theory in Sept. 2019
- Published
- 2018