Multiple Access Channels.
Abstract
The author considers a general multiple access communication system with several transmitters communicating with one receiver over a common channel. The message output from any transmitter is independent from the message outputs from any other transmitters. Shannon's coding theorem shows that, for a conventional communication system with one transmitter and one receiver, there exists a capacity C for a given channel, and that communications can be achieved with an arbitrarily small probability of error for any rate R smaller than C. The converse to the coding theorem shows that for any rate R greater than C, it is impossible to make the probability of error arbitrarily small. In the report, the author determines a set of rates, the capacity region, which allow each transmitter to communicate with the receiver with an arbitrarily small probability of error. It is shown that for any set of rates outside the capacity region, the probability of error cannot be made arbitrarily small. In other words, the author extends Shannon's coding theorem and its converse to a coding theorem and a converse for multiple access channels. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1972
- Accession Number
- AD0753127
Entities
People
- Henry Herng-jiunn Liao
Organizations
- University of Hawaiʻi System