English
Related papers

Related papers: On OR Many-Access Channels

200 papers

In this paper, iterative multi-user detection techniques for multi-beam communications are presented. The solutions are based on a successive interference cancellation architecture and a channel decoding to treat the co-channel…

Networking and Internet Architecture · Computer Science 2012-02-10 Helmi Chaouech , Ridha Bouallegue

A non-orthogonal multiple access (NOMA) approach that always outperforms orthogonal multiple access (OMA) called Fair-NOMA is introduced. In Fair-NOMA, each mobile user is allocated its share of the transmit power such that its capacity is…

Information Theory · Computer Science 2017-04-26 Jose Armando Oviedo , Hamid R. Sadjadpour

In ALOHA-type packetized network, the transmission times of packets follow a stochastic process. In this paper, we advocate a deterministic approach for channel multiple-access. Each user is statically assigned a periodic protocol signal,…

Information Theory · Computer Science 2009-09-29 Kenneth W. Shum , Chi Wan Sung

Applications like environmental sensing, and health and activity sensing, are supported by networks of devices (nodes) that send periodic packet transmissions over the wireless channel to a sink node. We look at simple abstractions that…

Information Theory · Computer Science 2017-05-10 Sanjit K. Kaul , Roy D. Yates

In this paper, we study the power-efficient resource allocation for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The resource allocation algorithm design is formulated as a non-convex optimization problem which takes into…

Information Theory · Computer Science 2016-07-06 Zhiqiang Wei , Derrick Wing Kwan Ng , Jinhong Yuan

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

The problem of characterising the zero-error capacity region for multiple access channels even in the noiseless case has remained an open problem for over three decades. Motivated by this challenging question, a recently developed theory of…

Information Theory · Computer Science 2019-10-29 Ghassen Zafzouf , Girish N. Nair , Jamie S. Evans

A novel transmission protocol is conceived for a multi-user, multi-relay, multiple-input--multiple-output orthogonal frequency-division multiple-access (MIMO-OFDMA) cellular network based on joint transmit and receive beamforming. More…

Information Theory · Computer Science 2016-09-20 Kent Tsz Kan Cheung , Shaoshi Yang , Lajos Hanzo

The key idea of non-orthogonal multiple access (NOMA) is to serve multiple users simultaneously at the same time and frequency, which can result in excessive multiple-access interference. As a crucial component of NOMA systems, successive…

Information Theory · Computer Science 2020-05-21 Z. Ding , R. Schober , H. V. Poor

The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is…

Statistical Mechanics · Physics 2009-11-07 Michal Rosen-Zvi , Andreas Engel , Ido Kanter

This paper investigates the optimal power allocation scheme for sum throughput maximization of non-orthogonal multiple access (NOMA) system with $\alpha$-fairness. In contrast to the existing fairness NOMA models, $\alpha$-fairness can only…

Information Theory · Computer Science 2017-08-04 Peng Xu , Kanapathippillai Cumanan

We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the…

Quantum Physics · Physics 2009-11-10 Jonathan Ball , Andrzej Dragan , Konrad Banaszek

Rodrigo de Miguel et al 2007 J. Phys. A: Math. Theor. 40 5241-5260: A noisy vector channel operating under a strict complexity constraint at the receiver is introduced. According to this constraint, detected bits, obtained by performing…

Information Theory · Computer Science 2009-11-11 Rodrigo de Miguel , Ori Shental , Ralf R. Muller , Ido Kanter

We consider the distributed channel access problem for a system consisting of multiple control subsystems that close their loop over a shared wireless network. We propose a distributed method for providing deterministic channel access…

Systems and Control · Electrical Eng. & Systems 2024-10-28 Tahmoores Farjam , Henk Wymeersch , Themistoklis Charalambous

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

Presence of multiple antennas on both sides of a communication channel promises significant improvements in system throughput and power efficiency. In effect, a new class of large multiple-input multiple-output (MIMO) communication systems…

Information Theory · Computer Science 2014-01-28 Maksym A. Girnyk , Mikko Vehkaperä , Lars K. Rasmussen

Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A…

Information Theory · Computer Science 2012-05-31 Idan Livni , Anatoly Khina , Ayal Hitron , Uri Erez

The performance of systems where multiple users communicate over wireless fading links benefits from channel-adaptive allocation of the available resources. Different from most existing approaches that allocate resources based on perfect…

Information Theory · Computer Science 2009-09-07 Antonio G. Marques , Georgios B. Giannakis , Javier Ramos

The multiple access scheduling decides how the channel is shared among the nodes in the network. Typical scheduling algorithms aims at increasing the channel utilization and thereby throughput of the network. This paper describes several…

Information Theory · Computer Science 2025-09-30 Vijaya Yajnanarayana , Klas E. G. Magnusson , Rasmus Brandt , Satyam Dwivedi , Peter Händel

This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›