Computer Science – Information Theory
Scientific paper
2008-10-10
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory, Oct 7, 2008
Scientific paper
Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an i.i.d. noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis.
Etkin Raul
Merhav Neri
Ordentlich Erik
No associations
LandOfFree
Error Exponents of Optimum Decoding for the Interference Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Error Exponents of Optimum Decoding for the Interference Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error Exponents of Optimum Decoding for the Interference Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-449005