Results 211 to 220 of about 984,044 (258)

Channel configuration of multiple-access channel

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
This paper investigates the channel configuration of multiple-access channel (MAC) by decomposing the MAC into finite subMAC and also proves that there exists an input probability that achieves boundary of a capacity region and the total capacity of the original MAC.
Yoichiro Watanabe, Koichi Kamoi
openaire   +1 more source

Channel-hopping multiple access

2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2000
The medium-access control (MAC) protocols for wireless networks proposed or implemented to date based on collision-avoidance handshakes between the sender and receiver either require carrier sensing or the assignment of unique codes to nodes to ensure that intended receivers hear data packets without interference from hidden sources.
Asimakis Tzamaloukas, J. J. Garcia-Luna-Aceves   +1 more
openaire   +2 more sources

Cognitive access algorithms for multiple access channels

2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2013
This paper considers a multiple access fading channel where each terminal has a different belief about the channel states and adapts its transmission policy to the belief. In this setting, frequency division multiple access (FDMA) and channel aware random access (RA) are two special cases.
Yichuan Hu, Alejandro Ribeiro
openaire   +2 more sources

Coding for a multiple-access channel

IEEE Transactions on Information Theory, 1976
Summary: In this paper, coding for a multiple-access discrete memoryless channel is investigated. Some bounds on the rate pairs of uniquely decodable code pairs are derived. Coding procedures based on the Reed-Muller codes and their cosets are described for the noiseless case and for correction of single errors.
Tadao Kasami, Shu Lin 0001
openaire   +3 more sources

Accessible Information in Multi-access Quantum Channels

1999
The accessible information in multi-access quantum channels are considered. Classical messages from independent sources, which are represented as some quantum states, are transported by a channel to one address. The messages can interact with each other and with external environment.
Armen E. Allahverdyan, David B. Saakian
openaire   +1 more source

Distributed broadcast channel access

Computer Networks (1976), 1979
Abstract This paper presents a general approach to sharing a broadcast channel among multiple processors. There are two components to the problem of sharing a single resource: (1) How to specify the usage pattern of the resource; and (2) How to restrict access to the resource so that the specified usage pattern can be realized.
Aloysius K. Mok, Steve Ward
openaire   +2 more sources

The Interference-Multiple-Access Channel

2009 IEEE International Conference on Communications, 2009
We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound
Perron, Etienne, Diggavi, Suhas, Telatar, Emre   +2 more
openaire   +3 more sources

Computation Over Multiple-Access Channels

IEEE Transactions on Information Theory, 2007
The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that there is no source-channel separation theorem even when the individual sources are independent. Joint source-channel strategies are developed that are optimal when the structure of the channel probability transition matrix ...
Bobak Nazer, Michael Gastpar
exaly   +3 more sources

A hybrid access method in a multiple access channel

Performance Evaluation, 1986
Abstract This paper considers a multiple-access communication channel with an infinite number of users. We show that if a controlled slotted Aloha protocol is used, then messages with variable length will have a negative impact on the average message delay.
openaire   +1 more source