Results 241 to 250 of about 1,422,467 (276)
Some of the next articles are maybe not open access.
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
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, 2007The 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, 2009We 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, 2011We 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, 2013This 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), 2016Relay 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
Delay‐universal codes for multiple access channels
Transactions on Emerging Telecommunications Technologies, 2015AbstractIn this paper, we propose delay‐universal or ‘anytime’ code design for multiple access channels. The anytime characteristics of the proposed coding scheme are investigated asymptotically over two different multiple access channels. For the simplest multiple access channel, we derive the analytical delay‐exponent of the proposed code by using ...
Md. Noor‐A‐Rahim +2 more
openaire +2 more sources
Commitment over Multiple-Access Channels
2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2022Remi Chou, Matthieu R. Bloch
openaire +1 more source
Decoding for multiple-access channels
2005We discuss some results in coding and decoding for multiple-access channels. A new approach to choosing codes and users' energies for that channel is described. For the case when a bit error probability and a decoding complexity are fixed we construct a region of achievable code rates.
openaire +1 more source
Mismatched decoding and the multiple-access channel
IEEE Transactions on Information Theory, 1996An achievable region is derived for the multiple-access channel under decoding mismatch conditions. It is shown that achievable rates higher than the random coding capacity of the single-user mismatched channel can sometimes be demonstrated by treating the single-user channel as a multiple-access channel. Refining these ideas we derive a lower bound on
openaire +1 more source