22 citations · 102 across the 45 of their papers we have counts for
38 papers · 1 filter
Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels
Vishnu Teja Kunde, Jean-Francois Chamberland, Krishna R. Narayanan +1
Learning, prediction, and compression are intimately connected: a model that accurately predicts the next symbol in a sequence can be coupled with a source coder to compress that s…
Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
Henry D. Pfister, Navin Kashyap, Jean-Francois Chamberland +1
We study reliable communication over finite-state channels (FSCs) using Reed--Muller (RM) codes. Building on recent symmetry-based analyses for memoryless channels, we show that a…
Density Evolution Analysis of Sparse-Block IDMA
Jean-Francois Chamberland, Gianluigi Liva, Krishna Narayanan
Sparse block interleaver division multiple access (SB-IDMA) is a recently introduced unsourced multiple access protocol that aims to improve the performance of the grant-free two-s…
Multi-User SR-LDPC Codes
Jamison R. Ebert, Jean-Francois Chamberland, Krishna R. Narayanan
This article introduces a novel non-orthogonal multiple access (NOMA) scheme for coordinated uplink channels. The scheme builds on the recently proposed sparse-regression low-densi…
Coding for the unsourced B-channel with erasures: enhancing the linked loop code
William W. Zheng, Jamison R. Ebert, Stefano Rini +1
In [1], the linked loop code (LLC) is presented as a promising code for the unsourced A-channel with erasures (UACE). The UACE is an unsourced multiple access channel in which acti…
Evolution of the 5G New Radio Two-Step Random Access towards 6G Unsourced MAC
Patrick Agostini, Jean-Francois Chamberland, Federico Clazzer +7
This report summarizes some considerations on possible evolutions of grant-free random access in the next generation of the 3GPP wireless cellular standard. The analysis is carried…
Multi-User SR-LDPC Codes via Coded Demixing with Applications to Cell-Free Systems
Jamison R. Ebert, Jean-Francois Chamberland, Krishna R. Narayanan
Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gain…
Coding for the unsourced A-channel with erasures: the linked loop code
William W. Zheng, Jamison R. Ebert, Stefano Rini +1
The A-channel is a noiseless multiple access channel in which users simultaneously transmit Q-ary symbols and the receiver observes the set of transmitted symbols, but not their mu…
Sparse Regression LDPC Codes
Jamison R. Ebert, Jean-Francois Chamberland, Krishna R. Narayanan
This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner spa…
LLMZip: Lossless Text Compression using Large Language Models
Chandra Shekhara Kaushik Valmeekam, Krishna Narayanan, Dileep Kalathil +2
We provide new estimates of an asymptotic upper bound on the entropy of English using the large language model LLaMA-7B as a predictor for the next token given a window of past tok…
Scalable Cell-Free Massive MIMO Unsourced Random Access System
Michail Gkagkos, Jean-Francois Chamberland, Costas N. Georghiades +1
Cell-Free Massive MIMO systems aim to expand the coverage area of wireless networks by replacing a single high-performance Access Point (AP) with multiple small, distributed APs co…
PolarAir: A Compressed Sensing Scheme for Over-the-Air Federated Learning
Michail Gkagkos, Krishna R. Narayanan, Jean-Francois Chamberland +1
We explore a scheme that enables the training of a deep neural network in a Federated Learning configuration over an additive white Gaussian noise channel. The goal is to create a…
On Sparse Regression LDPC Codes
Jamison R. Ebert, Jean-Francois Chamberland, Krishna R. Narayanan
Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent d…
HashBeam: Enabling Feedback Through Downlink Beamforming in Unsourced Random Access
Jamison R. Ebert, Krishna R. Narayanan, Jean-Francois Chamberland
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 sch…
FASURA: A Scheme for Quasi-Static Massive MIMO Unsourced Random Access Channels
Michail Gkagkos, Krishna R. Narayanan, Jean-Francois Chamberland +1
This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel u…
Coded Demixing for Unsourced Random Access
Jamison R. Ebert, Vamsi K. Amalladinne, Stefano Rini +2
Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By exploiting a strong connecti…
LDPC Codes with Soft Interference Cancellation for Uncoordinated Unsourced Multiple Access
Asit Kumar Pradhan, Vamsi K. Amalladinne, Krishna R. Narayanan +1
This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding sc…
Approximate Support Recovery using Codes for Unsourced Multiple Access
Michail Gkagkos, Asit Kumar Pradhan, Vamsi Amalladinne +3
We consider the approximate support recovery (ASR) task of inferring the support of a -sparse vector from noisy measurements. We examine the case…
Coded Compressed Sensing with Successive Cancellation List Decoding for Unsourced Random Access with Massive MIMO
Vamsi K. Amalladinne, Jean-Francois Chamberland, Krishna R. Narayanan
Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical…
Stochastic Binning and Coded Demixing for Unsourced Random Access
Jamison R. Ebert, Vamsi K. Amalladinne, Stefano Rini +2
Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this mod…
Multi-Class Unsourced Random Access via Coded Demixing
Vamsi K. Amalladinne, Allen Hao, Stefano Rini +1
Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share…
An Exploration of the Heterogeneous Unsourced MAC
Allen Hao, Stefano Rini, Vamsi Amalladinne +2
The unsourced MAC model was originally introduced to study the communication scenario in which a number of devices with low-complexity and low-energy wish to upload their respectiv…
A Hybrid Approach to Coded Compressed Sensing where Coupling Takes Place via the Outer Code
Jamison R. Ebert, Vamsi K. Amalladinne, Jean-Francois Chamberland +1
This article seeks to advance coded compressed sensing (CCS) as a practical scheme for unsourced random access. The original CCS algorithm features a concatenated structure where a…
Unsourced Random Access with Coded Compressed Sensing: Integrating AMP and Belief Propagation
Vamsi K. Amalladinne, Asit Kumar Pradhan, Cynthia Rush +2
Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced r…