English
Related papers

Related papers: A Remark on Downlink Massive Random Access

200 papers

A novel subcarrier-pair based opportunistic DF protocol is proposed for cooperative downlink OFDMA transmission aided by a decode-and-forward (DF) relay. Specifically, user message bits are transmitted in two consecutive equal-duration time…

Information Theory · Computer Science 2016-11-15 Tao Wang , Yong Fang , Luc Vandendorpe

In this paper, we study resource allocation algorithm design for multiuser orthogonal frequency division multiple access (OFDMA) ultra-reliable low latency communication (URLLC) in mobile edge computing (MEC) systems. To achieve the…

Information Theory · Computer Science 2020-05-12 Walid R. Ghanem , Vahid Jamali , Qiuyu Zhang , Robert Schober

Optimal resource allocation (RA) in massive carrier aggregation scenarios is a challenging combinatorial optimization problem whose dimension is proportional to the number of users, component carriers (CCs), and OFDMA resource blocks per…

Information Theory · Computer Science 2017-06-19 Stelios Stefanatos , Fotis Foukalas , Theodoros A. Tsiftsis

In Reconfigurable Intelligent Surfaces (RIS), reflective elements (REs) are typically configured as a single array, but as RE numbers increase, this approach incurs high overhead for optimal configuration. Subarray grouping provides an…

Signal Processing · Electrical Eng. & Systems 2025-03-25 Yizhu Wang , Zhou Zhang , Saman Atapattu , Marco Di Renzo

In this paper, randomly-directional beamforming (RDB) is considered for millimeter-wave (mmwave) multi-user (MU) multiple-input single-output (MISO) downlink systems. By using asymptotic techniques, the performance of RDB and the MU gain in…

Information Theory · Computer Science 2015-06-10 Gilwon Lee , Youngchul Sung , Junyeong Seo

In this paper we introduce a new class of codes for over-loaded synchronous wireless CDMA systems which increases the number of users for a fixed number of chips without introducing any errors. In addition these codes support active user…

Information Theory · Computer Science 2008-10-07 Pedram Pad , Mahdi Soltanolkotabi , Saeed Hadikhanlou , Arash Enayati , Farokh Marvasti

Concerning ultra-reliable low-latency communication (URLLC) for the downlink operating in the frequency-division multiple-access with random channel assignment, a lightweight power allocation approach is proposed to maximize the number of…

Signal Processing · Electrical Eng. & Systems 2022-08-05 Jinfei Wang , Yi Ma , Na Yi , Rahim Tafazolli

In this paper, a downlink non-orthogonal multiple access (NOMA) network is studied. We investigate the problem of jointly optimizing user pairing and beamforming design to maximize the minimum rate among all users. The considered problem…

Information Theory · Computer Science 2019-01-01 Van-Phuc Bui , Phu X. Nguyen , Hieu V. Nguyen , Van-Dinh Nguyen , Oh-Soon Shin

In this paper, we consider the downlink of large OFDMA-based networks and study their performance bounds as a function of the number of - transmitters $B$, users $K$, and resource-blocks $N$. Here, a resource block is a collection of…

Information Theory · Computer Science 2012-06-13 Rohit Aggarwal , Can Emre Koksal , Philip Schniter

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC…

Information Theory · Computer Science 2019-08-12 Fan Wei , Yongpeng Wu , Wen Chen , Yanlin Geng , Giuseppe Caire

Sparse signatures have been proposed for the CDMA uplink to reduce multi-user detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this work, we propose a Multi-Carrier CDMA (MC-CDMA) downlink…

Information Theory · Computer Science 2017-02-10 Min Li , Chunshan Liu , Stephen V. Hanly

This paper investigates downlink radio resource management (RRM) in millimeter-wave systems with codebook-based hybrid beamforming in a single cell. We consider a practical but often overlooked multi-channel scenario where the base station…

Networking and Internet Architecture · Computer Science 2024-10-28 Yuan Quan , Shahram Shahsavari , Catherine Rosenberg

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…

Information Theory · Computer Science 2017-05-15 Olga Galinina , Andrey Turlikov , Sergey Andreev , Yevgeni Koucheryavy

Massive random access plays a central role in supporting the Internet of Things (IoT), where a subset of a large population of users simultaneously transmit small packets to a central base station. While there has been much research on the…

Information Theory · Computer Science 2022-06-08 Anders E. Kalør , Radosław Kotaba , Petar Popovski

In this letter, we propose a joint resource allocation algorithm for an OFDM-based multi-user system assisted by an improved Decode-and-Forward (DF) relay. We aim at maximizing the sum rate of the system by jointly optimizing subcarrier…

Signal Processing · Electrical Eng. & Systems 2020-03-13 Yong Liu , Wen Chen

Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research interest in random access protocols, suitable to support a large number of connected devices. Slotted ALOHA and its derivatives represent a…

Information Theory · Computer Science 2013-08-08 Cedomir Stefanovic , Petar Popovski

We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users. We suggest an improved signal-code construction in which in case of a small number of users we give more resources to them.…

Information Theory · Computer Science 2016-11-17 Alexey Frolov , Victor Zyablov , Vladimir Sidorenko , Robert Fischer

Recently, the so-called cell-free Massive MIMO architecture has been introduced, wherein a very large number of distributed access points (APs) simultaneously and jointly serve a much smaller number of mobile stations (MSs). A variant of…

Information Theory · Computer Science 2017-10-24 Stefano Buzzi , Alessio Zappone

Timing advance (TA) estimation at the base station (BS) and reliable decoding of random access response (RAR) at the users are the most important steps in the initial random access (RA) procedure. However, due to the limited availability of…

Information Theory · Computer Science 2018-01-26 Sudarshan Mukherjee , Alok Kumar Sinha , Saif Khan Mohammed

Interference among concurrent transmissions in a wireless network is a key factor limiting the system performance. One way to alleviate this problem is to manage the radio resources in order to maximize either the average or the worst-case…

Machine Learning · Computer Science 2019-06-24 Navid Naderializadeh , Jaroslaw Sydir , Meryem Simsek , Hosein Nikopour , Shilpa Talwar
‹ Prev 1 3 4 5 6 7 10 Next ›