Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems

Zhong, Yangfan; Alajaji, Fady; Campbell, L. L.

doi:10.1109/tit.2009.2013018

Cited by 5 publications

(7 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 1: Given arbitrary and finite alphabet T , for any P T UX ∈ P(T × U × X ), the following exponent pair is universally achievable, (10) and…”

Section: Achievable Exponents and A Lower Bound For E Jmentioning

confidence: 99%

“…where E(·, ·, W Y Z|UX ) is the corresponding channel coding error exponent for the asymmetric 2-user channel (refer to [10] for the formal definition).…”

Section: The Upper Bound To E Jmentioning

confidence: 99%

“…Similarly, Theorems 1-3 apply to the CS-ABC system. The readers may refer to [10] for the full details. 2 , where 0 < q < 1/2, and a binary AMAC W Y |UX with binary additive noise P F (F = 1) = ǫ (0 < ǫ < 1/2) and output described by Y i = U i ⊕X i ⊕F i (mod 2), Y = U = X = F = {0, 1}, and F i is independent of X i and U i , i = 1, 2, ..., n. In Fig.…”

Section: Applications To Cs-amac and Cs-abc Systemsmentioning

confidence: 99%

“…In Section V, we briefly discuss applications to the CS-AMAC and the CS-ABC systems. All details and proofs are available in [10].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems

Zhong

Alajaji

Campbell

2007

2007 IEEE International Symposium on Information Theory

Self Cite

View full text Add to dashboard Cite

Abstract-Consider transmitting two discrete memoryless correlated sources, consisting of a common and a private source, over a discrete memoryless multi-terminal channel with two transmitters and two receivers. At the transmitter side, the common source is observed by both encoders but the private source can only be accessed by one encoder. At the receiver side, both decoders need to reconstruct the common source, but only one decoder needs to reconstruct the private source. We hence refer to this system by the asymmetric 2-user source-channel system. In this work, we derive a universally achievable joint source-channel coding (JSCC) error exponent pair for the 2-user system by using a technique which generalizes Csiszár's method [3] for the pointto-point (single-user) discrete memoryless source-channel system. We next investigate the largest convergence rate of asymptotic exponential decay of the system (overall) probability of erroneous transmission, i.e., the system JSCC error exponent. We obtain lower and upper bounds for the exponent. As a consequence, we establish the JSCC theorem with single letter characterization.

show abstract

“…Theorem 1: Given arbitrary and finite alphabet T , for any P T UX ∈ P(T × U × X ), the following exponent pair is universally achievable, (10) and…”

Section: Achievable Exponents and A Lower Bound For E Jmentioning

confidence: 99%

“…where E(·, ·, W Y Z|UX ) is the corresponding channel coding error exponent for the asymmetric 2-user channel (refer to [10] for the formal definition).…”

Section: The Upper Bound To E Jmentioning

confidence: 99%

Section: Applications To Cs-amac and Cs-abc Systemsmentioning

confidence: 99%

“…In Section V, we briefly discuss applications to the CS-AMAC and the CS-ABC systems. All details and proofs are available in [10].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems

Zhong

Alajaji

Campbell

2007

2007 IEEE International Symposium on Information Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…Campo et al [3] analyze Csiszár's JSCC exponent in greater detail. A multiterminal generalization of the JSCC result in [5] appears in Zhong et al [19]. We are not aware of error exponent results in the literature for the JSCC problem for multiple access channels (MACs) when the senders encode, independently of each other, independent DMSs assigned to them, and the receiver has to give reliable estimates of both sources.…”

Section: Introductionmentioning

confidence: 99%

Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

Farkas

Koi

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

A new universal coding/decoding scheme for random access with collision detection is given in case of two senders. The result is used to give achievable joint sourcechannel coding error exponents for multiple access channel and independent sources. In a modified model admitting zero rate communication between the senders, an improved exponent is derived, of form similar to Csiszár's joint source-channel exponent for the one-sender case.

show abstract

On the capacity of the cognitive Z-interference channel

Vaezi

2011

2011 12th Canadian Workshop on Information Theory

View full text Add to dashboard Cite

Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Coding Systems

Cited by 5 publications

References 24 publications

Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems

Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel Systems

Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

On the capacity of the cognitive Z-interference channel

Contact Info

Product

Resources

About