English
Related papers

Related papers: On the Fundamental Limits of MIMO Massive Multiple…

200 papers

The channel capacity of near-field (NF) communications is characterized by considering three types of line-of-sight multiuser channels: i) multiple access channel (MAC), ii) broadcast channel (BC), and iii) multicast channel (MC). For NF…

Information Theory · Computer Science 2024-10-29 Boqun Zhao , Chongjun Ouyang , Xingqi Zhang , Yuanwei Liu

In this paper, polar codes for the $m$-user multiple access channel (MAC) with binary inputs are constructed. It is shown that Ar{\i}kan's polarization technique applied individually to each user transforms independent uses of a $m$-user…

Information Theory · Computer Science 2010-08-10 Emmanuel Abbe , Emre Telatar

Multiple-input/multiple-output (MIMO) systems promise enormous capacity increase and are being considered as one of the key technologies for future wireless networks. However, the decrease in capacity due to the presence of interferers in…

Information Theory · Computer Science 2010-07-28 Marco Chiani , Moe Z. Win , Hyundong Shin

Massive Multiple-Input Multiple-Output (MIMO)communications uses a large number of antennas at the base station to increase the data rate and user density in future wireless systems. For simulation, it has become common practice to use…

Information Theory · Computer Science 2018-04-18 Maximilian Arnold , Marc Gauger , Stephan ten Brink

It is known that fiber nonlinearities induce crosstalk in a wavelength division multiplexed (WDM) system, which limits the capacity of such systems as the transmitted signal power is increased. A network user in a WDM system is an entity…

Information Theory · Computer Science 2022-06-07 Viswanathan Ramachandran , Gabriele Liga , Astrid Barreiro , Alex Alvarado

The capacity of a channel characterizes the maximum rate at which information can be transmitted through the channel asymptotically faithfully. For a channel with multiple senders and a single receiver, computing its sum capacity is…

Information Theory · Computer Science 2023-08-31 Akshay Seshadri , Felix Leditzky , Vikesh Siddhu , Graeme Smith

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding decays exponentially with the square root of the block…

Information Theory · Computer Science 2011-12-09 Rajai Nasser

Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible.…

Information Theory · Computer Science 2019-01-11 Sung Hoon Lim , Chen Feng , Adriano Pastore , Bobak Nazer , Michael Gastpar

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially…

Information Theory · Computer Science 2012-02-07 Stefano Rini

This paper presents a joint typicality framework for encoding and decoding nested linear codes for multi-user networks. This framework provides a new perspective on compute-forward within the context of discrete memoryless networks. In…

Information Theory · Computer Science 2016-07-01 Sung Hoon Lim , Chen Feng , Adriano Pastore , Bobak Nazer , Michael Gastpar

The capacity of commercial massive multiple-input multiple-output (mMIMO) systems is constrained by the limited array aperture at the base station, and cannot meet the ever-increasing traffic demands of wireless networks. Given the array…

Information Theory · Computer Science 2024-10-28 Keke Ying , Zhen Gao , Sheng Chen , Xinyu Gao , Michail Matthaiou , Rui Zhang , Robert Schober

In this paper, we derive Gallager's random coding error exponent for multiple-input multiple-output (MIMO) channels, assuming no channel-state information (CSI) at the transmitter and perfect CSI at the receiver. This measure gives insight…

Information Theory · Computer Science 2007-07-13 Hyundong Shin , Moe Z. Win

This paper investigates how multiuser dimensions can effectively be exploited for target degrees of freedom (DoF) in interfering broadcast channels (IBC) consisting of K-transmitters and their user groups. First, each transmitter is assumed…

Information Theory · Computer Science 2013-10-28 Jung Hoon Lee , Wan Choi , Bhaskar D. Rao

This paper proposes a new model called \emph{spatial continuum asymmetric channels} to study the channel capacity region of asymmetric scenarios in which either one source transmits to a spatial density of receivers or a density of…

Information Theory · Computer Science 2016-02-03 Jean-Marie Gorce , H. Vincent Poor , Jean-Marc Kelif

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener

We consider distributed optimization over a $d$-dimensional space, where $K$ remote clients send coded gradient estimates over an {\em additive Gaussian Multiple Access Channel (MAC)} with noise variance $\sigma_z^2$. Furthermore, the…

Information Theory · Computer Science 2023-10-06 Shubham Jha

In a multi-input multi-output (MIMO) setup, where one side of the link comprises a linear antenna array, data can be transmitted over the direction of incident rays. Channel capacity for this setup is studied in this paper. We define two…

Information Theory · Computer Science 2022-11-04 Felix Ma Yun , Jordan Nabi , Mitra Hassani

With the complication of future communication scenarios, most conventional signal processing technologies of multi-user multiple-input multiple-output (MU-MIMO) become unreliable, which are designed based on ideal assumptions, such as…

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

We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constrained…

Information Theory · Computer Science 2008-01-29 Ulrich G. Schuster , Giuseppe Durisi , Helmut Bölcskei , H. Vincent Poor

One of the major challenges in the medium access control (MAC) protocol design over cognitive Ad Hoc networks (CAHNs) is how to efficiently utilize multiple opportunistic channels, which vary dynamically and are subject to limited power…

Information Theory · Computer Science 2011-05-03 Yichen Wang , Pinyi Ren , Qinghe Du , Chao Zhang