English
Related papers

Related papers: A Fully Bayesian Approach for Massive MIMO Unsourc…

200 papers

Massive multiple-input multiple-output (MIMO) is a fundamental enabler to provide high data throughput in next generation cellular networks. By equipping the base stations (BSs) with tens or hundreds of antenna elements, narrow and high…

Networking and Internet Architecture · Computer Science 2018-01-26 Paolo Baracca , Andreas Weber , Thorsten Wild , Christophe Grangeat

This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset…

Information Theory · Computer Science 2017-08-31 Elsa Dupraz , Thomas Maugey , Aline Roumy , Michel Kieffer

In the research of next-generation wireless communication technologies, orthogonal time frequency space (OTFS) modulation is emerging as a promising technique for high-speed mobile environments due to its superior efficiency and robustness…

Signal Processing · Electrical Eng. & Systems 2025-04-29 Yanfeng Hu , Dongming Wang , Xinjiang Xia , Jiamin Li , Pengcheng Zhu , Xiaohu You

Grant-free non-orthogonal multiple access (NOMA) is promising to achieve low latency massive access in Internet of Things (IoT) applications. In grant-free NOMA, pilot signals are often used for user activity detection (UAD) and channel…

Information Theory · Computer Science 2021-12-15 Yuanyuan Zhang , Zhengdao Yuan , Qinghua Guo , Zhongyong Wang , Jiangtao Xi , Yonghui Li

In this paper, we investigate an unsourced random access scheme for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks with sporadic data traffic. Firstly, we establish a general framework for massive…

Information Theory · Computer Science 2022-03-01 Feiyan Tian , Xiaoming Chen , Lei Liu , Derrick Wing Kwan Ng

Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it is vulnerable to `difficult' measurement matrices as AMP can easily diverge. Damped AMP has been…

Information Theory · Computer Science 2019-08-20 Man Luo , Qinghua Guo

In this work we aim to solve the compressed sensing problem for the case of a complex unknown vector by utilizing the Bayesian-optimal structured signal approximate message passing (BOSSAMP) algorithm on the jointly sparse real and…

Information Theory · Computer Science 2015-11-30 Gabor Hannak , Martin Mayer , Gerald Matz , Norbert Goertz

In this letter, we propose a novel tensor-based modulation scheme for massive unsourced random access. The proposed modulation can be deemed as a summation of third-order tensors, of which the factors are representatives of subspaces. A…

Signal Processing · Electrical Eng. & Systems 2021-12-07 Zhenting Luan , Yuchi Wu , Shansuo Liang , Liping Zhang , Wei Han , Bo Bai

This letter investigates bit-interleaved coded multiple beamforming (BICMB) with perfect coding in millimeter-wave (mm-wave) massive multiple-input multiple-output (MIMO) systems to achieve both maximum diversity gain and multiplexing gain.…

Information Theory · Computer Science 2020-05-07 Sadjad Sedighi , Ender Ayanoglu

Due to the massive number of devices in the M2M communication era, new challenges have been brought to the existing random-access (RA) mechanism, such as severe preamble collisions and resource block (RB) wastes. To address these problems,…

Information Theory · Computer Science 2019-10-09 Zhaoji Zhang , Ying Li , Lei Liu , Huimei Han

Large Language Models (LLMs) generalize across tasks via reusable representations and flexible reasoning, yet remain brittle in real deployment under evolving tasks and continual distribution shift. A common approach is Test-Time Adaptation…

Machine Learning · Computer Science 2026-04-02 Xiao Zhang , Juntao Lyu , Tianyu Hu , Qianchuan Zhao , Huimin Ma

We address the problem of Bayesian reinforcement learning using efficient model-based online planning. We propose an optimism-free Bayes-adaptive algorithm to induce deeper and sparser exploration with a theoretical bound on its performance…

Machine Learning · Computer Science 2020-06-30 Divya Grover , Debabrota Basu , Christos Dimitrakakis

We address the problem of the bit error rate (BER) performance gap between the sub-optimal and optimal linear precoder (LP) for a multiuser (MU) multiple input and multiple output (MIMO) broadcast systems in this paper. Particularly, mobile…

Information Theory · Computer Science 2016-12-08 Md. Abdul Latif Sarker

The design of highly scalable multiple access schemes is a main challenge in the evolution towards future massive machine-type communications, where reliability and latency constraints must be ensured to a large number of uncoordinated…

Information Theory · Computer Science 2022-03-01 Lorenzo Valentini , Alberto Faedi , Marco Chiani , Enrico Paolini

When recovering a sparse signal from noisy compressive linear measurements, the distribution of the signal's non-zero coefficients can have a profound effect on recovery mean-squared error (MSE). If this distribution was apriori known, then…

Information Theory · Computer Science 2015-06-05 Jeremy P. Vila , Philip Schniter

This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n,…

Information Theory · Computer Science 2009-03-09 Alyson K. Fletcher , Sundeep Rangan , Vivek K Goyal

This paper addresses the unsourced/uncoordinated random access problem in an integrated sensing and communications (ISAC) system, with a focus on uplink multiple access code design. Recent theoretical advancements highlight that an ISAC…

Information Theory · Computer Science 2025-04-25 Zhentian Zhang , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its…

Information Theory · Computer Science 2024-06-11 Mert Ozates , Mohammad Kazemi , Tolga M. Duman

An asynchronous $\ka$-active-user unsourced multiple access channel (AUMAC) is a key model for uncoordinated massive access in future networks. We focus on a scenario where each transmission is subject to the maximal delay constraint…

Information Theory · Computer Science 2025-01-28 Jyun-Sian Wu , Pin-Hsun Lin , Marcel A. Mross , Eduard A. Jorswieck

A network model is considered where Poisson distributed base stations transmit to $N$ power-domain non-orthogonal multiple access (NOMA) users (UEs) each {that employ successive interference cancellation (SIC) for decoding}. We propose…

Information Theory · Computer Science 2018-10-16 Konpal Shaukat Ali , Martin Haenggi , Hesham ElSawy , Anas Chaaban , Mohamed-Slim Alouini