English
Related papers

Related papers: BiSPARCs for Unsourced Random Access in Massive MI…

200 papers

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

Sparse coding is an unsupervised learning algorithm that learns a succinct high-level representation of the inputs given only unlabeled data; it represents each input as a sparse linear combination of a set of basis functions. Originally…

Machine Learning · Computer Science 2012-06-26 Roger Grosse , Rajat Raina , Helen Kwong , Andrew Y. Ng

This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns,…

Information Theory · Computer Science 2019-08-06 Federico Clazzer , Balazs Matuz , Sachini Jayasooriya , Mahyar Shirvanimoghaddam , Sarah J. Johnson

Massive random access of devices in the emerging Open Radio Access Network (O-RAN) brings great challenge to the access control and management. Exploiting the bursting nature of the access requests, sparse active user detection (SAUD) is an…

Machine Learning · Computer Science 2023-03-07 Xiao Tang , Sicong Liu , Xiaojiang Du , Mohsen Guizani

A promising approach to deal with the high hardware cost and energy consumption of massive MIMO transmitters is to use low-resolution digital-to-analog converters (DACs) at each antenna element. This leads to a transmission scheme where the…

Information Theory · Computer Science 2023-10-10 Zheyu Wu , Junjie Ma , Ya-Feng Liu , A. Lee Swindlehurst

In this paper, a sparse Kronecker-product (SKP) coding scheme is proposed for unsourced multiple access. Specifically, the data of each active user is encoded as the Kronecker product of two component codewords with one being sparse and the…

Information Theory · Computer Science 2021-06-04 Zeyu Han , Xiaojun Yuan , Chongbin Xu , Shuchao Jiang , Xin Wang

Sparse superposition codes were originally proposed as a capacity-achieving communication scheme over the gaussian channel, whose coding matrices were made of i.i.d. gaussian entries.We extend this coding scheme to more generic ensembles of…

Information Theory · Computer Science 2022-05-27 TianQi Hou , YuHao Liu , Teng Fu , Jean Barbier

Sparse regression codes (SPARCs) are a promising coding scheme that can approach the Shannon limit over Additive White Gaussian Noise (AWGN) channels. Previous works have proven the capacity-achieving property of SPARCs with Gaussian design…

Information Theory · Computer Science 2023-03-16 Yizhou Xu , YuHao Liu , ShanSuo Liang , Tingyi Wu , Bo Bai , Jean Barbier , TianQi Hou

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user…

Information Theory · Computer Science 2017-02-14 Emil Björnson , Elisabeth de Carvalho , Jesper H. Sørensen , Erik G. Larsson , Petar Popovski

Information transmission over a multiple-input-multiple-output (MIMO) fading channel with imperfect channel state information (CSI) is investigated, under a new receiver architecture which combines the recently proposed generalized nearest…

Information Theory · Computer Science 2021-09-02 Shuqin Pang , Wenyi Zhang

We consider a coded compressed sensing approach for the unsourced random access and replace the outer tree code proposed by Amalladinne et al. with the list recoverable code capable of correcting t errors. A finite-length random coding…

Information Theory · Computer Science 2022-01-20 Kirill Andreev , Pavel Rybin , Alexey Frolov

We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output…

Information Theory · Computer Science 2016-11-17 André Uchoa , Cornelius T. Healy , Rodrigo C. de Lamare

Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are…

Information Theory · Computer Science 2025-09-30 Kirill Andreev , Pavel Rybin , Alexey Frolov

This paper studies a two-layer decoding method that mitigates inter-cell interference in multi-cell Massive MIMO systems. In layer one, each base station (BS) estimates the channels to intra-cell users and uses the estimates for local…

Information Theory · Computer Science 2019-03-19 Trinh Van Chien , Christopher Mollén , Emil Björnson

We present a novel feedback protocol for wireless broadcast networks that utilize linear network coding. We consider transmission of packets from one source to many receivers over a single-hop broadcast erasure channel. Our method utilizes…

Networking and Internet Architecture · Computer Science 2015-03-19 Arman Rezaee , Linda Zeger , Muriel Médard

One key feature of massive multiple-input multiple-output systems is the large number of antennas and users. As a result, reducing the computational complexity of beamforming design becomes imperative. To this end, the goal of this paper is…

Information Theory · Computer Science 2019-02-08 Shuai Wang , Lei Cheng , Minghua Xia , Yik-Chung Wu

In this paper, we investigate a joint device activity detection (DAD), channel estimation (CE), and data decoding (DD) algorithm for multiple-input multiple-output (MIMO) massive unsourced random access (URA). Different from the…

Information Theory · Computer Science 2021-12-20 Tianya Li , Yongpeng Wu , Mengfan Zheng , Wenjun Zhang , Chengwen Xing , Jianping An , Xiang-Gen Xia , Chengshan Xiao

Multiple-input multiple-output (MIMO) is a key ingredient of next-generation wireless communications. Recently, various MIMO signal detectors based on deep learning techniques and quantum(-inspired) algorithms have been proposed to improve…

Information Theory · Computer Science 2023-07-25 Satoshi Takabe

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu