Title :
A new sphere-packing bound for maximal error exponent for multiple-access channels
Author :
Nazari, Ali ; Pradhan, S. Sandeep ; Anastasopoulos, Achilleas
Author_Institution :
Electr. Eng. & Comput. Sci. Dept., Univ. of Michigan, Ann Arbor, MI
Abstract :
In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the userspsila input distributions (conditioned on the time-sharing auxiliary variable) and thus results in a tighter sphere-packing exponent when compared to the tightest known exponent derived by Haroutunian.
Keywords :
error statistics; multi-access systems; discrete memoryless; error probability; maximal error exponent; multiple-access channels; sphere-packing; time-sharing auxiliary variable; Computer errors; Computer science; Delta modulation; Electrostatic precipitators; Error probability; Information theory; Random variables; Stochastic processes; Testing; Time sharing computer systems;
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
DOI :
10.1109/ISIT.2008.4595240
