Results 271 to 280 of about 1,856,218 (327)
Some of the next articles are maybe not open access.

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.
Y. Watanabe, K. Kamoi
openaire   +1 more source

Channel aware scheduling for multiple antenna multiple access channels

The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, 2004
In this paper, we study the optimum transmission strategy of the multiple access channel in a cellular system in which the base station has multiple antennas. Recently, scheduling algorithms incorporating both the physical and data link layer were proposed e.g. in H. Boche and M. Wiczanowski, (2003), M. J. Neely, et al., (Feb. 2003), E. M. Yeh, (2002),
H. Boche, E.A. Jorswieck, T. Haustein
openaire   +1 more source

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   +1 more source

Multiple Access Covert Channels

2005
Abstract : In this paper we consider the situation of multiple malicious transmitters attempting to covertly communicate with a single receiver, We show how the situation of non-collaborating transmitters can be modeled by multiple access channels. The simpler situation of collaborating transmitters is used as a bounding result.
Richard E. Newman, Ira S. Moskowitz
openaire   +1 more source

Multiple-Access Channels

1998
In the preceding three chapters, we develop and apply the compressed-error-cancellation framework to the single-user case, i.e., the situation in which a single transmitter must send data to a single receiver. But often in practice, multiple transmitters must simultaneously send data to multiple receivers.
openaire   +1 more source

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 ...
B.. Nazer, M.. Gastpar
openaire   +1 more source

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
E. Perron, S. Diggavi, E. Telatar
openaire   +1 more source

Source-channel coding tradeoff in multiple antenna multiple access channels

2011 IEEE International Symposium on Information Theory Proceedings, 2011
We investigate channel code rates for communication of finite-dimensional analog sources over a multiple-antenna multiple access channel (MAC) so that the average end-to-end distortions are minimized. Our analysis uses the high-resolution quantization theory for the sources and the high-SNR diversity-multiplexing tradeoff for the MAC.
Ebrahim MolavianJazi   +1 more
openaire   +1 more source

The mismatched multiple-access channel: General alphabets

2013 IEEE International Symposium on Information Theory, 2013
This paper considers channel coding for the memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable error exponent. The achievable rate region recovered by the error exponent coincides with
Scarlett, Jonathan   +2 more
openaire   +1 more source

Relaying selection based multiple access relay channel

2016 24th Signal Processing and Communication Application Conference (SIU), 2016
Relay selection in case of fast cascade Rayleigh fading channels has been examined in multiple access relay channel structure which is one of the high spectral efficiency network coding applications. Error performance analysis of MARC system has been made for noncoherent binary frequency shift keying (BFSK) and it has been shown that the proposed ...
Karabulut, Muhammet Ali   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy