English
Related papers

Related papers: Joint Message Detection and Channel Estimation for…

200 papers

We consider an extension of the massive unsourced random access originally proposed by Polyanskiy to the case where the receiver has a very large number of antennas (a massive MIMO base station) and no channel state information is given to…

Information Theory · Computer Science 2019-01-04 Alexander Fengler , Giuseppe Caire , Peter Jung , Saeid Haghighatshoar

Rate-splitting multiple access (RSMA) has been recognized as a promising physical layer strategy for 6G. Motivated by ever increasing popularity of cache-enabled content delivery in wireless communications, this paper proposes an innovative…

Information Theory · Computer Science 2022-04-26 Robert-Jeron Reifert , Alaa Alameer Ahmad , Yijie Mao , Aydin Sezgin , Bruno Clerckx

The coded caching scheme proposed by Maddah-Ali and Niesen considers the delivery of files in a given content library to users through a deterministic error-free network where a common multicast message is sent to all users at a fixed rate,…

Information Theory · Computer Science 2020-05-29 Mozhgan Bayat , Ratheesh K. Mungara , Giuseppe Caire

Massive grant-free transmission and cell-free wireless communication systems have emerged as pivotal enablers for massive machine-type communication. This paper proposes a deep-unfolding-based joint activity and data detection (DU-JAD)…

Information Theory · Computer Science 2024-02-29 Gangle Sun , Wenjin Wang , Wei Xu , Christoph Studer

Massive access is one of the main use cases of beyond 5G (B5G) wireless networks and massive MIMO is a key technology for supporting it. Prior works studied massive access in the co-located massive MIMO framework. In this paper, we…

Information Theory · Computer Science 2021-05-24 Unnikrishnan Kunnath Ganesan , Emil Björnson , Erik G. Larsson

In massive machine-type communications, data transmission is usually considered sporadic, and thus inherently has a sparse structure. This paper focuses on the joint activity detection (AD) and channel estimation (CE) problems in…

Information Theory · Computer Science 2023-06-06 Ye Xue , An Liu , Yang Li , Qingjiang Shi , Vincent Lau

In this work, we develop a pair of rate-diverse encoder and decoder for a two-user Gaussian multiple access channel (GMAC). The proposed scheme enables the users to transmit with the same codeword length but different coding rates under…

Information Theory · Computer Science 2021-03-23 Pingping Chen , Long Shi , Yi Fang , Francis C. M. Lau , Jun Cheng

The number of wireless devices is drastically increasing, resulting in many devices contending for radio resources. In this work, we present an algorithm to detect active devices for unsourced random access, i.e., the devices are…

Information Theory · Computer Science 2023-01-13 Gilles Callebaut , François Rottenberg , Liesbet Van der Perre , Erik G. Larsson

This paper proposes a pilot-aware, degeneracy-driven Agent-Based Modelling (ABM) framework for distributed resource allocation in RSMA-enabled multi-user MIMO systems under imperfect Channel State Information (CSI) and residual Successive…

Signal Processing · Electrical Eng. & Systems 2026-05-06 Sayanti Ghosh , Indrakshi Dey , Nicola Marchetti

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the…

Information Theory · Computer Science 2021-08-11 Alexander Fengler , Peter Jung , Giuseppe Caire

In this work, we present the design for both pilot-uncoupled and pilot-free on-off multiple access (ODMA) receivers in unsourced random access (URA) for multiple-input multiple-output (MIMO) systems. Unlike pilot-coupled ODMA, where on-off…

Information Theory · Computer Science 2025-05-26 Zhentian Zhang , Jian Dang , Zaichen Zhang

In this work, based on the hybrid generalized approximate message passing (HyGAMP) algorithm, we propose the message-scheduling GAMP (MSGAMP) algorithm in order to address the problem of joint active device detection and channel estimation…

Information Theory · Computer Science 2021-06-15 R. B. Di Renna , R. C. de Lamare

We consider multiple transmitters aiming to communicate their source signals (e.g., images) over a multiple access channel (MAC). Conventional communication systems minimize interference by orthogonally allocating resources (time and/or…

Networking and Internet Architecture · Computer Science 2025-04-08 Selim F. Yilmaz , Can Karamanli , Deniz Gunduz

In this paper, we investigate the design of linear precoders for multiple-input multiple-output (MIMO) multiple access channels (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider…

Information Theory · Computer Science 2014-01-22 Yongpeng Wu , Chao-Kai Wen , Chengshan Xiao , Xiqi Gao , Robert Schober

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known…

Information Theory · Computer Science 2021-03-19 Recep Can Yavas , Victoria Kostina , Michelle Effros

Co-channel interference poses a challenge in any wireless communication network where the time-frequency resources are reused over different geographical areas. The interference is particularly diverse in cell-free massive multiple-input…

Signal Processing · Electrical Eng. & Systems 2024-04-19 Mahmoud Zaher , Emil Björnson , Marina Petrova

We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in decoding…

Information Theory · Computer Science 2024-12-09 Han Wu , Hamdi Joudeh

This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…

Information Theory · Computer Science 2016-11-17 Jie Luo , Anthony Ephremides

We propose a fast and near-optimal approach to joint channel-estimation, equalization, and decoding of coded single-carrier (SC) transmissions over frequency-selective channels with few-bit analog-to-digital converters (ADCs). Our approach…

Information Theory · Computer Science 2019-01-30 Peng Sun , Zhongyong Wang , Robert W. Heath , Philip Schniter

We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook with entries generated from a $q$-ary alphabet. At each…

Information Theory · Computer Science 2022-10-06 Alejandro Lancho , Alexander Fengler , Yury Polyanskiy