Title :
On the capacity of some uncoordinated multiple-access channels
Author_Institution :
Essen Univ., Germany
Abstract :
We consider uncoordinated multiple-access. Here, a number of transmitter-receiver pairs operate independently over a common channel and regard the transmissions of the remaining users as random noise. It is shown, that for the uncoordinated binary adder channel, the capacity is upper bounded by 1/ln 2 bits/transmission and does not grow logarithmically with the number of users as it does in the coordinated case. An asymptotic lower bound for the capacity is given. Further examples of uncoordinated channels are studied
Keywords :
multi-access systems; multiuser channels; random noise; asymptotic lower bound; capacity; number of users; random noise; transmitter-receiver pairs; uncoordinated binary adder channel; uncoordinated multiple-access channels; Channel capacity; Communications technology; Decoding; Digital communication; Mutual information; Transmitters; Viterbi algorithm;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866329