English
Related papers

Related papers: On a Multiple-Access in a Vector Disjunctive Chann…

200 papers

An information-spectrum approach is applied to solve the multiterminal source coding problem for correlated general sources, where sources may be nonstationary and/or nonergodic, and the distortion measure is arbitrary and may be…

Information Theory · Computer Science 2007-07-13 Shengtian Yang , Peiliang Qiu

We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…

Information Theory · Computer Science 2009-05-12 Sang-Woon Jeon , Sae-Young Chung

Massive MIMO (mMIMO) enables users with different requirements to get connected to the same base station (BS) on the same set of resources. In the uplink of Multiuser massive MIMO (MU-mMIMO), while such heterogeneous users are served,…

Signal Processing · Electrical Eng. & Systems 2024-03-28 S. Sowmya , Gokularam Muthukrishnan , K. Giridhar

Many practical wireless communications systems select their transmit rate from a finite set of modulation and coding schemes, which correspond to a set of discrete rates. In this paper, we therefore formulate a joint coordinated precoding…

Information Theory · Computer Science 2016-04-20 Rasmus Brandt , Mats Bengtsson

We consider the problem of decentralized power allocation for competitive rate-maximization in a frequency-selective Gaussian interference channel under bounded channel uncertainty. We formulate a distribution-free robust framework for the…

Information Theory · Computer Science 2015-03-17 Amod J. G. Anandkumar , Animashree Anandkumar , Sangarapillai Lambotharan , Jonathon A. Chambers

We propose a method to increase the capacity achieved by uniform prior in discrete memoryless channels (DMC) with high input cardinality. It consists in appropriately reducing the input set. Different design criteria of the input subset are…

Information Theory · Computer Science 2010-10-28 Amine Mezghani , Michel T. Ivrlac , Josef A. Nossek

A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower…

Information Theory · Computer Science 2018-08-03 A. G. Dyachkov , N. Polyanskii , V. Shchukin , I. Vorobyev

While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources…

Information Theory · Computer Science 2015-10-14 Anindya Gupta , B. Sundar Rajan

Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph…

Information Theory · Computer Science 2015-03-19 Christian Schlegel , Dmitri Truhachev

This work considers the problem of transmitting multiple compressible sources over a network at minimum cost. The aim is to find the optimal rates at which the sources should be compressed and the network flows using which they should be…

Information Theory · Computer Science 2009-08-13 Aditya Ramamoorthy

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

Information Theory · Computer Science 2013-03-11 Fangfang Zhu , Biao Chen

Dealing with broadcast scenarios has become a relevant topic in the scientific community. Because of interference, resource management presents a challenge, specially when spatial diversity is introduced. Many researches presented…

Signal Processing · Electrical Eng. & Systems 2020-07-17 Pol Henarejos

We investigate the capacity of the $Q$-frequency $S$-user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated types of transmission are considered. Asymptotic (under the…

Information Theory · Computer Science 2014-01-10 Alexey Frolov , Pavel Rybin , Victor Zyablov

We present a general rate duality between the multiple access channel (MAC) and the broadcast channel (BC) which is applicable to systems with and without nonlinear interference cancellation. Different to the state-of-the-art rate duality…

Information Theory · Computer Science 2016-11-15 Raphael Hunger , Michael Joham

Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to…

Data Structures and Algorithms · Computer Science 2018-09-17 Ran Ben Basat , Seungbum Jo , Srinivasa Rao Satti , Shubham Ugare

In this work we show how an improved lower bound to the error exponent of the memoryless multiple-access (MAC) channel is attained via the use of linear codes, thus demonstrating that structure can be beneficial even in cases where there is…

Information Theory · Computer Science 2016-11-18 Eli Haim , Yuval Kochman , Uri Erez

In this paper, we consider the problem of power control for sum rate maximization on multiple interfering links (TX-RX pairs)under sum power constraint. We consider a single frequency network, where all pairs are operating in same frequency…

Information Theory · Computer Science 2016-11-17 Naveed Ul Hassan , Chau Yuen , Shayan Saeed , Zhaoyang Zhang

This letter investigates joint power control and user clustering for downlink non-orthogonal multiple access systems. Our aim is to minimize the total power consumption by taking into account not only the conventional transmission power but…

Information Theory · Computer Science 2018-05-09 Zhaohui Yang , Cunhua Pan , Wei Xu , Ming Chen

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

We consider the problem of polar coding for transmission over $m$-user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a joint successive cancellation decoder is deployed at the…

Information Theory · Computer Science 2016-11-17 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang