English
Related papers

Related papers: Achievable Rate Region for Iterative Multi-User De…

200 papers

We consider joint detection of co-channel signals---specifically, signals which do not possess a natural separability due to, for example, the multiple access technique or the use of multiple antennas. Iterative joint detection and decoding…

Information Theory · Computer Science 2015-08-17 Daniel J. Jakubisin , R. Michael Buehrer

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

Information Theory · Computer Science 2011-06-21 Or Ordentlich , Uri Erez

We study a layered $K$-user $M$-hop Gaussian relay network consisting of $K_m$ nodes in the $m^{\operatorname{th}}$ layer, where $M\geq2$ and $K=K_1=K_{M+1}$. We observe that the time-varying nature of wireless channels or fading can be…

Information Theory · Computer Science 2015-03-17 Sang-Woon Jeon , Sae-Young Chung , Syed A. Jafar

A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n $\to \infty$, between the interference and the interfered-with…

Information Theory · Computer Science 2018-04-17 Ronit Bustin , H. Vincent Poor , Shlomo Shamai

We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a scheme called Distributed Rate Splitting to achieve the…

Information Theory · Computer Science 2016-11-18 Jian Cao , Edmund M. Yeh

Conventional multi-user multiple-input multiple-output (MU-MIMO) mainly focused on Gaussian signaling, independent and identically distributed (IID) channels, and a limited number of users. It will be laborious to cope with the…

Information Theory · Computer Science 2022-09-20 Yuhao Chi , Lei Liu , Guanghui Song , Ying Li , Yong Liang Guan , Chau Yuen

We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An…

Information Theory · Computer Science 2007-11-13 Chao Tian , Jun Chen , Suhas Diggavi

This article shows that achieving capacity region of a 2-users weak Gaussian Interference Channel (GIC) is equivalent to enlarging the core in a nested set of Polymatroids (each equivalent to capacity region of a multiple-access channel)…

Information Theory · Computer Science 2021-02-03 Amir K. Khandani

Gaussian processes are widely used for accurate emulation of unknown surfaces in sequential design of expensive simulation experiments. Integrated mean squared error (IMSE) is an effective acquisition function for sequential designs based…

Statistics Theory · Mathematics 2026-04-23 Huanyan Zhu , Cheng Li

In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per…

Information Theory · Computer Science 2017-01-26 Zhiyong Chen , Hui Liu

In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements…

Information Theory · Computer Science 2024-08-21 Yaning Zhao , Wafa Labidi , Holger Boche , Eduard Jorswieck , Christian Deppe

A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed…

Information Theory · Computer Science 2017-01-11 Lele Wang , Young-Han Kim , Chiao-Yi Chen , Hosung Park , Eren Sasoglu

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

In this letter, we study a rate-splitting multiple access (RSMA)-based intelligent reflecting surface (IRS)-aided multi-user multiple-input single-output (MISO) secure communication system with a potential eavesdropper (Eve). Aiming to…

Information Theory · Computer Science 2022-11-28 Ying Gao , Qingqing Wu , Wen Chen , Derrick Wing Kwan Ng

This paper considers a joint scattering environment sensing and data recovery problem in an uplink integrated sensing and communication (ISAC) system. To facilitate joint scatterers localization and multi-user (MU) channel estimation, we…

Signal Processing · Electrical Eng. & Systems 2025-02-11 An Liu , Wenkang Xu , Wei Xu , Giuseppe Caire

This paper considers a low-complexity iterative Linear Minimum Mean Square Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple single-antenna…

Information Theory · Computer Science 2019-03-27 Lei Liu , Yuhao Chi , Chau Yuen , Yong Liang Guan , Ying Li

This paper considers an uplink massive machine-type communication (mMTC) scenario, where a large number of user devices are connected to a base station (BS). A novel grant-free massive random access (MRA) strategy is proposed, considering…

Information Theory · Computer Science 2021-02-23 Jia-Cheng Jiang , Hui-Ming Wang

A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryless channel (DMC) is presented. By using a similar idea for a…

Information Theory · Computer Science 2010-10-08 Ali Nazari , Achilleas Anastasopoulos , S. Sandeep Pradhan

We present an unsourced multiple access (UMAC) scheme tailored to high-mobility wireless channels. The proposed construction is based on orthogonal time frequency space (OTFS) modulation and sparse interleaver division multiple access…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Davide Bergamasco , Federico Clazzer , Paolo Casari