English
Related papers

Related papers: On Rate-Splitting by a Secondary Link in Multiple …

200 papers

In high speed railways (HSRs) communication system, when a train travels along the railway with high velocity, the wireless channel between the train and base station varies strenuously, which makes it essential to implement appropriate…

Information Theory · Computer Science 2014-11-24 Tao Li , Pingyi Fan , Ke Xiong , K. B. Letaief

We consider a two-user Gaussian interference channel with heterogeneous blocklength constraints (HB-GIC), strong interference, and two private messages. We propose to apply the successive interference cancellation with early decoding, i.e.,…

Information Theory · Computer Science 2023-11-17 Kailun Dong , Pin-Hsun Lin , Marcel Mross , Eduard A. Jorswieck

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

Information Theory · Computer Science 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

Rate-splitting multiple access (RSMA), relying on linearly precoded rate-splitting (RS) at the transmitter and successive interference cancellation (SIC) at the receivers has emerged as a powerful and flexible multiple access strategy for…

Information Theory · Computer Science 2021-04-02 Longfei Yin , Onur Dizdar , Bruno Clerckx

The rate of a network code is the ratio of the block size of the network's messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general…

Information Theory · Computer Science 2018-01-31 Joseph Connelly , Kenneth Zeger

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

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

The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multi-way relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate…

Information Theory · Computer Science 2015-03-14 Deniz Gunduz , Aylin Yener , Andrea Goldsmith , H. Vincent Poor

Considering a general input distribution, using Gel'fand-Pinsker full binning scheme and the Han- Kobayashi (HK) jointly decoding strategy, we obtain a new achievable rate region for the cognitive radio channel (CRC) and then derive a…

Information Theory · Computer Science 2010-08-26 Ghosheh Abed Hodtani

Interference is a major issue limiting the performance in wireless networks. Cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited in most…

Information Theory · Computer Science 2009-11-12 I-Hsiang Wang , David N. C. Tse

Examined in this paper, is the Gray and Wyner achievable lossy rate region for a tuple of correlated multivariate Gaussian random variables (RVs) $X_1 : \Omega \rightarrow {\mathbb R}^{p_1}$ and $X_2 : \Omega \rightarrow {\mathbb R}^{p_2}$…

Information Theory · Computer Science 2022-05-17 Evagoras Stylianou , Charalambos D. Charalambous , Jan H. van Schuppen

The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…

Information Theory · Computer Science 2015-02-17 Ritesh Kolte , Ayfer Özgür , Haim Permuter

We consider a spectrum sharing scenario, where a secondary network coexists with a primary network of multiple transceivers. The secondary network consists of an energy-constrained decode-and-forward secondary relay which assists the…

Information Theory · Computer Science 2015-09-03 Sanket S. Kalamkar , Adrish Banerjee

Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem…

Information Theory · Computer Science 2016-11-17 Yiwei Song , Natasha Devroye , Huai-Rong Shao , Chiu Ngo

The two-user Gaussian interference channel (GIC) has been extensively studied in the literature during the last four decades. The full characterization of the capacity region of the GIC is a long-standing open problem, except the case of…

Information Theory · Computer Science 2018-04-10 Wasim Huleihel , Neri Merhav

A sender wishes to broadcast a message of length $n$ over an alphabet to $r$ users, where each user $i$, $1 \leq i \leq r$ should be able to receive one of $m_i$ possible messages. The broadcast channel has noise for each of the users…

Information Theory · Computer Science 2011-12-30 Amit Weinstein

We consider the problem of communication over a three user discrete memoryless interference channel ($3-$IC). The current known coding techniques for communicating over an arbitrary $3-$IC are based on message splitting, superposition…

Information Theory · Computer Science 2022-03-02 Arun Padakandla , Aria G. Sahebi , S. Sandeep Pradhan

In this work, we develop a pair of rate-diverse encoder and decoder for a two-user Gaussian multiple access channel (GMAC). The proposed scheme enables the users to transmit with the same codeword length but different coding rates under…

Information Theory · Computer Science 2021-03-23 Pingping Chen , Long Shi , Yi Fang , Francis C. M. Lau , Jun Cheng

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

The current framework of network utility maximization for distributed rate allocation assumes fixed channel code rates. However, by adapting the physical layer channel coding, different rate-reliability tradeoffs can be achieved on each…

Networking and Internet Architecture · Computer Science 2007-05-23 Jang-Won Lee , Mung Chiang , A. Robert Calderbank
‹ Prev 1 8 9 10 Next ›