DeepAI AI Chat
Log In Sign Up

Multiple-Access Channel with Independent Sources: Error Exponent Analysis

by   Arezou Rezazadeh, et al.
Universitat Pompeu Fabra

In this paper, an achievable error exponent for the multiple-access channel with two independent sources is derived. For each user, the source messages are partitioned into two classes and codebooks are generated by drawing codewords from an input distribution depending on the class index of the source message. The partitioning thresholds that maximize the achievable exponent are given by the solution of a system of equations. We also derive both lower and upper bounds for the achievable exponent in terms of Gallager's source and channel functions. Finally, a numerical example shows that using the proposed ensemble gives a noticeable gain in terms of exponent with respect to independent identically distributed codebooks.


page 1

page 2

page 3

page 4


Joint Source-Channel Coding for the Multiple-Access Channel with Correlated Sources

This paper studies the random-coding exponent of joint source-channel co...

Equating the achievable exponent region to the achievable entropy region by partitioning the source

In this paper we investigate the image size characterization problem. We...

Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels

An asynchronous multiple access error exponent result implicates a new r...

Achievable Error Exponents of One-Way and Two-Way AWGN Channels

Achievable error exponents for the one-way with noisy feedback and two-w...

A Generalization of the DMC

We consider a generalization of the discrete memoryless channel, in whic...

Noisy Guesses

We consider the problem of guessing a random, finite-alphabet, secret n-...