Error Exponent for Discrete Memoryless Multiple-Access Channels.

Network Information Theory;Method of Types;Typical Sequences;Spehre Packing;Random Coding;Multiple-Access Channels;Error Exponent;Electrical Engineering;Engineering;Electrical Engineering: Systems

Nazari, AliNeuhoff, David L. ;

University of Michigan

关键词: Network Information Theory;    Method of Types;    Typical Sequences;    Spehre Packing;    Random Coding;    Multiple-Access Channels;    Error Exponent;    Electrical Engineering;    Engineering;    Electrical Engineering: Systems;   

Others  :  https://deepblue.lib.umich.edu/bitstream/handle/2027.42/86432/anazari_1.pdf?sequence=1&isAllowed=y

瑞士|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

This work addresses the problem of analyzing the best possible systems for communicating over a multiple-access channel (MAC) without feedback in the discrete memoryless setting. We consider theerror exponents for this channel model and obtain upper and lower bounds on the channel reliability function. In particular, a unified framework to obtain all known upper and lower bounds on thereliability function of a point-to-point discrete memoryless channel is developed. By using a similar idea with a two-user discrete memoryless multiple-access channel, three lower bounds and two upper bounds on the reliability function are derived. To obtain upper bounds on the reliability function for DM-MACs, we formallycharacterize the typicality graph and look at some subgraph containment problems. Finally, a method to derive new bounds on theaverage/maximal error exponent by using known bounds on the maximal/average error exponent is obtained.