English
Related papers

Related papers: Tensor-Based Modulation for Unsourced Massive Rand…

200 papers

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

Unsourced random access (URA) has emerged as a candidate paradigm for massive machine-type communication (MTC) in next-generation wireless networks. While many excellent uplink schemes have been developed for URA, these schemes do not…

Information Theory · Computer Science 2022-06-06 Jamison R. Ebert , Krishna R. Narayanan , Jean-Francois Chamberland

This paper investigates the problem of joint massive devices separation and channel estimation for a reconfigurable intelligent surface (RIS)-aided unsourced random access (URA) scheme in the sixth-generation (6G) wireless networks. In…

Information Theory · Computer Science 2021-08-26 Xiaodan Shao , Lei Cheng , Xiaoming Chen , Chongwen Huang , Derrick Wing Kwan Ng

This work focuses on the construction of optimized binary signaling schemes for two-sender uncoded transmission of correlated sources over non-orthogonal Gaussian multiple access channels. Specifically, signal constellations with binary…

Information Theory · Computer Science 2017-07-20 Jian-Jia Weng , Fady Alajaji , Tamás Linder

We study the problem of low-rank tensor factorization in the presence of missing data. We ask the following question: how many sampled entries do we need, to efficiently and exactly reconstruct a tensor with a low-rank orthogonal…

Machine Learning · Statistics 2014-06-12 Prateek Jain , Sewoong Oh

This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on…

Information Theory · Computer Science 2022-07-27 Patrick Agostini , Zoran Utkovski , Alexis Decurninge , Maxime Guillaud , Slawomir Stanczak

We present a novel and low-complexity massive multiple-input multiple-output (MIMO) precoding strategy based on novel findings concerning the subspace separability of Rician fading channels. Considering a uniform rectangular array at the…

Signal Processing · Electrical Eng. & Systems 2020-09-22 Lucas N. Ribeiro , Stefan Schwarz , André L. F. de Almeida , Martin Haardt

This paper proposes a tensor-based parametric modeling and estimation framework in multiple-input multiple-output (MIMO) systems assisted by intelligent reflecting surfaces (IRSs). We present two algorithms that exploit the tensor structure…

Signal Processing · Electrical Eng. & Systems 2026-05-29 Kenneth B. A. Benício , André L. F. de Almeida , Bruno Sokal , Fazal-E-Asim , Behrooz Makki , Gabor Fodor

Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph…

Information Theory · Computer Science 2015-03-19 Christian Schlegel , Dmitri Truhachev

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Sergio Verdu

A new submodule clustering method via sparse and low-rank representation for multi-way data is proposed in this paper. Instead of reshaping multi-way data into vectors, this method maintains their natural orders to preserve data intrinsic…

Computer Vision and Pattern Recognition · Computer Science 2016-09-29 Xinglin Piao , Yongli Hu , Junbin Gao , Yanfeng Sun , Zhouchen Lin , Baocai Yin

Many applications in data science and scientific computing involve large-scale datasets that are expensive to store and compute with, but can be efficiently compressed and stored in an appropriate tensor format. In recent years, randomized…

Numerical Analysis · Mathematics 2019-05-20 Rachel Minster , Arvind K. Saibaba , Misha E. Kilmer

In massive machine-type communications (mMTC), grant-free access is a key enabler for a massive number of users to be connected to a base station with low signaling overhead and low latency. In this paper, a two-stage genetic algorithm (GA)…

Information Theory · Computer Science 2021-08-03 Nam Yul Yu

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

This paper considers the massive MIMO unsourced random access problem in a quasi-static Rayleigh fading setting. The proposed coding scheme is based on a concatenation of a "conventional" channel code (such as, e.g., LDPC) serving as an…

Signal Processing · Electrical Eng. & Systems 2023-05-01 Patrick Agostini , Zoran Utkovski , Slawomir Stanczak

Low-rank tensors appear to be prosperous in many applications. However, the sets of bounded-rank tensors are non-smooth and non-convex algebraic varieties, rendering the low-rank optimization problems to be challenging. To this end, we…

Optimization and Control · Mathematics 2024-11-22 Bin Gao , Renfeng Peng , Ya-xiang Yuan

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

Numerical Analysis · Mathematics 2014-11-04 Holger Rauhut , Reinhold Schneider , Zeljka Stojanac

A new non-orthogonal multiple access scheme performing simultaneous transmission to multiple users characterized by different signal-to-noise ratios is proposed. Different users are multiplexed by storing their codewords into a multiplexing…

Information Theory · Computer Science 2015-01-29 Alberto G. Perotti , Branislav M. Popovic

We consider an unsourced random access (URA) system enhanced with a feedback mechanism that serves both communication and sensing tasks. While traditional URA systems do not incorporate feedback, we propose a novel feedback signal design…

Information Theory · Computer Science 2025-06-26 Mohammad Javad Ahmadi , Mohammad Kazemi , Rafael F. Schaefer

An uplink system with a single antenna transmitter and a single receiver with a large number of antennas is considered. We propose an energy-detection-based single-shot noncoherent communication scheme which does not use the instantaneous…

Information Theory · Computer Science 2015-07-20 Alexandros Manolakos , Mainak Chowdhury , Andrea J. Goldsmith