Random Coding Error Exponents for the Two-User Interference Channel

DOI10.1109/TIT.2016.2630707zbMATH Open1364.94237arXiv1503.02389OpenAlexW2963404170MaRDI QIDQ2989638FDOQ2989638

Neri Merhav, Wasim Huleihel

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper is about deriving lower bounds on the error exponents for the two-user interference channel under the random coding regime for several ensembles. Specifically, we first analyze the standard random coding ensemble, where the codebooks are comprised of independently and identically distributed (i.i.d.) codewords. For this ensemble, we focus on optimum decoding, which is in contrast to other, suboptimal decoding rules that have been used in the literature (e.g., joint typicality decoding, treating interference as noise, etc.). The fact that the interfering signal is a codeword, rather than an i.i.d. noise process, complicates the application of conventional techniques of performance analysis of the optimum decoder. Also, unfortunately, these conventional techniques result in loose bounds. Using analytical tools rooted in statistical physics, as well as advanced union bounds, we derive single-letter formulas for the random coding error exponents. We compare our results with the best known lower bound on the error exponent, and show that our exponents can be strictly better. Then, in the second part of this paper, we consider more complicated coding ensembles, and find a lower bound on the error exponent associated with the celebrated Han-Kobayashi (HK) random coding ensemble, which is based on superposition coding.

Full work available at URL: https://arxiv.org/abs/1503.02389

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Cited In (5)

• Error Event Characterization on 2-D ISI Channels
• The Two-User Compound Interference Channel
• Title not available (Why is that?)
• Error Exponents of Optimum Decoding for the Interference Channel
• Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

This page was built for publication: Random Coding Error Exponents for the Two-User Interference Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989638)