22 citations · 23 across the 11 of their papers we have counts for
11 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…
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…
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…
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…
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…
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…
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…